Parametrized verification of linear networks using automata as invariants

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1254, Issue , 1997, Pages 412-423

  Sistla, A Prasad ^a  

^a 1120 Science and Engineering Offices   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84947430267     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63166-6_40     Document Type: Conference Paper

References (14)

1. K. R. Apt and D. Kozen: Limits to Automatic Program Verification. Information Processing Letters, 22.6 (1986), 307-309.
2. M. Browne, E. M. Clarke and O. Grumberg: Reasoning About Networks with Many Identical Finite State Processes. Inf. and Computation, 81(1):13-31, Apr. 1989.
3. E. M. Clarke, O. Grumberg and S. Jha: Verifying Parametrized Networks Using Abstraction and Regular Languages. CONCUR 95.
4. E. M. Clarke, and O. Grumberg: Avoiding the State Explosion Problem in Temporal Logic Modelchecking Problem. In Proceedings of ACM Symposium on Principles of Distributed Computing 1987.
5. E. A. Emerson and K. S. Namjoshi: Reasoning About Rings, Proceedings of 22nd POPL conferece, Jan 1995.
6. E. A. Emerson and K. S. Namjoshi: Automatic Verification of Parametrized Synchronous Systems. Proceeding of the International Conference on Computer Aide Verification 1996.
7. S. M. German and A. P. Sistla: Reasoning About Systems with many Processes. JACM, July 1992, Vol 39, No. 3, pp 675-735.
8. P. Godefroid and P. Wolper: Using Partial Approach to Modelcheckiug. Proc 6th IEEE Symposium on Logic in Computer Science, pp 406-415, Amsterdam, July 1991.
9. R. P. Kurshan and K. McMillan: A Structural Induction Theorem for Processes. ACM Sym. on Principles of Distributed Computing, Aug. 1989.
10. Z. Shtadler and O. Grumberg: Network Grammars, Communication Behaviors and Automatic Verififcation. Proc. of International Workshop on Automatic Verification Methods for Finite State Systems, June 1989.
11. A. P. Sistla: Parametrized Verification of Linear Networks Using Automata as Invariants. Technical report, University of Illinois at Chicago 1997.
12. A. P. Sistla, M. Vardi and P. Wolper: The Complementation Problem for Buchi Automata and Applications to Temporal Logics. Proceedings Of The 12th International Colloquium On Automata, Languages And Programming, Greece, August 1985; The journal version of the paper appeared in Theoretical Computer Science, 49, No 2,3 1987, pp 217-237.
13. A. P. Sistla and S. M. German: Reasoning About many Processes. LICS 87.
14. P. Wolper and V. Lovinfosse: Verifying Properties of Large Sets of Processes with Network Invariants. Proc. 1989 Intl Wokshop on Automatic Verification Methods for Finite State Systems 1989.