An assertional language for the verification of systems parametric in several simensions: (Preliminary results)

Electronic Notes in Theoretical Computer Science

Volumn 50, Issue 4, 2001, Pages 371-385

  Delzanno, G ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; COMPUTER SIMULATION; COMPUTER SOFTWARE SELECTION AND EVALUATION; COMPUTER SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PETRI NETS; PROBLEM SOLVING;

ASSERTIONAL LANGUAGES; MUTUAL EXCLUSION; PARAMETRIC DIMENSIONS; STRUCTURED DATA;

COMPUTER PROGRAMMING LANGUAGES;

EID: 19144371220     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00189-6     Document Type: Conference Paper

References (23)

1. Abdulla, P. A., K. Cerāns, B. Jonsson, and Y.-K. Tsay, General Decidability Theorems for Infinite-State Systems, in: Proc. LICS'96 (1996), pp. 313-321.
2. Abdulla, P. A. and B. Jonsson, Verifying networks of timed processes, in: Proc. TACAS '98, LNCS 1384 (1998), pp. 298-312.
3. Abdulla, P. A. and A. Nylén, Better is Better than Well: On Efficient Verification of Infinite-State Systems, in: Proc. LICS 2000 (2000), pp. 132-140.
4. Bouajjani A. and R. Mayr, Model checking lossy vector addition systems, in: Proc. STACS '99, LNCS 1563 (1999), pp. 323-333.
5. Bozzano M., G. Delzanno and M. Martelli, An effective fixpoint semantics for first-order linear logic programs, in: Proc. FLOPS 01', LNCS 2024 (2001), pp. 138-152.
6. Clarke E., Grumberg O., Jha S. Verifying Parameterized Networks. TOPLAS. 19:1997;726-750
7. Cousot P. and R. Cousot, Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fix-Points, in: Proc. POPL'77 (1977), pp. 238-252.
8. Delzanno G., Automatic Verification of Parameterized Cache Coherence Protocols, in: Proc. CAV 2000, LNCS 1855 (2000), pp. 53-68.
9. Delzanno G. and A. Podelski, Model Checking in CLP, in: Proc. TACAS '99, LNCS 1579 (1999), pp. 223-239.
10. Emerson, E. A. and K. S. Namjoshi, On the verification of broadcast protocols, in: Proc. LICS '98 (1998), pp. 70-80.
11. Esparza J., A. Finkel and R. Mayr, On Model Checking for Non-deterministic Infinite-state Systems, in: Proc. LICS '99 (1999), pp. 352-359.
12. Finkel A., Schnoebelen P. Well-structured transition systems everywhere! Theoretical Computer Science. 256:2001;63-92
13. Fribourg L., Constraint Logic Programming Applied to Model Checking, in: Proc. LOPSTR '99, LNCS 1817 (1999), pp. 30-41.
14. German S.M., Sistla A.P. Reasoning about Systems with Many Processes. JACM. 39:1992;675-735
15. Jaffar J., Maher M.J. Constraint Logic Programming: A Survey. Journal of Logic Programming. 19-20:1994;503-582
16. Jensen K. An Introduction to the Theoretical Aspects of Coloured Petri Nets. A Decade of Concurrency, LNCS. 803:1994;230-272
17. Karp R.M., Miller R.E. Parallel program schemata. Journal of Computer and System Sciences. 3:1969;147-195
18. Kesten Y., O. Maler, M. Marcus, A. Pnueli and E. Shahar, Symbolic model checking with rich assertional languages, in: Proc. CAV '97, LNCS 1254 (1997), pp. 424-435.
19. Meseguer J. Conditioned Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science. 96:1992;73-155
20. Narendran P., Rusinowitch M. Any ground associative-commutative theory has a finite canonical system. Journal of Automated Reasoning. 17:1996;131-143
21. Ölveczky, P. C. and J. Meseguer, Real-Time Maude: A Tool for Simulating and Analyzing Real-Time and Hybrid Systems, in: Proc. Workshop on Rewriting Logic and its Applications '00, ENTCS 36 (2000).
22. Rusinowitch M., Vigneron L. Automated Deduction with Associative and Commutative Operators. Applicable Algebra in Engineering, Communication and Computing. 6:1995;23-56
23. Saraswat V., Van Henteryck P. "Principles and Practice of Constraint Programming," 1995;MIT Press