Advertisement

Formal Aspects of Computing

, Volume 29, Issue 3, pp 531–557 | Cite as

A program analysis framework for tccp based on abstract interpretation

  • Marco Comini
  • María-del-Mar Gallardo
  • Laura Titolo
  • Alicia Villanueva
Original Article
  • 52 Downloads

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.

Keywords

Concurrent constraint paradigm Abstract interpretation Abstract semantics Widening operators 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AGPV05.
    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–95MathSciNetCrossRefMATHGoogle Scholar
  2. BHRZ05.
    Bagnara R, Hill PM., Ricci E, Zaffanella E (2005) Precise widening operators for convex polyhedra. Sci Comput Program 58(1–2):28–56Google Scholar
  3. CC77.
    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–252Google Scholar
  4. CGJ+00.
    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–169Google Scholar
  5. CGTV15.
    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–178Google Scholar
  6. CTV11.
    Comini M, Titolo L, Villanueva A (2011) Abstract diagnosis for timed concurrent constraint programs. Theory Pract Logic Programm 11(4-5):487–502Google Scholar
  7. CTV13.
    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. dBGM00.
    de Boer FS, Gabbrielli M, Meo MC (2000) A timed concurrent constraint language. Inf Comput 161(1): 45–83MathSciNetCrossRefMATHGoogle Scholar
  9. FGMP93.
    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–221Google Scholar
  10. FOP15.
    Falaschi M, Olarte C, Palamidessi C (2015) Abstract interpretation of temporal concurrent constraint programs. Theory and Pract Logic Program (TPLP) 15(3): 312–357MathSciNetCrossRefGoogle Scholar
  11. FV06.
    Falaschi M, Villanueva A (2006) Automatic verification of timed concurrent constraint programs. Theory Pract Logic Program 6(3): 265–300MathSciNetCrossRefMATHGoogle Scholar
  12. GMP02.
    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–410Google Scholar
  13. Sar93.
    Saraswat VA (1993) Concurrent constraint programming. The MIT Press, CambridgeMATHGoogle Scholar
  14. SRP91.
    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–352Google Scholar
  15. ZGL97.
    Zaffanella E, Giacobazzi R, Levi G (1997) Abstracting synchronization in concurrent constraint programming. J Funct Logic Program (6)Google Scholar

Copyright information

© British Computer Society 2017

Authors and Affiliations

  1. 1.Dipartimento di Scienze Matematiche, Informatiche e FisicheUniversità degli Studi di UdineUdineItaly
  2. 2.LCCUniversidad de MálagaMálagaSpain
  3. 3.National Institute of AerospaceHamptonUSA
  4. 4.DSICUniversitat Politècnica de ValènciaValenciaSpain

Personalised recommendations