Automatic verification of timed concurrent constraint programs

Theory and Practice of Logic Programming

Volumn 6, Issue 3, 2006, Pages 265-300

  Falaschi, Moreno ^a   Villanueva, Alicia ^b  

^a UNIVERSITY OF UDINE   (Italy)

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

Author keywords

Automatic verification; Model checking; Reactive systems; Timed concurrent constraint programming

Indexed keywords

CONCURRENT ENGINEERING; CONSTRAINT THEORY; CONTROL SYSTEMS; MATHEMATICAL MODELS;

AUTOMATIC VERIFICATION; MODEL CHECKING; REACTIVE SYSTEMS; TIMED CONCURRENT CONSTRAINT PROGRAMMING;

LOGIC PROGRAMMING;

EID: 33646697995     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068406002675     Document Type: Conference Paper

References (37)

1. ABDULLA, P., ANNICHINI, A., BENSALEM, S., BOUAJJANI, A., HABERMEHL, P. AND LAKHNECH, Y. 1999. Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis. Proceedings of the 11th International Conference on Computer Aided Verification, N. Halbwachs and D. Peled, Eds. Lecture Notes in Computer Science, vol. 1633. Springer-Verlag, Berlin, pp. 146-159.
2. ALUR, R., COURCOUBETIS, C., HALBWACHS, N., HENZINGER, T. A., HO, P.-H., NICOLLIN, X., OLIVERO, A., SIFAKIS, J. AND YOVINE, S. 1995. The algorithmic analysis of hybrid systems. Theoretical Computer Science 138, 1, 3-34.
3. ALUR, R., HENZINGER, T. AND WONG-TOI, H. 1997. Symbolic analysis of hybrid systems. Proceedings of the 37th IEEE Conference on Decision and Control, pp. 702-707.
4. DE BOER, F. S., GABBRIELLI, M., AND MEO, M. C. 2000. A Timed Concurrent Constraint Language. Information and Computation 161, 45-83.
5. DE BOER, F. S., GABBRIELLI, M. AND MEO, M. C. 2001. A Temporal Logic for reasoning about Timed Concurrent Constraint Programs. Proceedings of 8th International Symposium on Temporal Representation and Reasoning, G. Smolka, Ed. IEEE Computer Society Press, pp. 227-233.
6. DE BOER, F. S., GABBRIELLI, M. AND MEO, M. C. 2002. Proving Correctness of Timed Concurrent Constraint Programs. ACM Transactions on Computational Logic (TOCL). To appear.
7. BOIGELOT, B. AND GODEFROID, P. 1996. Symbolic Verification of Communication Protocols with infinite State Spaces using QDDs. Proceedings of the 8th International Conference on Computer Aided Verification, R. Alur and T. A. Henzinger, Eds. Vol. 1102. Springer Verlag, Berlin, pp. 1-12.
8. BOUAJJANI, A., ESPARZA, J. AND MALER, O. 1997. Reachability Analysis of Pushdown Automata: Application to Model-Checking. In International Conference on Concurrency Theory, A. Mazurkiewicz and J. Winkowski, Eds. Lecture Notes in Computer Science, vol. 1243. Springer-Verlag, Berlin, pp. 135-150.
9. BOUAJJANI, A., JONSSON, B., NILSSON, M. AND TOUILI, T. 2000. Regular Model Checking. In Proceedings of the 12th International Conference on Computer Aided Verification, E. A. Emerson and A. P. Sistla, Eds. Lecture Notes in Computer Science, vol. 1855. Springer-Verlag, 403-418.
10. CLARKE, E. M. AND EMERSON, E. A. 1981. Design and synthesis of synchronization skeletons using branching time temporal logic. Proceedings of Workshop on Logic of programs. Lecture Notes in Computer Science, vol. 131. Springer-Verlag, Berlin, pp. 52-71.
11. CLARKE, E. M., GRUMBERG, O. AND LONG, D. E. 1994. Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems 16, 1512-1542.
12. CLARKE, E. M., GRUMBERG, O., AND PELED, D. 1999. Model Checking. The MIT Press, Cambridge, MA.
13. COUSOT, P. AND HALBWACHS, N. 1978. Automatic discovery of linear restraints among variables of a program. In Conference Record of the 5th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, pp. 84-97.
14. DAMS, D. R. 1996. Abstract Interpretation and Partition Refinement for Model Checking. Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. PhD thesis.
15. DELZANNO, G. AND PODELSKI, A. 1999. Model Checking in CLP. Proceedings 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, R. Cleaveland, Ed. Lecture Notes in Computer Science, vol. 1579. Springer-Verlag, Berlin, pp. 223-239.
16. DELZANNO, G. AND PODELSKI, A. 2001. Constraint-based deductive model checking. International Journal on Software Tools for Technology Transfer 3, 3, 250-270.
17. ESPARZA, J. AND MELZER, S. 1997. Model Checking LTL Using Constraint Programming. Proceedings of the International Conference on Application and Theory of Petri Nets, P. Azéma and G. Balbo, Eds. Lecture Notes in Computer Science, vol. 1248. Springer-Verlag, Berlin, pp. 1-20.
18. FALASCHI, M., POLICRITI, A. AND VILLANUEVA, A. 2000a. Modeling Timed Concurrent systems in a Temporal Concurrent Constraint language. Proceedings of the 2000 Joint Conference on Declarative Programming. University of La Habana, La Habana, Cuba.
19. FALASCHI, M., POLICRITI, A. AND VILLANUEVA, A. 2000b. Modeling Timed Concurrent systems in a Temporal Concurrent Constraint language - I. Selected papers from 2000 Joint Conference on Declarative Programming, A. Dovier, M. C. Meo, and A. Omicini, Eds. Electronic Notes in Theoretical Computer Science, vol. 48. Elsevier Science.
20. FALASCHI, M., POLICRITI, A. AND VILLANUEVA, A. 2001. Time Limited Model Checking. Proceedings of International Workshop on Specification Analysis and Validation for Emerging Technologies in Computational Logic (SAVE'01), G. Delzanno, S. Etalle, and M. Gabbrielli, Eds.
21. FISCHER, M. J. AND LADNER, R. E. 1979. Prepositional Dynamic Logic of Regular Programs. Journal of Computer and System Sciences 18, 2, 194-211.
22. GUPTA, V., JAGADEESAN, R., AND SARASWAT, V. A. 1998. Computing with continuous change. Science of Computer Programming 30, 1-2, 3-49.
23. HUGHES, G. E. AND CRESWELL, M. J. 1968. Introduction to Modal Logic. Methuen and Co.
24. KESTEN, Y., MALER, O., MARCUS, M., PNUELI, A. AND SHAHAR, E. 1997. Symbolic model checking with rich assertional languages. In Proceedings of the 9th International Conference on Computer Aided Verification. O. Grumberg, Ed. Lecture Notes in Computer Science, vol. 1254. Springer-Verlag, pp. 424-435.
25. LOISEAUX, C., GRAF, S., SIFAKIS, J., BOUAJJANI, A., AND BENSALEM, S. 1995. Property Preserving Abstractions for the Verification of Concurrent Systems. Formal Methods in System Design 6, 1, 11-44.
26. MANNA, Z. AND PNUELI, A. 1995. Temporal Verification of Reactive Systems. Safety. Springer-Verlag.
27. MCMILLAN, K. L. 1993. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic.
28. NIELSEN, M., PALAMIDESSI, C. AND VALENCIA, F. 2002. Temporal Concurrent Constraint Programming: Denotation, Logic and Applications. Nordic Journal of Computing 1, 145-188.
29. PNUELI, A. AND SHAHAR, E. 2000. Liveness and Acceleration in Parametrized Verification. Proceedings of the 12th International Conference on Computer Aided Verification, E. A. Emerson and A. P. Sistla, Eds. Lecture Notes in Computer Science, vol. 1855. Springer-Verlag, pp. 328-343.
30. QUIELLE, J. P. AND SIFAKIS, J. 1982. Specification and verification of concurrent systems in CESAR. Proceedings of the 5th International Symposium on Programming. Lecture Notes in Computer Science, vol. 137. Springer-Verlag, Berlin, pp. 337-350.
31. SARASWAT, V. A. 1989. Concurrent Constraint Programming Languages. PhD Thesis, Carnegie-Mellon University.
32. SARASWAT, V. A., JAGADEESAN, R., AND GUPTA, V. 1994. Foundations of Timed Concurrent Constraint Programming. Proceedings of 9th Annual IEEE Symposium on Logic in Computer Science. IEEE. New York, pp. 71-80.
33. SARASWAT, V. A. AND RINARD, M. 1990. Concurrent Constraint Programming. Proceedings of 17th Annual ACM Symposium on Principles of Programming Languages. ACM Press, pp. 232-245.
34. SARASWAT, V. A., RINARD, M. AND PANANGADEN, P. 1991. Semantic Foundations of Concurrent Constraint Programming. Proceedings of 18th Annual ACM Symposium on Principles of Programming Languages. ACM Press, New York, pp. 333-352.
35. VALENCIA, F. 2002. Temporal Concurrent Constraint Programming. PhD thesis, BRICS, University of Aarhus.
36. VALENCIA, F. 2003. Timed Concurrent Constraint Programming: Decidability Results and their Application to LTL. In Proceedings of the Nineteenth International Conference on Logic Programming (ICLP'03). Lecture Notes in Computer Science, vol. 2916. Springer-Verlag, pp. 422-437.
37. VILLANUEVA, A. 2003. Model checking for the concurrent constraint paradigm. PhD thesis. University of Udine in cotutela with Technical University of Valencia.