Polymorphic systems with arrays, 2-counter machines and multiset rewriting

Electronic Notes in Theoretical Computer Science

Volumn 138, Issue 3, 2005, Pages 61-86

  Lazić, Ranko ^a,c   Newcomb, Tom ^b   Roscoe, Bill ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c MATHEMATICAL INSTITUTE   (Serbia)

Author keywords

Array; Infinite state; Model checking; Parameterised

Indexed keywords

INFINITE-STATE; MODEL CHECKING; PARAMETERIZED; POLYMORPHIC SYSTEMS;

ARRAYS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; FUNCTIONS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING;

COMPUTER SYSTEMS;

EID: 29144435150     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.02.064     Document Type: Conference Paper

References (22)

1. M. Bozzano, and G. Delzanno Beyond Parameterized Verification Proceedings of TACAS '02 Lecture Notes in Computer Science 2280 2002 221 235
2. M. Bozzano and G. Delzanno, Automatic Verification of Invalidation-based Protocols, Proceedings of CAV '02, July 2002
3. E.M. Clarke, O. Grumberg, and D.A. Peled Model Checking January 2000 MIT Press
4. G. Delzanno Automatic verification of parameterized cache coherence protocols Proceedings of the 12th International Conference on Computer-Aided Verification (CAV 2000) Lecture Notes in Computer Science 1855 July 2000 Springer 53 68
5. G. Delzanno An Assertional Language for Systems Parametric in Several Dimensions Proceedings of the Workshop on Verification of Parameterized Systems (VEPAS 2001) Electronic Notes in Theoretical Computer Science 50 2001 Elsevier
6. G. Delzanno, On the Automated Verification of Parameterized Concurrent Systems with Unbounded Local Data, Technical Report, Dipartimento Informatica e Scienze dell'Informazione, Università di Genova, 2002. Revised and extended version of [5], [1], [2]
7. E.A. Emerson and K.S. Namjoshi, On model checking for non-deterministic infinite-state systems, Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS), 1998
8. J. Esparza Decidability and complexity of Petri net problems - an introduction Lectures on Petri Nets I: Basic Models, Advances in Petri Nets Lecture Notes in Computer Science 1491 1998 Springer 374 428
9. J. Esparza, A. Finkel and R. Mayr, On the verification of broadcast protocols, Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS), 352-359, July 1999
10. H. Garcia-Molina Elections in a distributed computing system IEEE Transactions on Computers 31 1 1982 48 59
11. S.M. German, and A.P. Sistla Reasoning about Systems with Many Processes Journal of the ACM 39 3 1992 675 735
12. R.S. Lazić, T.C. Newcomb and A.W. Roscoe, On model checking data-independent systems with arrays without reset, Programming Research Group Research Report RR-02-02, 31 pages, Oxford University Computing Laboratory, January 2002. Revised version to appear in the journal Theory and Practice of Logic Programming (TPLP), Cambridge University Press
13. R Lazić and A.W. Roscoe, Verifying determinism of concurrent systems which use unbounded arrays, Proceedings of the 3rd International Workshop on Verification of Infinite-State Systems (INFINITY '98), Report TUM-I9825, 2-8, Technical University of Munich, July 1998
14. I.A. Lomazova Nested Petri Nets: Multi-level and Recursive Systems Fundamenta Informaticae 47 2001 283 294 IOS Press
15. M. Maidl A Unifying Model Checking Approach for Safety Properties of Parameterized Systems Proceedings of the 13th International Conference on Computer Aided Verification (CAV 2001) Lecture Notes in Computer Science 2102 July 2001 Springer 311 323
16. N.M. Minsky Finite and Infinite Machines 1967 Prentice-Hall
17. J.C. Mitchell, Type Systems for Programming Languages, in [22], 365-458
18. T.C. Newcomb, Model Checking Data-Independent Systems with Arrays, D. Phil. thesis, Computing Laboratory, Oxford University, 2003
19. S. Qadeer Verifying sequential consistency on shared-memory multiprocessors by model checking IEEE Transactions on Parallel and Distributed Systems 14 8 August 2003
20. J.-F. Raskin and L. Van Begin, Petri Nets with Non-blocking Arcs are Difficult to Analyse, Proceedings of the International Workshop on Verification of Infinite-State Systems (INFINITY 2003), Electronic Notes in Theoretical Computer Science
21. A.W. Roscoe and R.S. Lazić, What can you decide about resetable arrays?, Proceedings of the 2nd International Workshop on Verification and Computational Logic (VCL'2001), Technical Report DSSE-TR-2001-3, 5-23, Declarative Systems and Software Engineering Research Group, Department of Electronics and Computer Science, University of Southampton, September 2001
22. J. van Leeuwen Formal Models and Semantics Handbook of Theoretical Computer Science volume B 1990 Elsevier