Skip to main content
SpringerLink
Log in

A program analysis framework for tccp based on abstract interpretation

  • Original Article
  • Published:
Formal Aspects of Computing

Abstract

The timed concurrent constraint language (tccp) is a timed extension of the concurrent constraint paradigm. tccp was defined to model reactive systems, where infinite behaviors arise naturally. In previous works, a semantic framework and abstract diagnosis method for the language have been defined. On the basis of that semantic framework, this paper proposes an abstract semantics that, together with a widening operator, is suitable for the definition of different analyses for tccp programs. The abstract semantics is correct and can be represented as a finite graph where each node represents a hypothetical (abstract) computational step of the program. The widening operator allows us to guarantee the convergence of the abstract fixpoint computation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Alpuente M, Gallardo MM, Pimentel E, Villanueva A (2006) A semantic framework for the abstract model checking of tccp programs. Theor Comput Scie 346(1): 58–95

    Article  MathSciNet  MATH  Google Scholar 

  2. Bagnara R, Hill PM., Ricci E, Zaffanella E (2005) Precise widening operators for convex polyhedra. Sci Comput Program 58(1–2):28–56

  3. Cousot P, Cousot R (1977) Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on principles of programming languages, Los Angeles, California, January 17–19. ACM Press, New York, pp 238–252

  4. Clarke EM, Grumberg O, Jha S, Lu Y, Veith H (2000) Counterexample-guided abstraction refinement. In: CAV, Lecture Notes in Computer Science, vol 1855. Springer, pp 154–169

  5. Comini M, Gallardo MM, Titolo L, Villanueva A (2015) Abstract Analysis of Universal Properties for tccp. In: Falaschi M (ed) Logic-based Program Synthesis and Transformation, 25th International Symposium, LOPSTR 2015. Revised Selected Papers, Lecture Notes in Computer Science, vol 9527. Springer, pp 163–178

  6. Comini M, Titolo L, Villanueva A (2011) Abstract diagnosis for timed concurrent constraint programs. Theory Pract Logic Programm 11(4-5):487–502

  7. Comini M, Titolo L, Villanueva A (2013) A condensed goal-independent bottom-up fixpoint modeling the behavior of tccp. Technical report, DSIC, Universitat Politècnica de València. http://riunet.upv.es/handle/10251/34328

  8. de Boer FS, Gabbrielli M, Meo MC (2000) A timed concurrent constraint language. Inf Comput 161(1): 45–83

    Article  MathSciNet  MATH  Google Scholar 

  9. Falaschi M, Gabbrielli M, Marriott K, Palamidessi C (1993) Compositional analysis for concurrent constraint programming. In: Proceedings of the eighth annual IEEE symposium on logic in computer science, Los Alamitos, CA, USA, IEEE Computer Society Press, pp 210–221

  10. Falaschi M, Olarte C, Palamidessi C (2015) Abstract interpretation of temporal concurrent constraint programs. Theory and Pract Logic Program (TPLP) 15(3): 312–357

    Article  MathSciNet  Google Scholar 

  11. Falaschi M, Villanueva A (2006) Automatic verification of timed concurrent constraint programs. Theory Pract Logic Program 6(3): 265–300

    Article  MathSciNet  MATH  Google Scholar 

  12. Gallardo MM, Merino P, Pimentel E (2002) Refinement of LTL formulas for abstract model checking. In: Static analysis, 9th international symposium, SAS 2002, Madrid, Spain, September 17–20, 2002, Proceedings, pp 395–410

  13. Saraswat VA (1993) Concurrent constraint programming. The MIT Press, Cambridge

    MATH  Google Scholar 

  14. Saraswat VA, Rinard M, Panangaden P (1991) The semantic foundations of concurrent constraint programming. In: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on principles of programming languages. ACM, New York, pp 333–352

  15. Zaffanella E, Giacobazzi R, Levi G (1997) Abstracting synchronization in concurrent constraint programming. J Funct Logic Program (6)

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze Matematiche, Informatiche e Fisiche, Università degli Studi di Udine, Udine, Italy

    Marco Comini

  2. LCC, Universidad de Málaga, Málaga, Spain

    María-del-Mar Gallardo

  3. National Institute of Aerospace, Hampton, USA

    Laura Titolo

  4. DSIC, Universitat Politècnica de València, Valencia, Spain

    Alicia Villanueva

Authors
  1. Marco Comini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. María-del-Mar Gallardo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Laura Titolo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alicia Villanueva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alicia Villanueva.

Additional information

Communicated by Augusto Sampaio and Moreno Falaschi

This author has been supported by the Andalusian Excellence Project P11-TIC-7659.

This work has been partially supported by the EU (FEDER) and the Spanish MINECO under grants TIN 2015-69175-C4-1-R and TIN 2013-45732-C4-1-P and by Generalitat Valenciana PROMETEOII/2015/013.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Comini, M., Gallardo, MdM., Titolo, L. et al. A program analysis framework for tccp based on abstract interpretation. Form Asp Comp 29, 531–557 (2017). https://doi.org/10.1007/s00165-016-0409-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00165-016-0409-8

Keywords

Search

Navigation