1 option
Computer Aided Verification : 11th International Conference, CAV'99, Trento, Italy, July 6-10, 1999, Proceedings / edited by Nicolas Halbwachs, Doron Peled.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1633.
- Lecture Notes in Computer Science, 0302-9743 ; 1633
- Language:
- English
- Subjects (All):
- Software engineering.
- Computers.
- Computer logic.
- Logic, Symbolic and mathematical.
- Logic design.
- Software Engineering/Programming and Operating Systems.
- Theory of Computation.
- Logics and Meanings of Programs.
- Software Engineering.
- Mathematical Logic and Formal Languages.
- Logic Design.
- Local Subjects:
- Software Engineering/Programming and Operating Systems.
- Theory of Computation.
- Logics and Meanings of Programs.
- Software Engineering.
- Mathematical Logic and Formal Languages.
- Logic Design.
- Physical Description:
- 1 online resource (XIV, 506 pages).
- Edition:
- First edition 1999.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
- System Details:
- text file PDF
- Summary:
- This book constitutes the refereed proceedings of the 11th International Conference on Computer Aided Verification, CAV'99, held in Trento, Italy in July 1999 as part of FLoC'99. The 34 revised full papers presented were carefully reviewed and selected from a total of 107 submissions. Also included are six invited contributions and five tool presentations. The book is organized in topical sections on processor verification, protocol verification and testing, infinite state spaces, theory of verification, linear temporal logic, modeling of systems, symbolic model checking, theorem proving, automata-theoretic methods, and abstraction.
- Contents:
- Tutorials and Invited Papers
- Alternative Approaches to Hardware Verification
- The Compositional Specification of Timed Systems - A Tutorial
- Timed Automata
- Ståalmarck's Method with Extensions to Quantified Boolean Formulas
- Verification of Parameterized Systems by Dynamic Induction
- Formal Methods for Conformance Testing: Theory Can Be Practical
- Processor Verification
- Proof of Correctness of a Processor with Reorder Buffer Using the Completion Functions Approach
- Verifying Safety Properties of a PowerPC? Microprocessor Using Symbolic Model Checking without BDDs
- Model Checking the IBM Gigahertz Processor: An Abstraction Algorithm for High-Performance Netlists
- Validation of Pipelined Processor Designs Using Esterel Tools: A Case Study
- Protocol Verification and Testing
- Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol
- Test Generation Derived from Model-Checking
- Latency Insensitive Protocols
- Infinite State Space
- Handling Global Conditions in Parametrized System Verification
- Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis
- Experience with Predicate Abstraction
- Theory of Verification
- Model Checking of Safety Properties
- A Complete Finite Prefix for Process Algebra
- The Mathematical Foundation of Symbolic Trajectory Evaluation
- Assume-Guarantee Refinement between Different Time Scales
- Linear Temporal Logic
- Efficient Decision Procedures for Model Checking of Linear Time Logic Properties
- Stutter-Invariant Languages, ?-Automata, and Temporal Logic
- Improved Automata Generation for Linear Temporal Logic
- Modeling of Systems
- On the Representation of Probabilities over Structured Domains
- Model Checking Partial State Spaces with 3-Valued Temporal Logics
- Elementary Microarchitecture Algebra
- Verifying Sequential Consistency on Shared-Memory Multiprocessor Systems
- Symbolic Model-Checking
- Stepwise CTL Model Checking of State/Event Systems
- Optimizing Symbolic Model Checking for Constraint-Rich Models
- Efficient Timed Reachability Analysis Using Clock Difference Diagrams
- Theorem Proving
- Mechanizing Proofs of Computation Equivalence
- Linking Theorem Proving and Model-Checking with Well-Founded Bisimulation
- Automatic Verification of Combinational and Pipelined FFT Circuits
- Automata-Theoretic Methods
- Efficient Analysis of Cyclic Definitions
- A Theory of Restrictions for Logics and Automata
- Model Checking Based on Sequential ATPG
- Automatic Verification of Abstract State Machines
- Abstraction
- Abstract and Model Check while You Prove
- Deciding Equality Formulas by Small Domains Instantiations
- Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions
- Tool Presentations
- A Toolbox for the Analysis of Discrete Event Dynamic Systems
- TIPPtool: Compositional Specification and Analysis of Markovian Performance Models
- Java Bytecode Verification by Model Checking
- NuSMV: A New Symbolic Model Verifier
- PIL/SETHEO: A Tool for the Automatic Analysis of Authentication Protocols.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-48683-1
- 9783540486831
- 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.