Agostino Cortesi (ed.)

Verification, Model Checking, and Abstract Interpretation

Third International Workshop, VMCAI 2002, Venice, Italy, January 21-22, 2002, Revised Papers
Herausgegeben:Cortesi, Agostino

• Broschiertes Buch

Produktbeschreibung

This volume contains the revised version of papers presented at VMCAI 2002, theThirdInternationalWorkshoponVeri?cation,ModelChecking,andAbstract Interpretation, Venice (Italy), January 21-22, 2002. Themaingoaloftheworkshopwastogiveanoverviewofthemaindirections decisive for the growth and cross-fertilization of major research activities in programanalysis and veri?cation. TheVMCAIserieswasstartedin1997withtheaimofgatheringresearchers interestedininvestigatingsimilaritiesanddi?erencesamongthesethreeresearch methodologies, that may be summarized as follows: - programveri?cationaimsatprovingthatprogramsmeettheirspeci?cations, i.e., that the actual programbehavior correspondsto the desired one. - model checking is a speci?c approach to the veri?cation of temporal pr- erties of reactive and concurrentsystems, which has been very successful in the area of ?nite-state programs. - abstract interpretation is a method for designing and comparing semantics ofprogram,expressingvarioustypes ofprogramproperties;in particular,it has been successfully usedto infer run-time programproperties that canbe valuable in optimizing programs. Theprogramcommitteeselected22papersoutof41submissionsonthebasis of at least 3 reviews. The principal selection criteria were relevance, quality, and clarity. The resulting volume o?ers the reader an interesting perspective of the current research trends in the area. In particular, the papers contribute to the following topics: Security and Protocols, Timed Systems and Games, Static Analysis, Optimizations, Types and Veri?cation, and Temporal Logics and Systems. The quality of the papers, the interesting discussions at the workshop, and the friendly atmosphere enjoyed by all participants in Venice, encouraged us in the projectofmakingVMCAI anannualprivilegedforumfor researchersin the area. Specialthanksareduetotheinstitutionsthatsponsoredtheevent:theC- puter Science Department of the University Ca Foscari, the European Asso- ation for Programming Languages and Systems (EAPLS), the MIUR Project InterpretazioneAstratta,TypeSystemseAnalisiControl-Flow andtheMIUR Project MetodiFormaliperlaSicurezza-MEFISTO .Weareespeciallygra- ful to C. Braghin for her helpful support in organizingthe workshop.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 2294
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 10722206, 978-3-540-43631-7
• 2002
• Seitenzahl: 348
• Erscheinungstermin: 24. April 2002
• Englisch
• Abmessung: 235mm x 155mm x 19mm
• Gewicht: 490g
• ISBN-13: 9783540436317
• ISBN-10: 3540436316
• Artikelnr.: 23392807

Autorenporträt

Agostino Cortesi, Universita ca Foscari, Venezia, Italy

Inhaltsangabe

Security and Protocols.- Combining Abstract Interpretation and Model Checking for Analysing Security Properties of Java Bytecode.- Proofs Methods for Bisimulation Based Information Flow Security.- A Formal Correspondence between Offensive and Defensive JavaCard Virtual Machines.- Analyzing Cryptographic Protocols in a Reactive Framework.- Timed Systems and Games.- An Abstract Schema for Equivalence-Checking Games.- Synchronous Closing of Timed SDL Systems for Model Checking.- Automata-Theoretic Decision of Timed Games.- Static Analysis.- Compositional Termination Analysis of Symbolic Forward Analysis.- Combining Norms to Prove Termination.- Static Monotonicity Analysis for ?-definable Functions over Lattices.- A Refinement of the Escape Property.- Optimizations.- Storage Size Reduction by In-place Mapping of Arrays.- Verifying BDD Algorithms through Monadic Interpretation.- Improving the Encoding of LTL Model Checking into SAT.- Types and Verification.- Automatic Verification of Probabilistic Free Choice.- An Experiment in Type Inference and Verification by Abstract Interpretation.- Weak Muller Acceptance Conditions for Tree Automata.- A Fully Abstract Model for Higher-Order Mobile Ambients.- Temporal Logics and Systems.- A Simulation Preorder for Abstraction of Reactive Systems.- Approximating ATL* in ATL.- Model Checking Modal Transition Systems Using Kripke Structures.- Parameterized Verification of a Cache Coherence Protocol: Safety and Liveness.