Ensuring completeness of symbolic verification methods for infinite-state systems
- 1 April 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 256 (1-2) , 145-167
- https://doi.org/10.1016/s0304-3975(00)00105-5
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Verifying programs with unreliable channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- General decidability theorems for infinite-state systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Model-checking for real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Undecidable Verification Problems for Programs with Unreliable ChannelsInformation and Computation, 1996
- Verifying Programs with Unreliable ChannelsInformation and Computation, 1996
- Local model checking for infinite state spacesTheoretical Computer Science, 1992
- A really temporal logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Distributed cooperation with action systemsACM Transactions on Programming Languages and Systems, 1988
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime FactorsAmerican Journal of Mathematics, 1913