TACAS 2003
43 papers
- A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems
- A New Knowledge Representation Strategy for Cryptographic Protocol Analysis
- A Set of Performance and Dependability Analysis Components for CADP
- An Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic
- Automated Module Composition
- Automatic Abstraction without Counterexamples
- Automatic Test Generation with AGATHA
- BANANA - A Tool for Boundary Ambients Nesting ANAlysis
- Bounded Model Checking for Past LTL
- Branching Processes of High-Level Petri Nets
- Checking Properties of Heap-Manipulating Procedures with a Constraint Solver
- Code-Based Test Generation for Validation of Functional Processor Descriptions
- Compositional Analysis for Verification of Parameterized Systems
- Construction of Efficient BDDs for Bounded Arithmetic Constraints
- Counter-Example Guided Predicate Abstraction of Hybrid Systems
- Decidability of Invariant Validation for Paramaterized Systems
- Experimental Analysis of Different Techniques for Bounded Model Checking
- Generalized Symbolic Execution for Model Checking and Testing
- LTSA-MSC: Tool Support for Behaviour Model Elaboration Using Implied Scenarios
- Large State Space Visualization
- Learning Assumptions for Compositional Verification
- Modeling and Analysis of Power-Aware Systems
- Modular Strategies for Recursive Game Graphs
- Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation
- On Optimal Scheduling under Uncertainty
- On the Universal and Existential Fragments of the µ-Calculus
- Optimistic Synchronization-Based State-Space Reduction
- Pattern-Based Abstraction for Verifying Secrecy in Protocols
- Proof-Like Counter-Examples
- Rapid Parameterized Model Checking of Snoopy Cache Coherence Protocols
- Resets vs. Aborts in Linear Temporal Logic
- Saturation Unbound
- Schedulability Analysis Using Two Clocks
- Simple Representative Instantiations for Multicast Protocols
- State Class Constructions for Branching Analysis of Time Petri Nets
- Static Guard Analysis in Timed Automata Verification
- Strategies for Combining Decision Procedures
- The Integrated CWB-NC/PIOATool for Functional Verification and Performance Analysis of Concurrent Systems
- Using Petri Net Invariants in State Space Construction
- Verics: A Tool for Verifying Timed Automata and Estelle Specifications
- Verification and Improvement of the Sliding Window Protocol
- Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement
- What Are We Trying to Prove? Reflections on Experiences with Proof-Carrying Code