Skip to main content
×
×
Home

Abstract Diagnosis for tccp using a Linear Temporal Logic

  • MARCO COMINI (a1), LAURA TITOLO (a1) and ALICIA VILLANUEVA (a2)
Abstract

Automatic techniques for program verification usually suffer the well-known state explosion problem. Most of the classical approaches are based on browsing the structure of some form of model (which represents the behavior of the program) to check if a given specification is valid. This implies that a part of the model has to be built, and sometimes the needed fragment is quite huge.

In this work, we provide an alternative automatic decision method to check whether a given property, specified in a linear temporal logic, is valid w.r.t. a tccp program. Our proposal (based on abstract interpretation techniques) does not require to build any model at all. Our results guarantee correctness but, as usual when using an abstract semantics, completeness is lost.

Copyright
References
Hide All
Alpuente, M., Falaschi, M., and Villanueva, A. 2005a. A Symbolic Model Checker for tccp Programs. In First International Workshop on Rapid Integration of Software Engineering Techniques (RISE 2004), Revised Selected Papers. Lecture Notes in Computer Science, vol. 3475. Springer-Verlag, 4556.
Alpuente, M., Gallardo, M., Pimentel, E., and Villanueva, A. 2005b. A Semantic Framework for the Abstract Model Checking of tccp Programs. Theoretical Computer Science 346, 1, 5895.
Alpuente, M., Gallardo, M., Pimentel, E., and Villanueva, A. 2006. Verifying Real-Time Properties of tccp Programs. Journal of Universal Computer Science 12, 11, 15511573.
Clarke, E. M. and Emerson, E. A. 1982. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Logic of Programs, Workshop. Springer-Verlag, London, UK, 5271.
Comini, M., Titolo, L., and Villanueva, A. 2011. Abstract Diagnosis for Timed Concurrent Constraint programs. Theory and Practice of Logic Programming 11, 4-5, 487502.
Comini, M., Titolo, L., and Villanueva, A. 2013a. A Condensed Goal-Independent Bottom-Up Fixpoint Modeling the Behavior of tccp. Tech. rep., DSIC, Universitat Politècnica de València. Available at http://riunet.upv.es/handle/10251/34328.
Comini, M., Titolo, L., and Villanueva, A. 2013b. Towards an Effective Decision Procedure for LTL formulas with Constraints. In 23rd Workshop on Logic-based methods in Programming Environments (WLPE 2013). CoRR abs/1308.2055.
Comini, M., Titolo, L., and Villanueva, A. 2014. Abstract Diagnosis for tccp using a Linear Temporal Logic. Tech. rep., Universitat Politècnica de València. Available at http://riunet.upv.es/handle/10251/8351.
de Boer, F. S., Gabbrielli, M., and Meo, M. C. 2000. A Timed Concurrent Constraint Language. Information and Computation 161, 1, 4583.
de Boer, F. S., Gabbrielli, M., and Meo, M. C. 2001. A Temporal Logic for Reasoning about Timed Concurrent Constraint Programs. In TIME '01: Proceedings of the Eighth International Symposium on Temporal Representation and Reasoning (TIME'01). IEEE Computer Society, Washington, DC, USA, 227.
de Boer, F. S., Gabbrielli, M., and Meo, M. C. 2002. Proving correctness of Timed Concurrent Constraint Programs. CoRR cs.LO/0208042.
Falaschi, M., Olarte, C., Palamidessi, C., and Valencia, F. D. 2007. Declarative Diagnosis of Temporal Concurrent Constraint Programs. In Logic Programming, 23rd International Conference, ICLP 2007, Proceedings, Dahl, V. and Niemelä, I., Eds. Lecture Notes in Computer Science, vol. 4670. Springer-Verlag, 271285.
Falaschi, M., Policriti, A., and Villanueva, A. 2001. Modeling concurrent systems specified in a temporal concurrent constraint language-I. Electronic Notes in Theoretical Computer Science 48, 197210.
Falaschi, M. and Villanueva, A. 2006. Automatic verification of timed concurrent constraint programs. Theory and Practice of Logic Programming 6, 3, 265300.
Gaintzarain, J., Hermo, M., Lucio, P., and Navarro, M. 2008. Systematic semantic tableaux for PLTL. Electronic Notes in Theoretical Computer Science 206, 5973.
Gaintzarain, J., Hermo, M., Lucio, P., Navarro, M., and Orejas, F. 2009. Dual Systems of Tableaux and Sequents for PLTL. The Journal of Logic and Algebraic Programming 78, 8, 701722.
Manna, Z. and Pnueli, A. 1992. The temporal logic of reactive and concurrent systems - specification. Springer.
Palamidessi, C. and Valencia, F. D. 2001. A Temporal Concurrent Constraint Programming Calculus. In 7th International Conference on Principles and Practice of Constraint Programming (CP'01). Lecture Notes in Computer Science, vol. 2239. Springer, 302316.
Queille, J. P. and Sifakis, J. 1982. Specification and verification of concurrent systems in CESAR. In Symposium on Programming, Dezani-Ciancaglini, M. and Montanari, U., Eds. Lecture Notes in Computer Science, vol. 137. Springer, 337351.
Saraswat, V. A. 1989. Concurrent Constraint Programming Languages. Ph.D. thesis, Carnegie-Mellon University.
Saraswat, V. A. 1993. Concurrent Constraint Programming. The MIT Press, Cambridge, Mass.
Valencia, F. D. 2005. Decidability of infinite-state timed CCP processes and first-order LTL. Theoretical Computer Science 330, 3, 577607.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed