Skip to main content
SpringerLink
Log in

Weakening Additivity in Adjoining Closures

  • Published:
Order Aims and scope Submit manuscript

Abstract

In this paper, we weaken the conditions for the existence of adjoint closure operators, going beyond the standard requirement of additivity/co-additivity. We consider the notion of join-uniform (lower) closure operators, introduced in computer science, in order to model perfect lossless compression in transformations acting on complete lattices. Starting from Janowitz’s characterization of residuated closure operators, we show that join-uniformity perfectly weakens additivity in the construction of adjoint closures, and this is indeed the weakest property for this to hold. We conclude by characterizing the set of all join-uniform lower closure operators as fix-points of a function defined on the set of all lower closures of a complete lattice.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Blyth, T., Janowitz, M.: Residuation theory. Pergamon Press (1972)

  2. Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752–794 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Conference Record of the 4th ACM Symposium on Principles of Programming Languages (POPL ’77), pp 238–252. ACM Press (1977)

  4. Cousot, P., Cousot, R.: A constructive characterization of the lattices of all retractions, preclosure, quasi-closure and closure operators on a complete lattice. Portug. Math. 38(2), 185–198 (1979)

    MathSciNet  MATH  Google Scholar 

  5. Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Conference Record of the 6th ACM Symposium on Principles of Programming Languages (POPL ’79), pp 269–282. ACM Press (1979)

  6. Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., Rival, X.: The astreé analyzer. In: Sagiv, S. (ed.) Programming Languages and Systems, 14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, vol. 3444, pp 21–30. Springer (2005). doi:10.1007/978-3-540-31987-0_3

  7. Dwinger, P.: On the closure operators of a complete lattice. Indag. Math. 16, 560–563 (1954)

    Article  MathSciNet  MATH  Google Scholar 

  8. Giacobazzi, R., Ranzato, F.: Refining and compressing abstract domains. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP ’97), Lecture Notes in Computer Science, vol. 1256, pp 771–781. Springer-Verlag (1997)

  9. Giacobazzi, R., Ranzato, F.: Optimal domains for disjunctive abstract interpretation. Sci. Comput. Program 32(1-3), 177–210 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  10. Giacobazzi, R., Ranzato, F.: Uniform closures: order-theoretically reconstructing logic program semantics and abstract domain refinements. Inform. Comput 145(2), 153–190 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  11. Janowitz, M.F.: Residuated closure operators. Portug. Math. 26(2), 221–252 (1967)

    MathSciNet  MATH  Google Scholar 

  12. Morgado, J.: Some results on the closure operators of partially ordered sets. Portug. Math. 19(2), 101–139 (1960)

    MathSciNet  MATH  Google Scholar 

  13. Giacobazzi, R., Ranzato, F., Scozzari, F.: Making abstract interpretation complete. J. ACM 47(2), 361–416 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Rice, H.: Classes of recursively enumerable sets and their decision problems. Trans. Amer. Math. Soc. 74, 358–366 (1953)

    Article  MathSciNet  MATH  Google Scholar 

  15. Ward, M.: The closure operators of a lattice. Ann. Math. 43(2), 191–196 (1942)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Verona, Verona, Italy

    Isabella Mastroeni & Roberto Giacobazzi

  2. IMDEA Software Institute, Madrid, Spain

    Roberto Giacobazzi

Authors
  1. Isabella Mastroeni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roberto Giacobazzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Isabella Mastroeni.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mastroeni, I., Giacobazzi, R. Weakening Additivity in Adjoining Closures. Order 33, 503–516 (2016). https://doi.org/10.1007/s11083-015-9381-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-015-9381-9

Keywords

Search

Navigation