Automatic verification of parameterized networks of processes
- 1 April 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 256 (1-2) , 113-144
- https://doi.org/10.1016/s0304-3975(00)00104-3
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Comparing the Galois connection and widening/narrowing approaches to abstract interpretationPublished by Springer Nature ,2005
- Reachability sets of parameterized rings as regular languagesElectronic Notes in Theoretical Computer Science, 1997
- Automatic verification of parameterized synchronous systemsPublished by Springer Nature ,1996
- Verifying parameterized networks using abstraction and regular languagesPublished by Springer Nature ,1995
- Reasoning about ringsPublished by Association for Computing Machinery (ACM) ,1995
- The Esterel synchronous programming language: design, semantics, implementationScience of Computer Programming, 1992
- The synchronous data flow programming language LUSTREProceedings of the IEEE, 1991
- Limits for automatic verification of finite-state concurrent systemsInformation Processing Letters, 1986
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977