An Assertional Language for the Verification of Systems Parametric in Several Dimensions
Open Access
- 1 August 2001
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 50 (4) , 371-385
- https://doi.org/10.1016/s1571-0661(04)00189-6
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- General decidability theorems for infinite-state systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Better is better than well: on efficient verification of infinite-state systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Well-structured transition systems everywhere!Theoretical Computer Science, 2001
- Automatic Verification of Parameterized Cache Coherence ProtocolsPublished by Springer Nature ,2000
- Model Checking in CLPPublished by Springer Nature ,1999
- Model Checking Lossy Vector Addition SystemsPublished by Springer Nature ,1999
- Verifying networks of timed processesPublished by Springer Nature ,1998
- Verifying parameterized networksACM Transactions on Programming Languages and Systems, 1997
- Reasoning about systems with many processesJournal of the ACM, 1992
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977