Skip to main content
    • Aa
    • Aa

Abstract Diagnosis for tccp using a Linear Temporal Logic


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.

Hide All
M. Alpuente , M. Falaschi , and A. Villanueva 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.

M. Alpuente , M. Gallardo , E. Pimentel , and A. Villanueva 2005b. A Semantic Framework for the Abstract Model Checking of tccp Programs. Theoretical Computer Science 346, 1, 5895.

E. M. Clarke and E. A. Emerson 1982. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Logic of Programs, Workshop. Springer-Verlag, London, UK, 5271.

M. Comini , L. Titolo , and A. Villanueva 2011. Abstract Diagnosis for Timed Concurrent Constraint programs. Theory and Practice of Logic Programming 11, 4-5, 487502.

F. S. de Boer , M. Gabbrielli , and M. C. Meo 2000. A Timed Concurrent Constraint Language. Information and Computation 161, 1, 4583.

M. Falaschi , A. Policriti , and A. Villanueva 2001. Modeling concurrent systems specified in a temporal concurrent constraint language-I. Electronic Notes in Theoretical Computer Science 48, 197210.

M. Falaschi and A. Villanueva 2006. Automatic verification of timed concurrent constraint programs. Theory and Practice of Logic Programming 6, 3, 265300.

J. Gaintzarain , M. Hermo , P. Lucio , and M. Navarro 2008. Systematic semantic tableaux for PLTL. Electronic Notes in Theoretical Computer Science 206, 5973.

J. Gaintzarain , M. Hermo , P. Lucio , M. Navarro , and F. Orejas 2009. Dual Systems of Tableaux and Sequents for PLTL. The Journal of Logic and Algebraic Programming 78, 8, 701722.

Z. Manna and A. Pnueli 1992. The temporal logic of reactive and concurrent systems - specification. Springer.

J. P. Queille and J. Sifakis 1982. Specification and verification of concurrent systems in CESAR. In Symposium on Programming, M. Dezani-Ciancaglini and U. Montanari , Eds. Lecture Notes in Computer Science, vol. 137. Springer, 337351.

F. D. Valencia 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? *



Full text views

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

Abstract views

Total abstract views: 108 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 26th September 2017. This data will be updated every 24 hours.