This volume contains the proceedings of the 5th International Conference on Veri?cation, Model Checking, and Abstract Interpretation (VMCAI 2004), held inVenice,January11 13,2004,inconjunctionwithPOPL2004,the31stAnnual SymposiumonPrinciplesofProgrammingLanguages,January14 16,2004.The purposeofVMCAIistoprovideaforumforresearchersfromthreecommunities veri?cation, model checking, and abstract interpretation which will facilitate interaction, cross-fertilization, and the advance of hybrid methods that combine thethreeareas.Withthegrowingneedforformaltoolstoreasonaboutcomplex, in?nite-state, and embedded systems, such hybrid methods are bound to be of great importance. Topics covered by VMCAI include program veri?cation, static analysis te- niques, model checking, program certi?cation, type systems, abstract domains, debugging techniques, compiler optimization, embedded systems, and formal analysis of security protocols. This year s meeting follows the four previous events in Port Je?erson (1997), Pisa (1998), Venice (2002), LNCS 2294 and New York (2003), LNCS 2575. In particular, we thank VMCAI 2003 s sponsor, the Courant Institute at New York University, for allowing us to apply a monetary surplus from the 2003 meeting to this one. The program committee selected 22 papers out of 68 on the basis of three - views.Theprincipalcriteriawererelevanceandquality.TheprogramofVMCAI 2004 included, in addition to the research papers, a keynote speech by David Harel (Weizmann Institute, Israel) onAGrand Challenge for Computing: Full Reactive Modeling of a Multicellular Animal, aninvitedtalkbyDawsonEngler(StanfordUniversity,USA)onStaticAn- ysis Versus Software Model Checking for Bug Finding, an invited talk by Mooly Sagiv (Tel Aviv University, Israel) called On the Expressive Power of Canonical Abstraction,and atutorialbyJoshuaD.Guttman(Mitre,USA)on Security, Protocols, and Trust. We would like to thank the Program Committee members and the reviewers, without whose dedicated e?ort the conference would not have been possible.

Includes supplementary material: sn.pub/extras

Autorentext
Bernhard Steffen studierte Mathematik an der Christian-Albrechts Universität zu Kiel, wo er anschließend auch in der Informatik promovierte. Nach Forschungsaufenthalten am Laboratory for Foundations in Computer Science in Edinburgh und an der Universität Aarhus, wurde er 1990 an die RWTH Aachen berufen, von wo er 1993 an die Universität Passau auf den Lehrstuhl für Programmiersysteme wechselte. Seit 1997 leitet er den Lehrstuhl für Programmiersysteme und Compilerbau an der TU-Dortmund. Bernhard Steffen ist Gründer der internationalen Konferenz über Tools and Algorithm for the Conbstruction and Analysis of Systems (TACAS) und des internationalen Journals über Software Tools for Technology Transfer (STTT).

Inhalt
Tutorial.- Security, Protocols, and Trust.- Security.- Security Types Preserving Compilation.- History-Dependent Scheduling for Cryptographic Processes.- Formal Methods I.- Construction of a Semantic Model for a Typed Assembly Language.- Rule-Based Runtime Verification.- On the Expressive Power of Canonical Abstraction.- Boolean Algebra of Shape Analysis Constraints.- Approximate Probabilistic Model Checking.- Completeness and Complexity of Bounded Model Checking.- Model Checking for Object Specifications in Hidden Algebra.- Formal Methods II.- Model Checking Polygonal Differential Inclusions Using Invariance Kernels.- Checking Interval Based Properties for Reactive Systems.- Widening Operators for Powerset Domains.- Type Inference for Parameterized Race-Free Java.- Certifying Temporal Properties for Compiled C Programs.- Verifying Atomicity Specifications for Concurrent Object-Oriented Software Using Model-Checking.- Static Analysis versus Software Model Checking for Bug Finding.- Automatic Inference of Class Invariants.- Liveness with Invisible Ranking.- A Complete Method for the Synthesis of Linear Ranking Functions.- Symbolic Implementation of the Best Transformer.- Formal Methods III.- Constructing Quantified Invariants via Predicate Abstraction.- Analysis of Recursive Game Graphs Using Data Flow Equations.- Applying Jlint to Space Exploration Software.- Why AI + ILP Is Good for WCET, but MC Is Not, Nor ILP Alone.- A Grand Challenge for Computing: Towards Full Reactive Modeling of a Multi-cellular Animal.