Empirically Efficient Verification for a Class of Infinite-State Systems
Authors:
Open Access
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 77-92
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Design and synthesis of synchronization skeletons using branching time temporal logic2005
- Empirically Efficient Verification for a Class of Infinite-State SystemsLecture Notes in Computer Science, 2005
- A Simple Method for Parameterized Verification of Cache Coherence Protocols2004
- Verifying programs with unreliable channels2002
- General decidability theorems for infinite-state systems2002
- TReX: A Tool for Reachability Analysis of Complex Systems2001
- Symbolic Representation of Upward-Closed Sets2000
- Automatic Verification of Parameterized Cache Coherence Protocols2000
- Symbolic model checking: 1020 States and beyondInformation and Computation, 1992
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986