Logo - springer
Slogan - springer

Computer Science - Software Engineering | Verification, Model Checking, and Abstract Interpretation - 7th International Conference, VMCAI

Verification, Model Checking, and Abstract Interpretation

7th International Conference, VMCAI 2006, Charleston, SC, USA, January 8-10, 2006, Proceedings

Emerson, E. Allen, Namjoshi, Kedar S. (Eds.)

2006, XI, 443 p. Also available online.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$99.00

(net) price for USA

ISBN 978-3-540-31622-0

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$129.00

(net) price for USA

ISBN 978-3-540-31139-3

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

This book constitutes the refereed proceedings of the 7th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2006, held in Charleston, South Carolina, USA in January 2006, co-located with the Symposium on Principles of Programming Languages (POPL 2006).

The 27 revised full papers presented together with one invited paper were carefully reviewed and selected from 58 submissions. The papers feature current research from the communities of verification, model checking, and abstract interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods.

Content Level » Research

Keywords » Factor - Refactoring - abstraction - algorithms - complexity - design - model checking - program analysis - program invariants - program semantics - program verification - programming - programming calculi - structured analysis - verification

Related subjects » Software Engineering - Theoretical Computer Science

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

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Software Engineering.