The specification and application to programming of abstract data types.
- Author:
- John Vogel Guttag
Abstract
No abstract available.
Cited By
- Meseguer J and Skeirik S (2017). Equational formulas and pattern operations in initial order-sorted algebras, Formal Aspects of Computing, 29:3, (423-452), Online publication date: 1-May-2017.
- Gabriel K and Ehrig H Modelling of communication platforms using algebraic high-level nets and their processes Software Service and Application Engineering, (10-25)
- Rocha C and Meseguer J Constructors, sufficient completeness, and deadlock freedom of rewrite theories Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning, (594-609)
Kapur D, Majumdar R and Zarba C Interpolation for data structures Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering, (105-116)- Boehm B A view of 20th and 21st century software engineering Proceedings of the 28th international conference on Software engineering, (12-29)
- Löwe M, König H and Schulz C Algebraic properties of interfaces Formal Methods in Software and Systems Modeling, (190-203)
- Hendrix J, Clavel M and Meseguer J A sufficient completeness reasoning tool for partial specifications Proceedings of the 16th international conference on Term Rewriting and Applications, (165-174)
- Parkinson M and Bierman G (2005). Separation logic and abstraction, ACM SIGPLAN Notices, 40:1, (247-258), Online publication date: 12-Jan-2005.
- Parkinson M and Bierman G Separation logic and abstraction Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (247-258)
- Jones C (2003). 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.
- Wagner E (2002). Algebraic specifications, Nordic Journal of Computing, 9:4, (373-404), Online publication date: 1-Dec-2002.
- Futatsugi K and Nakagawa A An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks Proceedings of the 1st International Conference on Formal Engineering Methods
- Kapur D An automated tool for analyzing completeness of equational specifications Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis, (28-43)
- Wing J (1990). A Specifier's Introduction to Formal Methods, Computer, 23:9, (8-23), Online publication date: 1-Sep-1990.
- Zhu M (1989). AUTO STAR—a software development system, ACM SIGPLAN Notices, 24:3, (31-45), Online publication date: 1-Mar-1989.
- Bauer F, Möller B, Partsch H and Pepper P (1989). Formal Program Construction by Transformations-Computer-Aided, Intuition-Guided Programming, IEEE Transactions on Software Engineering, 15:2, (165-180), Online publication date: 1-Feb-1989.
- Goguen J and Meseguer J (1987). Remarks on remarks on many-sorted equational logic, ACM SIGPLAN Notices, 22:4, (41-48), Online publication date: 1-Apr-1987.
- Sannella D and Tarlecki A Program specification and development in standard ML Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (67-77)
- Futatsugi K, Goguen J, Jouannaud J and Meseguer J Principles of OBJ2 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (52-66)
- Sannella D (1984). A set-theoretic semantics for Clear, Acta Informatica, 21:5, (443-472), Online publication date: 1-Dec-1984.
- Dosch W and Möller> B Busy and lazy FP with infinite objects Proceedings of the 1984 ACM Symposium on LISP and functional programming, (282-292)
- Comer J (1983). An experimental natural-language processor for generating data type specifications, ACM SIGPLAN Notices, 18:12, (25-33), Online publication date: 1-Dec-1983.
- Broy M and Wirsing M (1982). Partial abstract types, Acta Informatica, 18:1, (47-64), Online publication date: 1-Mar-1982.
- Yonezaki N and Katayama T Functional specification of synchronized processes based on modal logic Proceedings of the 6th international conference on Software engineering, (208-217)
- Goguen J and Meseguer J (1982). Completeness of many-sorted equational logic, ACM SIGPLAN Notices, 17:1, (9-17), Online publication date: 1-Jan-1982.
- Goguen J and Meseguer J Rapid prototyping Proceedings of the workshop on Rapid prototyping, (75-84)
- Dixon J, McLean J and Parnas D Rapid prototyping by means of abstract module specifications written as trace axioms Proceedings of the workshop on Rapid prototyping, (45-49)
- Goguen J and Meseguer J (1982). Rapid prototyping, ACM SIGSOFT Software Engineering Notes, 7:5, (75-84), Online publication date: 1-Dec-1982.
- Dixon J, McLean J and Parnas D (1982). Rapid prototyping by means of abstract module specifications written as trace axioms, ACM SIGSOFT Software Engineering Notes, 7:5, (45-49), Online publication date: 1-Dec-1982.
- Goguen J and Meseguer J (1981). Completeness of many-sorted equational logic, ACM SIGPLAN Notices, 16:7, (24-32), Online publication date: 1-Jul-1981.
- Guttag J, Horning J and Williams J FP with data abstraction and strong typing Proceedings of the 1981 conference on Functional programming languages and computer architecture, (11-24)
- Schwabe D Formal specification and verification of a connection establishment protocol Proceedings of the seventh symposium on Data communications, (11-26)
- Schwabe D (1981). Formal specification and verification of a connection establishment protocol, ACM SIGCOMM Computer Communication Review, 11:4, (11-26), Online publication date: 1-Oct-1981.
- Goguen J (1981). More thoughts on specification and verification, ACM SIGSOFT Software Engineering Notes, 6:3, (38-41), Online publication date: 1-Jul-1981.
- Gerhart S (1981). AFFIRM summary, ACM SIGSOFT Software Engineering Notes, 6:3, (16-24), Online publication date: 1-Jul-1981.
- Cleaveland J (1980). Mathematical specifications, ACM SIGPLAN Notices, 15:12, (31-42), Online publication date: 1-Dec-1980.
- Martin J FAD, a functional programming language that supports abstract data types Proceedings of the ACM 1980 annual conference, (247-262)
- Musser D On proving inductive properties of abstract data types Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (154-162)
- Kapur D and Mandayam S Expressiveness of the operation set of a data abstraction Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (139-153)
- Calm F and White J An extension to algebraic specifications to incorporate state behavior Proceedings of the 1979 annual conference, (212-220)
- Chaudhary B and Sahasrabuddhe H (1978). Suggestions about a specification technique, ACM SIGPLAN Notices, 13:12, (25-28), Online publication date: 1-Dec-1978.
- Gordon M, Milner R, Morris L, Newey M and Wadsworth C A Metalanguage for interactive proof in LCF Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (119-130)
- Levy M (1977). Some remarks on abstract data types, ACM SIGPLAN Notices, 12:7, (126-128), Online publication date: 1-Jul-1977.
- Wasserman A The evolution of specification techniques Proceedings of the 1977 annual conference, (134-137)
- Guttag J, Horowitz E and Musser D Some extensions to algebraic specifications Proceedings of an ACM conference on Language design for reliable software, (63-67)
- Guttag J, Horowitz E and Musser D (1977). Some extensions to algebraic specifications, ACM SIGSOFT Software Engineering Notes, 2:2, (63-67), Online publication date: 1-Mar-1977.
- Guttag J, Horowitz E and Musser D (1977). Some extensions to algebraic specifications, ACM SIGOPS Operating Systems Review, 11:2, (63-67), Online publication date: 1-Apr-1977.
- Guttag J, Horowitz E and Musser D (1977). Some extensions to algebraic specifications, ACM SIGPLAN Notices, 12:3, (63-67), Online publication date: 1-Mar-1977.
- Guttag J (1977). Abstract data types and the development of data structures, Communications of the ACM, 20:6, (396-404), Online publication date: 1-Jun-1977.
- Guttag J, Horowitz E and Musser D The design of data type specifications Proceedings of the 2nd international conference on Software engineering, (414-420)
Recommendations
Polymorphic type inference and abstract data types
Many statically typed programming languages provide an abstract data type construct, such as the module in Modula-2. However, in most of these languages, implementations of abstract data types are not first-class values. Thus, they cannot be assigned to ...