Abstract is missing.
- Combining Abstract Interpretation and Model Checking for Analysing Security Properties of Java BytecodeCinzia Bernardeschi, Nicoletta De Francesco. 1-15 [doi]
- Proofs Methods for Bisimulation Based Information Flow SecurityRiccardo Focardi, Carla Piazza, Sabina Rossi. 16-31 [doi]
- A Formal Correspondence between Offensive and Defensive JavaCard Virtual MachinesGilles Barthe, Guillaume Dufay, Line Jakubiec, Simão Melo de Sousa. 32-45 [doi]
- Analyzing Cryptographic Protocols in a Reactive FrameworkR. K. Shyamasundar. 46-64 [doi]
- An Abstract Schema for Equivalence-Checking GamesLi Tan. 65-78 [doi]
- Synchronous Closing of Timed SDL Systems for Model CheckingNatalia Sidorova, Martin Steffen. 79-93 [doi]
- Automata-Theoretic Decision of Timed GamesMarco Faella, Salvatore La Torre, Aniello Murano. 94-108 [doi]
- Compositional Termination Analysis of Symbolic Forward AnalysisWitold Charatonik, Supratik Mukhopadhyay, Andreas Podelski. 109-125 [doi]
- Combining Norms to Prove TerminationSamir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon. 126-138 [doi]
- Static Monotonicity Analysis for lambda-definable Functions over LatticesAndrzej S. Murawski, Kwangkeun Yi. 139-153 [doi]
- A Refinement of the Escape PropertyPatricia M. Hill, Fausto Spoto. 154-166 [doi]
- Storage Size Reduction by In-place Mapping of ArraysRemko Tronçon, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor. 167-181 [doi]
- Verifying BDD Algorithms through Monadic InterpretationSava Krstic, John Matthews. 182-195 [doi]
- Improving the Encoding of LTL Model Checking into SATAlessandro Cimatti, Marco Pistore, Marco Roveri, Roberto Sebastiani. 196-207 [doi]
- Automatic Verification of Probabilistic Free ChoiceLenore D. Zuck, Amir Pnueli, Yonit Kesten. 208-224 [doi]
- An Experiment in Type Inference and Verification by Abstract InterpretationRoberta Gori, Giorgio Levi. 225-239 [doi]
- Weak Muller Acceptance Conditions for Tree AutomataSalvatore La Torre, Aniello Murano, Margherita Napoli. 240-254 [doi]
- A Fully Abstract Model for Higher-Order Mobile AmbientsMario Coppo, Mariangiola Dezani-Ciancaglini. 255-271 [doi]
- A Simulation Preorder for Abstraction of Reactive SystemsFerucio Laurentiu Tiplea, Aurora Tiplea. 272-288 [doi]
- Approximating ATL:::*::: in ATLAidan Harding, Mark Ryan, Pierre Yves Schobbens. 289-301 [doi]
- Model Checking Modal Transition Systems Using Kripke StructuresMichael Huth. 302-316 [doi]
- Parameterized Verification of a Cache Coherence Protocol: Safety and LivenessKai Baukus, Yassine Lakhnech, Karsten Stahl. 317-330 [doi]