Franklin

Verification, Model Checking, and Abstract Interpretation [electronic resource] : 7th International Conference, VMCAI 2006, Charleston, SC, USA, January 8-10, 2006, Proceedings / edited by E. Allen Emerson, Kedar S. Namjoshi.

Edition:
1st ed. 2006.
Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues SL 1, 3855
Theoretical Computer Science and General Issues ; 3855
Format/Description:
Book
1 online resource (XI, 443 pages)
Subjects:
Software engineering.
Computer logic.
Programming languages (Electronic computers).
Local subjects:
Software Engineering. (search)
Logics and Meanings of Programs. (search)
Programming Languages, Compilers, Interpreters. (search)
System Details:
text file PDF
Contents:
Closure Operators for ROBDDs
A CLP Method for Compositional and Intermittent Predicate Abstraction
Combining Shape Analyses by Intersecting Abstractions
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS
Complexity Results on Branching-Time Pushdown Model Checking
A Compositional Logic for Control Flow
Detecting Non-cyclicity by Abstract Compilation into Boolean Functions
Efficient Strongly Relational Polyhedral Analysis
Environment Abstraction for Parameterized Verification
Error Control for Probabilistic Model Checking
Field Constraint Analysis
A Framework for Certified Program Analysis and Its Applications to Mobile-Code Safety
Improved Algorithm Complexities for Linear Temporal Logic Model Checking of Pushdown Systems
A Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs
Monitoring Off-the-Shelf Components
Parallel External Directed Model Checking with Linear I/O
Piecewise FIFO Channels Are Analyzable
Ranking Abstraction of Recursive Programs
Relative Safety
Resource Usage Analysis for the ?-Calculus
Semantic Hierarchy Refactoring by Abstract Interpretation
Strong Preservation of Temporal Fixpoint-Based Operators by Abstract Interpretation
Symbolic Methods to Enhance the Precision of Numerical Abstract Domains
Synthesis of Reactive(1) Designs
Systematic Construction of Abstractions for Model-Checking
Totally Clairvoyant Scheduling with Relative Timing Constraints
Verification of Well-Formed Communicating Recursive State Machines
What's Decidable About Arrays?.
Contributor:
Emerson, E. Allen, editor., Editor,
Namjoshi, Kedar S. editor., Editor,
SpringerLink (Online service)
Contained In:
Springer eBooks
Other format:
Printed edition:
Printed edition:
ISBN:
978-3-540-31622-0
9783540316220
Publisher Number:
10.1007/11609773 doi
Access Restriction:
Restricted for use by site license.
Loading...
Location Notes Your Loan Policy
Description Status Barcode Your Loan Policy