Nothing Special   »   [go: up one dir, main page]

skip to main content
Skip header Section
Fundamentals of algebraic specification 2: module specifications and constraintsJanuary 1990
  • Authors:
  • H. Ehrig,
  • Bernd Mahr
Publisher:
  • Springer-Verlag
  • Berlin, Heidelberg
ISBN:978-0-387-51799-5
Published:03 January 1990
Pages:
427
Skip Bibliometrics Section
Reflects downloads up to 19 Feb 2025Bibliometrics
Abstract

No abstract available.

Cited By

  1. Avola D, Bottoni P and Hawash A (2017). Supporting group collaboration in an annotation system, Journal of Visual Languages and Computing, 41:C, (22-40), Online publication date: 1-Aug-2017.
  2. Castro P, Aguirre N, Pombo C and Maibaum T Towards managing dynamic reconfiguration of software systems in a categorical setting Proceedings of the 7th International colloquium conference on Theoretical aspects of computing, (306-321)
  3. Bauer S, Hennicker R and Wirsing M Building a modal interface theory for concurrency and data Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques, (1-12)
  4. Klein P The architecture description language model Graph transformations and model-driven engineering, (249-273)
  5. Padberg J, Ehrig H and Orejas F (2009). Towards Component Verification in the Generic Component Framework, Electronic Notes in Theoretical Computer Science (ENTCS), 203:7, (37-53), Online publication date: 1-Apr-2009.
  6. Guedes L and Haeusler E Action algebras and model algebras in denotational semantics Semantics and algebraic specification, (227-249)
  7. ACM
    Batory D Using modern mathematics as an FOSD modeling language Proceedings of the 7th international conference on Generative programming and component engineering, (35-44)
  8. ACM
    Batory D From implementation to theory in product synthesis Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (135-136)
  9. ACM
    Batory D (2007). From implementation to theory in product synthesis, ACM SIGPLAN Notices, 42:1, (135-136), Online publication date: 17-Jan-2007.
  10. ACM
    Fu Y, Dong Z and He X Formalizing and validating UML architecture description of web systems Workshop proceedings of the sixth international conference on Web engineering, (8-es)
  11. Mossakowski T and Roggenbach M Structured CSP Proceedings of the 18th international conference on Recent trends in algebraic development techniques, (92-110)
  12. Fiadeiro J, Lopes A and Bocchi L Algebraic semantics of service component modules Proceedings of the 18th international conference on Recent trends in algebraic development techniques, (37-55)
  13. Gibbons J Datatype-generic programming Proceedings of the 2006 international conference on Datatype-generic programming, (1-71)
  14. Hill G and Vickers S (2006). A language for configuring multi-level specifications, Theoretical Computer Science, 351:2, (146-166), Online publication date: 21-Feb-2006.
  15. Schröder L, Mossakowski T, Tarlecki A, Klin B and Hoffman P (2005). Amalgamation in the semantics of CASL, Theoretical Computer Science, 331:1, (215-247), Online publication date: 15-Feb-2005.
  16. Padberg J and Kreowski H Loose semantics of petri nets Formal Methods in Software and Systems Modeling, (370-384)
  17. Wolter U Cofree coalgebras for signature morphisms Formal Methods in Software and Systems Modeling, (275-290)
  18. Meseguer J Functorial semantics of rewrite theories Formal Methods in Software and Systems Modeling, (220-235)
  19. Mahr B and Bab S ∈T-Integration of logics Formal Methods in Software and Systems Modeling, (204-219)
  20. Löwe M, König H and Schulz C Algebraic properties of interfaces Formal Methods in Software and Systems Modeling, (190-203)
  21. Engels G, Heckel R and Cherchago A Flexible interconnection of graph transformation modules Formal Methods in Software and Systems Modeling, (38-63)
  22. Lau K, Momigliano A and Ornaghi M Constructive specifications for compositional units Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation, (198-214)
  23. Batory D, Sarvela J and Rauschmayer A (2004). Scaling Step-Wise Refinement, IEEE Transactions on Software Engineering, 30:6, (355-371), Online publication date: 1-Jun-2004.
  24. Schröder L, Mossakowski T and Lüth C Type class polymorphism in an institutional framework Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques, (234-251)
  25. Durán F and Meseguer J (2003). Structured theories and institutions, Theoretical Computer Science, 309:1, (357-380), Online publication date: 2-Dec-2003.
  26. Janarthanan V and Sinha P Modular Composition and Verification of Transaction Processing Protocols Proceedings of the 23rd International Conference on Distributed Computing Systems
  27. Jones C (2018). The Early Search for Tractable Ways of Reasoning about Programs, IEEE Annals of the History of Computing, 25:2, (26-49), Online publication date: 1-Apr-2003.
  28. Tinelli C and Ringeissen C (2003). Unions of non-disjoint theories and combinations of satisfiability procedures, Theoretical Computer Science, 290:1, (291-353), Online publication date: 1-Jan-2003.
  29. Ehrig H, Hoffmann K, Padberg J, Baldan P and Heckel R High-level net processes Formal and natural computing, (191-219)
  30. ACM
    Eckstein S, Ahlbrecht P and Neumann K Techniques and language constructs for developing generic informations systems Proceedings of the 2001 symposium on Software reusability: putting software reuse in context, (145-154)
  31. ACM
    Eckstein S, Ahlbrecht P and Neumann K (2019). Techniques and language constructs for developing generic informations systems, ACM SIGSOFT Software Engineering Notes, 26:3, (145-154), Online publication date: 1-May-2001.
  32. van Eck P, Engelfriet J, Fensel D, van Harmelen F, Venema Y and Willems M (2001). A Survey of Languages for Specifying Dynamics, IEEE Transactions on Knowledge and Data Engineering, 13:3, (462-496), Online publication date: 1-May-2001.
  33. Modular Composition of Redundancy Management Protocols in Distributed Systems Proceedings of the The 21st International Conference on Distributed Computing Systems
  34. Bergman C and Slutzki G Complexity of some problems in universal algebra extended abstract Proceedings of the 16th annual conference on Theoretical aspects of computer science, (163-172)
  35. ACM
    Yu H, Esterline A and Monroe J Object-oriented formal specifications to support Ada 95 reuse Proceedings of the conference on TRI-Ada '96: disciplined software development with Ada, (125-131)
  36. ACM
    Hoffman D and Strooper P (2019). State abstraction and modular software development, ACM SIGSOFT Software Engineering Notes, 20:4, (53-61), Online publication date: 1-Oct-1995.
  37. ACM
    Hoffman D and Strooper P State abstraction and modular software development Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering, (53-61)
  38. ACM
    Goguen J and Burstall R (1992). Institutions: abstract model theory for specification and programming, Journal of the ACM (JACM), 39:1, (95-146), Online publication date: 2-Jan-1992.
  39. Goedicke M, Schumann H and Cramer J On the specification of software components Proceedings of the 6th international workshop on Software specification and design, (166-174)
  40. ACM
    Logrippo L, Melanchuk T and Du Wors R (2019). The algebraic specification language LOTOS: an industrial experience, ACM SIGSOFT Software Engineering Notes, 15:4, (59-66), Online publication date: 1-Sep-1990.
  41. ACM
    Ledru Y and Schobbens P (2019). Applying VDM to large developments, ACM SIGSOFT Software Engineering Notes, 15:4, (55-58), Online publication date: 1-Sep-1990.
  42. ACM
    Logrippo L, Melanchuk T and Du Wors R The algebraic specification language LOTOS: an industrial experience Conference proceedings on Formal methods in software development, (59-66)
  43. ACM
    Ledru Y and Schobbens P Applying VDM to large developments Conference proceedings on Formal methods in software development, (55-58)
  44. Diaz M and Vissers C (2018). SEDOS, IEEE Software, 6:6, (24-33), Online publication date: 1-Nov-1989.
  45. ACM
    Inoue K, Ogihara T, Kikuno T and Torii K A formal adaption method for process descriptions Proceedings of the 11th international conference on Software engineering, (145-153)
  46. ACM
    Mosses P Unified algebras and modules Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (329-343)
  47. ACM
    Olthoff W (1986). Augmentation of object-oriented programming by concepts of abstract data type theory: the ModPascal experience, ACM SIGPLAN Notices, 21:11, (429-443), Online publication date: 1-Nov-1986.
  48. ACM
    Olthoff W Augmentation of object-oriented programming by concepts of abstract data type theory: the ModPascal experience Conference proceedings on Object-oriented programming systems, languages and applications, (429-443)
