1 option
Verification, Model Checking, and Abstract Interpretation : Third International Workshop, VMCAI 2002, Venice, Italy, January 21-22, 2002, Revised Papers / edited by Agostino Cortesi.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2294.
- Lecture Notes in Computer Science, 0302-9743 ; 2294
- Language:
- English
- Subjects (All):
- Computers.
- Software engineering.
- Computer science.
- Computer logic.
- Programming languages (Electronic computers).
- Theory of Computation.
- Software Engineering/Programming and Operating Systems.
- Computer Science, general.
- Logics and Meanings of Programs.
- Programming Languages, Compilers, Interpreters.
- Software Engineering.
- Local Subjects:
- Theory of Computation.
- Software Engineering/Programming and Operating Systems.
- Computer Science, general.
- Logics and Meanings of Programs.
- Programming Languages, Compilers, Interpreters.
- Software Engineering.
- Physical Description:
- 1 online resource (VIII, 331 pages).
- Edition:
- First edition 2002.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-47813-3
- 9783540478133
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.