Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 146-159
- https://doi.org/10.1007/3-540-48683-6_15
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)Electronic Notes in Theoretical Computer Science, 1997
- Verifying Programs with Unreliable ChannelsInformation and Computation, 1996
- Unreliable Channels Are Easier to Verify Than Perfect ChannelsInformation and Computation, 1996
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- Formal verification for fault-tolerant architectures: prolegomena to the design of PVSIEEE Transactions on Software Engineering, 1995
- The Complexity of Simple Computer ArchitecturesPublished by Springer Nature ,1995
- Model checking and abstractionACM Transactions on Programming Languages and Systems, 1994
- Automatic discovery of linear restraints among variables of a programPublished by Association for Computing Machinery (ACM) ,1978
- Static determination of dynamic properties of generalized type unionsPublished by Association for Computing Machinery (ACM) ,1977
- Parallel program schemata: A mathematical model for parallel computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1967