Contributors
  • Technical University of Berlin
  • Technical University of Berlin

Reviews

Lars Langemyr

The authors describe recent progress in the area of formal methods for software development. They focus on algebraic techniques for specification, an area in which they have contributed substantially to recent developments. They do not discuss formal methods for software development in general. They point out that the methods described in the book are not yet ready for practical application to program development. This book is the second in a series on algebraic specification techniques. The first volume [1] covers basic equational reasoning and how it can be applied for formal specification. The authors have a certain semantic model (initial semantics) in mind, and they convincingly show its advantages. This book focuses on the concept of a module, which allows a further level of abstraction by hiding internals of a specification (compare the module concept of Modula-2 or packages in Ada). A better structuring can often be achieved by using the module concept. The book is the first complete guide to this new research area. Chapter 1 informally presents the concept of an algebraic module and gives some historical background. A module consists of four specification parts—import interface, export interface, parameter, and body part. Chapter 2 gives a formal definition of module specification with syntax, semantics, and correctness. Morphisms between the four parts give two alternative semantic notions—functorial and restriction semantics. The third chapter introduces operations on module specifications. The operations are composition, union, and actualization. The authors show that these operations preserve correctness and semantics. Chapter 4 generalizes the concept of operation on a module, showing that the previous operations on modules are only instances of the new concept. In Chapter 5 the authors discuss how an interface consisting of export, import, and parameter parts can be extended to a complete module specification, including a body. This extension is called realization. They also show that refinement of a module is compatible with the module operations from chapter 3. Chapter 6 extends refinement to the general module operations of chapter 4. The seventh chapter introduces the concept of constraint in order to increase the power of a module specification by extending the power beyond equational logic. In Chapter 8 the authors extend the concepts from chapters 2 and 3 to the case where constraints are allowed in the parameter, import, and export parts of a specification. In chapter 9 they define two specification languages that realize the ideas of previous chapters. Chapter 10 provides a summary of basic notation. The book is clearly written and gives an intuitive explanation for most concepts and ideas. Sometimes, however, the reader gets a feeling that the notation will become less complicated when further research has been done. The book is suitable for a graduate course in algebraic specification or for someone intending to do research in the field. A disadvantage for course use is that the book includes no exercises; it contains illuminating examples, however. The first book in the series [1] is a necessary prerequisite. Previous experience with universal algebra makes reading easier. The authors provide a summary of basic notation, a bibliography that covers recent work in the area, and a short subject index.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Please enable JavaScript to view thecomments powered by Disqus.

Recommendations