CAV 1994
38 papers
- A Determinizable Class of Timed Automata
- A Hybrid Model for Reasoning about Composed Hardware Systems
- A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation
- An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)
- An Improved Algorithm for the Evaluation of Fixpoint Expressions
- Another Look at LTL Model Checking
- Automatic Verification of Timed Circuits
- Automatic verification of Pipelined Microprocessor Control
- Beyond Model Checking
- Combining Partial Order Reductions with On-the-fly Model-Checking
- Composing Symbolic Trajectory Evaluation Results
- Compositional Semantics of ESTEREL and Verification by Compositional Reductions
- Criteria for the Simple Path Property in Timed Automata
- Decidability of Hybrid Systems with Rectangular Differential Inclusion
- Efficient Model Checking by Automated Ordering of Transition Relation Partitions
- Formula-Dependent Equivalence for Compositional CTL Model Checking
- Ground Temporal Logic: A Logic for Hardware Verification
- Hierarchical Representations of Discrete Functions, with Application to Model Checking
- Improving Language Containment Using Fairness Graphs
- Incremental Model Checking in the Modal Mu-Calculus
- Methodology and System for Practical Formal Verification of Reactive Hardware
- Model Checking Using Adaptive State and Data Abstraction
- Model Checking of macro Processes
- Modeling and Verification of a Real Life Protocol Using Symbolic Model Checking
- Models Whose Checks Don't Explode
- On the Automatic Computation of Network Invariants
- On the Random Walk Method for Protocol Testing
- Performance Improvement of State Space Exploration by Regular & Diffrential Hashing Functions
- Real-Time System Verification using P/T Nets
- Realizability and Synthesis of Reactive Modules
- Suspension Automata: A Decidable Class of Hybrid Automata
- Symbolic Verification with Periodic Sets
- The Completeness of a Hardware Inference System
- The Mobility Workbench - A Tool for the pi-Calculus
- The Verifiacation Problem for Safe Replaceability
- Using Abstractions for the Verification of Linear Hybrid Systems
- Verification of Context-Free Timed Systems Using Linear Hybrid Observers
- Verification of a Distributed Cache Memory by Using Abstractions