Verification, Model Checking, and Abstract Interpretation: 9th International Conference, VMCAI 2008, San Francisco, USA, January 7-9, 2008, ProceedingsFrancesco Logozzo, Doron A. Peled, Leonore D. Zuck Springer Science & Business Media, 26 בפבר׳ 2008 - 325 עמודים th This volumecontains the proceedingsof the 9 internationalconference onV- i?cation, Model Checking, and Abstract Interpretation (VMCAI 2008), held in San Francisco, January 7-9, 2008. The purpose of VMCAI is to provide a forum for researchers from three communities-Veri?cation, Model Checking, and - stractInterpretation-thatwill facilitate interaction, cross-fertilization, andthe advance of hybridmethods that combine the three areas.With the growingneed for formal tools to reason about complex, in?nite-state, and embedded systems, such hybrid methods are bound to be of great importance. Topics covered by VMCAI include program veri?cation, program certi?- tion, model checking, debugging techniques, abstract interpretation, abstract domains, static analysis, type systems, deductive methods, and optimization. VMCAI 2008 was the 9th VMCAI meeting. Previous meetings were held in Port Je?erson 1997, Pisa 1998, Venice 2002, New York 2003, Venice 2004, Paris 2005, Charleston 2006, and Nice 2007. The program committee selected 21 papers out of over 60 on the basis of at least three reviews. The principal criteria were relevance and quality. The program of VMCAI 2008 included, in addition to the research papers, three invited talks, by Radhia Cousot, Maurice Herlihy and Neil Jones, and three tutorials, by Orna Kupferman, Jens Palsberg, and Marco Pistoia. We would like to thank the ProgramCommittee members and the reviewers, without whose dedicated e?ort the conference would not have been possible. Our thanks also to the Steering Committee members for their helpful advice. |
תוכן
Abstract Interpretation of Nonmonotone Biinductive Semantic Definitions | 1 |
CTL as an Intermediate Language | 4 |
Multivalued Logics Automata Simulations and Games | 5 |
Verification of Register Allocators | 6 |
Program Analysis and Programming Languages for Security | 7 |
An Improved Tight Closure Algorithm for Integer Octagonal Constraints | 8 |
Handling Parameterized Systems with Nonatomic Global Conditions | 22 |
Abstract Interpretation of the Physical Inputs of Embedded Programs | 37 |
Extending Model Checking with Dynamic Analysis | 142 |
Deriving Bisimulations by Simplifying Partitions | 157 |
Precise Set Sharing Analysis for JavaStyle Programs | 172 |
Sufficient Preconditions for Modular Assertion Checking | 188 |
Runtime Checking for Separation Logic | 203 |
Decision Procedures for Multisets with Cardinality Constraints | 218 |
All You Need Is Compassion | 233 |
A ForwardBackward Abstraction Refinement Algorithm | 248 |
Diagnostic Information for Realizability | 52 |
Approximation Refinement for InterpolationBased Model Checking | 68 |
Abstract Interpretation of Cellular Signalling Networks | 83 |
Is Lazy Abstraction a Decision Procedure for Broadcast Protocols? | 98 |
Model Checking for Action Abstraction | 112 |
On Bridging Simulation and Formal Verification | 127 |
Internal and External Logics of Abstract Interpretations | 263 |
From LTL to Symbolically Represented Deterministic Automata | 279 |
Monitoring Temporal Properties of Stochastic Systems | 294 |
A Hybrid Algorithm for LTL Games | 309 |
| 324 | |
מהדורות אחרות - הצג הכל
מונחים וביטויים נפוצים
abstract domain abstract interpretation abstraction refinement algorithm approximation assertion assumptions automata automaton bisimulation Boolean bound Büchi Büchi automaton clauses closure complete configurations consider constraints counterexample Cousot defined definition denote deterministic disjunctive elements equivalent example FBAR finite fixpoint function Galois connection given guarantees Heidelberg Heidelberg 2008 implementation infinite Init initial input integer language lattice Lemma LNCS Logozzo loop LTL formula method minimal model checking monitor multiset node non-confluent obtained octagonal graph operator output over-approximation parameters parity parity automaton parity game partial order partition path pointer postcondition precondition predicate Presburger arithmetic problem procedure proof quantifier quantifier elimination reachable realizability runtime checking satisfies Section semantics separation logic sequence simulation specification Springer static analysis subset sufficient test set symbolic Theorem tight closure tion transition relation transition system unrealizable unsatisfiable variables verification VMCAI
