3. VMCAI 2002: Venice, Italy
Agostino Cortesi (Ed.): Verification, Model Checking, and Abstract Interpretation, Third International Workshop, VMCAI 2002, Venice, Italy, January 21-22, 2002, Revised Papers. Springer 2002 Lecture Notes in Computer Science ISBN 3-540-43631-6
Security and Protocols
Cinzia Bernardeschi, Nicoletta De Francesco: Combining Abstract Interpretation and Model Checking for Analysing Security Properties of Java Bytecode. 1-15
Riccardo Focardi, Carla Piazza, Sabina Rossi: Proofs Methods for Bisimulation Based Information Flow Security. 16-31
Gilles Barthe, Guillaume Dufay, Line Jakubiec, Simão Melo de Sousa: A Formal Correspondence between Offensive and Defensive JavaCard Virtual Machines. 32-45
R. K. Shyamasundar: Analyzing Cryptographic Protocols in a Reactive Framework. 46-64
Timed Systems and Games
Li Tan: An Abstract Schema for Equivalence-Checking Games. 65-78
Natalia Sidorova, Martin Steffen: Synchronous Closing of Timed SDL Systems for Model Checking. 79-93
Marco Faella, Salvatore La Torre, Aniello Murano: Automata-Theoretic Decision of Timed Games. 94-108
Static Analysis
Witold Charatonik, Supratik Mukhopadhyay, Andreas Podelski: Compositional Termination Analysis of Symbolic Forward Analysis. 109-125
Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon: Combining Norms to Prove Termination. 126-138
Andrzej S. Murawski, Kwangkeun Yi: Static Monotonicity Analysis for lambda-definable Functions over Lattices. 139-153
Optimizations
Remko Tronçon, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor: Storage Size Reduction by In-place Mapping of Arrays. 167-181
Alessandro Cimatti, Marco Pistore, Marco Roveri, Roberto Sebastiani: Improving the Encoding of LTL Model Checking into SAT. 196-207
Types and Verification
Lenore D. Zuck, Amir Pnueli, Yonit Kesten: Automatic Verification of Probabilistic Free Choice. 208-224
Roberta Gori, Giorgio Levi: An Experiment in Type Inference and Verification by Abstract Interpretation. 225-239
Salvatore La Torre, Aniello Murano, Margherita Napoli: Weak Muller Acceptance Conditions for Tree Automata. 240-254
Mario Coppo, Mariangiola Dezani-Ciancaglini: A Fully Abstract Model for Higher-Order Mobile Ambients. 255-271
Temporal Logics and Systems
Ferucio Laurentiu Tiplea, Aurora Tiplea: A Simulation Preorder for Abstraction of Reactive Systems. 272-288
Michael Huth: Model Checking Modal Transition Systems Using Kripke Structures. 302-316
Kai Baukus, Yassine Lakhnech, Karsten Stahl: Parameterized Verification of a Cache Coherence Protocol: Safety and Liveness. 317-330



