Specifications, models, and implementations of data abstractions

Theoretical Computer Science

Volumn 20, Issue 1, 1982, Pages 3-32

  Wand, Mitchell ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346202850     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(82)90097-4     Document Type: Article

References (38)

1. Proving programs correct through refinement
2. Hierarchical program structures
3. Notes on structured programming
4. Algebraic implementation of abstract data types: concept, syntax, semantics and correctness
5. On the many facets of lists
6. Specifications incomplètes mais suffisantes de la representation des types abstraits
7. An initial algebra approach to the specification, correctness, and implementation of abstract data types
8. Abstract data types and software validation
9. Computability and completeness in logics of programs
10. Nondeterminism in logics of programs
11. Proving correctness of data representations
12. Final data type specifications: a new data type specification method
13. The early development of programming languages
14. Data types
15. Abstraction mechanisms in CLU
16. Specification techniques for data abstractions
17. Limits of the algebraic specification of data types
18. A proof rule for functions
19. Hierarchical program specification and verification—a many-sorted logical approach
20. A decidability result for a second order process logic
21. A technique for module specification with examples
22. Semantical considerations on Floyd-Hoare logic
23. Proof techniques for hierarchically structured programs
24. On algorithmic theory of stacks
25. An example of hierarchical design and proof
26. Final algebra semantics and data type extensions
27. An introduction to the construction and verification of Alphard programs