A semantic framework for the abstract model checking of tccp programs

Theoretical Computer Science

Volumn 346, Issue 1, 2005, Pages 58-95

  Alpuente, María ^a   Del Mar Gallardo, María ^b   Pimentel, Ernesto ^b   Villanueva, Alicia ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^b UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

Abstract interpretation; Model checking; Timed Concurrent Constraint programming

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONCURRENT ENGINEERING; CONSTRAINT THEORY; MATHEMATICAL MODELS;

ABSTRACT INTERPRETATION; MODEL CHECKING; TIMED CONCURRENT CONSTRAINT PROGRAMMING;

SEMANTICS;

EID: 27744456719     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.08.009     Document Type: Conference Paper

References (32)

1. T. Ball, A. Podelski, S.K. Rajamani, Relative completeness of abstraction refinement for software model checking, in: Proc. 2002 Internat. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2002), Lecture Notes in Computer Science, Vol. 2280, Springer, Berlin, 2002, pp. 158-172.
2. T. Ball, and S.K. Rajamani The slam project: debugging system software via static analysis Proc. ACM Internat. Symp. on POPL 2002 2002 ACM Press New York 1 3
3. F.S. de Boer, M. Gabbrielli, and M.C. Meo A timed concurrent constraint language Inform. and Comput. 161 2000 45 83
4. F.S. de Boer, M. Gabbrielli, and M.C. Meo A temporal logic for reasoning about timed concurrent constraint programs G. Smolka Proc. eigth Internat. Symp. on Temporal Representation and Reasoning 2001 IEEE Computer Society Press Silver Spring, MD 227 233
5. F.S. de Boer, M. Gabbrielli, M.C. Meo, Proving correctness of timed concurrent constraint programs, ACM Trans. Comput. Logic 5 (4) (2004) 706-731.
6. G. Bruns, P. Godefroid, Generalized model checking: reasoning about partial state spaces, in: C. Palamidessi (Ed.), 11th Internat. Conf. on Concurrency Theory CONCUR 2000, Lecture Notes in Computer Science, Vol. 1877, Springer, Berlin, 2001, pp. 168-182.
7. E.M. Clarke, E.A. Emerson, and A.P. Sistla Automatic verification of finite-state concurrent systems using temporal logic specifications ACM Trans. Programming Languages and Systems 8 1986 244 263
8. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, H. Veith, Counterexample-guided abstraction refinement, in: CAV, Lecture Notes in Computer Science, Vol. 1855, Springer, Berlin, 2000, pp. 154-169.
9. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith Counterexample-guided abstraction refinement for symbolic model checking J. Assoc. Comput. Mech. 50 2003 752 794
10. E.M. Clarke, O. Grumberg, and D.E. Long Model checking and abstraction ACM Trans. Programming Languages and Systems 16 1994 1512 1542
11. P. Cousot, and R. Cousot Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints Proc. fourth ACM Internat. Symp. on POPL 1977 ACM Press New York 238 252
12. P. Cousot, and R. Cousot Systematic design of program analysis frameworks Proc. sixth ACM Symp. on POPL 1979 ACM Press New York 269 282
13. D. Dams, R. Gerth, and O. Grumberg Abstract interpretation of reactive systems ACM Trans. Programming Languages and Systems 19 2 1997 253 291
14. M. Falaschi, A. Policriti, A. Villanueva, Modeling timed concurrent systems in a temporal concurrent constraint language - I, in: A. Dovier, M.C. Meo, A. Omicini (Eds.), Selected Papers from 2000 Joint Conference on Declarative Programming, Electronic Notes in Theoretical Computer Science, Vol. 48, Elsevier, Amsterdam, 2000.
15. M. Falaschi, A. Villanueva, Automatic verification of timed concurrent constraint programs, Theory and Practice of Logic Programming (2006), to appear.
16. M.M. Gallardo, J. Martínez, P. Merino, and E. Pimentel α SPIN: a tool for abstract model checking Software Tools for Technology Transfer 5 2003 165 184
17. M.M. Gallardo, P. Merino, E. Pimentel, Refinement of LTL formulas for abstract model checking, in: Proc. of Static Analysis Symp. (SAS 2002), Lecture Notes in Computer Science, Vol. 2477, Springer, Berlin, 2002, pp. 395-410.
18. M.M. Gallardo, P. Merino, and E. Pimentel A generalized semantics of promela for abstract model checking Formal Aspects of Comput. 16 2004 166 193
19. R. Giacobazzi, S.K. Debray, and G. Levi Generalized semantics and abstract interpretation for constraint logic programs J. Logic Programming 25 3 1995 191 247
20. R. Giacobazzi, E. Quintarelli, Incompleteness, counterexamples, and refinements in abstract model checking, in: Proc. of Static Analysis Symp. (SAS 2001), Lecture Notes in Computer Science, Vol. 2126, Springer, Berlin, 2001, pp. 356-376.
21. R. Giacobazzi, F. Ranzato, and F. Scozzari Making abstract interpretations complete J. Assoc. Comput. Mach. 47 2 2000 361 416
22. P. Godefroid, M. Huth, R. Jagadeesan, Abstraction-based model checking using modal transition systems, in: 12th Internat. Conf. on Concurrency Theory CONCUR 2001, Lecture Notes in Computer Science, Vol. 2154, Springer, Berlin, 2001, pp. 426-440.
23. J. Hatcliff, M. Dwyer, C. Pasareanu, Robby, Foundations of the Bandera abstraction tools, in: The Essence of Computation, Lecture Notes in Computer Science, Vol. 2566, 2002, pp. 172-203.
24. M. Huth, R. Jagadeesan, D.A. Schmidt, Modal transition systems: a foundation for three-valued program analysis, in: David Sands (Ed.), 10th European Symp. on Programming ESOP 2001, Lecture Notes in Computer Science, Vol. 2028, Springer, Berlin, 2001, pp. 155-169.
25. J. Jaffar, J.-L. Lassez, Constraint logic programming, in: Proc. 14th Annu. ACM Symp. on POPL, 1987, pp. 111-119.
26. K.G. Larsen, B. Thomsen, A modal process logic, in: third Annu. Symp. on Logic in Computer Science, LICS '88, IEEE Computer Society Press, 1988, pp. 203-210.
27. C. Loiseaux, S. Graf, J. Sifakis, A. Boujjani, and S. Bensalem Property preserving abstractions for the verification of concurrent systems Formal Methods in System Design 6 1995 1 35
28. M. Maher, Logic semantics for a class of committed-choice programs, in: Proc. fourth Internat. Conf. on Logic Programming, 1987, pp. 858-876.
29. V.A. Saraswat Concurrent Constraint Programming Languages 1993 The MIT Press Cambridge, MA
30. V.A. Saraswat, R. Jagadeesan, and V. Gupta Foundations of timed concurrent constraint programming Proc. ninth Annu. IEEE Symp. on Logic in Computer Science 1994 IEEE New York 71 80
31. V.A. Saraswat, M.C. Rinard, and P. Panangaden Semantic foundations of concurrent constraint programming Proc. 18th Annu. ACM Symp. on Principles of Programming Languages POPL'91 1991 ACM Press New York 333 352
32. E. Zaffanella, R. Giacobazzi, G. Levi, Abstracting synchronization in concurrent constraint programming, J. Funct. Logic Programming 1997 (6) 1997.