CAV 1990
38 papers
- A Context Dependent Equivalence Relation Between Kripke Structures
- A Data Path Verifier for Register Transfer Level Using Temporal Logic Language Tokio
- A Proof Lattice-Based Technique for Analyzing Liveness of Resource Controllers
- A Stubborn Attack On State Explosion
- A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines
- An Algebra for Delay-Insensitive Circuits
- Auto/Autograph
- Automated RTL Verification Based on Predicate Calculus
- Automatic Verification of Extensions of Hardware Descriptions
- Branching Time Regular Temporal Logic for Model Checking with Linear Time Complexity
- Compositional Design and Verification of Communication Protocols, Using Labelled Petri Nets
- Compositional Minimization of Finite State Systems
- Computer Assistance for Program Refinement
- Extension of the Karp and Miller Procedure to Lotos Specifications
- Finiteness Conditions and Structural Construction of Automata for All Process Algebras
- Formal Verification of Digital Circuits Using Symbolic Ternary System Models
- Introduction to a Computational Theory and Implementation of Sequential Hardware Equivalence
- Issues Arising in the Analysis of L.0
- Memory Efficient Algorithms for the Verification of Temporal Properties
- Minimal Model Generation
- On Automatically Explaining Bisimulation Inequivalence
- On Using Protean To Verify ISO FTAM Protocol
- PAPETRI: Environment for the Analysis of Petri Nets
- Program Verification by Symbolic Execution of Hyperfinite Ideal Machines
- Quantitative Temporal Reasoning
- Synthesizing Processes and Schedulers from Temporal Specifications
- Task-Driven Supervisory Control of Discrete Event Systems
- Temporal Logic Model Checking: Two Techniques for Avoiding the State Explosion Problem
- The Algebraic Feedback Product of Automata
- The Modular Framework of Computer-Aided Verification
- The Use of Model Checking in ATPG for Sequential Circuits
- Using Optimal Simulations to Reduce Reachability Graphs
- Using Partial Orders to Improve Automatic Verification Methods
- Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems
- Vectorized Model Checking for Computation Tree Logic
- Verification of a Multiprocessor Cache Protocol Using Simulation Relations and Higher-Order Logic
- Verifying Liveness Properties by Verifying Safety Properties
- Verifying Temporal Properties of Sequential Machines Without Building their State Diagrams