Verification, Model Checking, and Abstract Interpretation 10th International Conference, VMCAI 2009, Savannah, GA, USA, January 18-20, 2009. Proceedings /

The book constitutes the refereed proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2009, held in Savannah, GA, USA, in January 2009 - co-located with POPL 2009, the 36th Annual Symposium on Principles of Programming Languages. The 2...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Jones, Neil D. (Επιμελητής έκδοσης), Müller-Olm, Markus (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
Σειρά:Lecture Notes in Computer Science, 5403
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • Invited Talks
  • Model Checking: Progress and Problems
  • Model Checking Concurrent Programs
  • Thread-Modular Shape Analysis
  • Invited Tutorials
  • Advances in Program Termination and Liveness
  • Verification of Security Protocols
  • Submitted Papers
  • Towards Automatic Stability Analysis for Rely-Guarantee Proofs
  • Mostly-Functional Behavior in Java Programs
  • The Higher-Order Aggregate Update Problem
  • An Abort-Aware Model of Transactional Programming
  • Model-Checking the Linux Virtual File System
  • LTL Generalized Model Checking Revisited
  • Monitoring the Full Range of ?-Regular Properties of Stochastic Systems
  • Constraint-Based Invariant Inference over Predicate Abstraction
  • Reducing Behavioural to Structural Properties of Programs with Procedures
  • Query-Driven Program Testing
  • Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
  • Abstraction Refinement for Probabilistic Software
  • Finding Concurrency-Related Bugs Using Random Isolation
  • An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binaries
  • SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
  • Deciding Extensions of the Theories of Vectors and Bags
  • A Posteriori Soundness for Non-deterministic Abstract Interpretations
  • An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking
  • A Scalable Memory Model for Low-Level Code
  • Synthesizing Switching Logic Using Constraint Solving
  • Extending Symmetry Reduction by Exploiting System Architecture
  • Shape-Value Abstraction for Verifying Linearizability
  • Mixed Transition Systems Revisited
  • Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking.