Amazon cover image
Image from Amazon.com

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.

By: Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 3855Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006Description: XI, 443 p. Also available online. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540316220
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 005.1015113 23
LOC classification:
  • QA76.9.L63
  • QA76.5913
  • QA76.63
Online resources:
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?.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
E-Book E-Book Central Library Available E-42657

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?.

There are no comments on this title.

to post a comment.

Maintained by VTU Library