Skip to main content
SpringerLink
Log in

On Normal Forms for Structured Specifications with Generating Constraints

  • Chapter
  • First Online:
Graph Transformation, Specifications, and Nets

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10800))

  • 972 Accesses

Abstract

Hartmut Ehrig and others in [EWT83] studied normal form results for complex generating constraints imposed on basic specifications. Since then this work has been followed by subsequent results concerning normal forms for structured specifications, typically built from basic specifications using union, translation and hiding. We consider generating constraints as additional specification-building operations and follow and extend the results concerning normal forms for the resulting specifications with various forms of generating constraints.

This work has been partially supported by the (Polish) National Science Centre, grant 2013/11/B/ST6/01381 (AT).

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Awodey, S.: Category Theory. Oxford University Press, New York (2006)

    Book  MATH  Google Scholar 

  2. Baumeister, H., Cerioli, M., Haxthausen, A., Mossakowski, T., Mosses, P.D., Sannella, D., Tarlecki, A.: Casl semantics. In: [Mos04] (2004)

    Google Scholar 

  3. Bergstra, J.A., Heering, J., Klint, P.: Module algebra. J. Assoc. Comput. Mach. 37(2), 335–372 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bidoit, M., Mosses, P.D. (eds.): CASL User Manual. LNCS, vol. 2900. Springer, Heidelberg (2004). https://doi.org/10.1007/b11968. http://www.informatik.uni-bremen.de/cofi/index.php/CASL

    MATH  Google Scholar 

  5. Borzyszkowski, T.: Logical systems for structured specifications. Theor. Comput. Sci. 286(2), 197–245 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Codescu, M., Mossakowski, T., Sannella, D., Tarlecki, A.: Specification refinements: calculi, tools, and applications. Sci. Comput. Program. 144, 1–49 (2017)

    Article  Google Scholar 

  7. Căzănescu, V.E., Roşu, G.: Weak inclusion systems. Math. Struct. Comput. Sci. 7(2), 195–206 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  8. Diaconescu, R., Goguen, J.A., Stefaneas, P.: Logical support for modularisation. In: Huet, G., Plotkin, G. (eds.) Logical Environments, pp. 83–130. Cambridge University Press, Cambridge (1993)

    Google Scholar 

  9. Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 1. EATCS Monographs on Theoretical Computer Science, vol. 6. Springer, Heidelberg (1985). https://doi.org/10.1007/978-3-642-69962-7

    Book  MATH  Google Scholar 

  10. Ehrig, H., Wagner, E.G., Thatcher, J.W.: Algebraic specifications with generating constraints. In: Diaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 188–202. Springer, Heidelberg (1983). https://doi.org/10.1007/BFb0036909

    Chapter  Google Scholar 

  11. Goguen, J.A., Burstall, R.M.: Introducing institutions. In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol. 164, pp. 221–256. Springer, Heidelberg (1984). https://doi.org/10.1007/3-540-12896-4_366. Many revised versions were widely circulated, with [GB92] as the endpoint

    Chapter  Google Scholar 

  12. Goguen, J.A., Burstall, R.M.: Institutions: abstract model theory for specification and programming. J. Assoc. Comput. Mach. 39(1), 95–146 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  13. Goguen, J.A., Roşu, G.: Composing hidden information modules over inclusive institutions. In: Owe, O., Krogdahl, S., Lyche, T. (eds.) From Object-Orientation to Formal Methods. LNCS, vol. 2635, pp. 96–123. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-39993-3_7

    Chapter  Google Scholar 

  14. McCarthy, J.: Circumscription – a form of non-monotonic reasoning. Artif. Intell. 13(1–2), 27–39 (1980)

    Article  MATH  Google Scholar 

  15. Mossakowski, T., Codescu, M., Neuhaus, F., Kutz, O.: The distributed ontology, modeling and specification language – DOL. In: Koslow, A., Buchsbaum, A. (eds.) The Road to Universal Logic. SUL, pp. 489–520. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-15368-1_21

    Chapter  Google Scholar 

  16. Mosses, P.D. (ed.): Casl Reference Manual. LNCS, vol. 2960. Springer, Heidelberg (2004). https://doi.org/10.1007/b96103

    MATH  Google Scholar 

  17. MacQueen, D., Sannella, D.: Completeness of proof systems for equational specifications. IEEE Trans. Softw. Eng. SE–11(5), 454–461 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  18. Sannella, D., Tarlecki, A.: Specifications in an arbitrary institution. Inf. Comput. 76(2–3), 165–210 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  19. Sannella, D., Tarlecki, A.: Foundations of Algebraic Specification and Formal Software Development. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2012)

    Book  MATH  Google Scholar 

  20. Sannella, D., Tarlecki, A.: Property-oriented semantics of structured specifications. Math. Struct. Comput. Sci. 24(2), e240205 (2014)

    MathSciNet  MATH  Google Scholar 

  21. Sannella, D., Wirsing, M.: A kernel language for algebraic specification and implementation: extended abstract. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 413–427. Springer, Heidelberg (1983). https://doi.org/10.1007/3-540-12689-9_122

    Chapter  Google Scholar 

  22. Tarlecki, A.: Remarks on [EWT83]. Unpublished note, Department of Computer Science, University of Edinburgh (1983)

    Google Scholar 

Download references

Acknowledgements

Thanks to the anonymous referees for their constructive comments.

Author information

Authors and Affiliations

  1. Laboratory for Foundations of Computer Science, University of Edinburgh, Edinburgh, UK

    Donald Sannella

  2. Institute of Informatics, University of Warsaw, Warsaw, Poland

    Andrzej Tarlecki

Authors
  1. Donald Sannella
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Tarlecki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Donald Sannella .

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Leicester, Leicester, United Kingdom

    Reiko Heckel

  2. Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Marburg, Germany

    Gabriele Taentzer

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Sannella, D., Tarlecki, A. (2018). On Normal Forms for Structured Specifications with Generating Constraints. In: Heckel, R., Taentzer, G. (eds) Graph Transformation, Specifications, and Nets. Lecture Notes in Computer Science(), vol 10800. Springer, Cham. https://doi.org/10.1007/978-3-319-75396-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75396-6_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-75395-9

  • Online ISBN: 978-3-319-75396-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation