- 1. Bobrow, D., et al. "CommonLoops: Merging Lisp and Object-Oriented Programming". Proc. of the ACM Conference on Object-Oriented Programming Systems, Languages and Applications, SIGPLAN Notices 21, 11 (November 1986). Google ScholarDigital Library
- 2. Bruce, K., and Wegner, P. "An Algebraic Model of Subtypes in Object-Oriented Languages (Draft)". SIGPLAN Notices 21, 10 (October 1986). Google ScholarDigital Library
- 3. Dahl, O.-J., and Hoare, C. A. R. Hierarchical Program Structures. In Structured Programming, Academic Press, 1972. Google ScholarDigital Library
- 4. Goldberg, A., and Robson, D. Smalltalk-80: The Language and its Implementation. Addison-Wesley, Reading, Ma., 1983. Google ScholarDigital Library
- 5. Hoare, C. A. R. "Proof of correctness of data representations". Acta Informatica 4 (1972), 271-281.Google ScholarDigital Library
- 6. Leavens, G. Subtyping and Generic Invocation: Semantics and Language Design. Ph.D. Th., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, forthcoming.Google Scholar
- 7. Liskov, B. A Design Methodology for Reliable Software Systems. In Tutorial on Software Design Techniques, P. Freeman and A. Wasserman, Eds., IEEE, 1977. Also published in the Proc. of the Fall Joint Computer Conference, 1972.Google Scholar
- 8. Liskov, B., Snyder, A., Atkinson, R. R., and Schaffert, J. C. "Abstraction mechanisms in CLU". Comm. of the ACM 20, 8 (August 1977), 564-576. Google ScholarDigital Library
- 9. Liskov, B., et al. CLU Reference Manual. Springer-Verlag, 1984. Google ScholarDigital Library
- 10. Liskov, B., et al. Argus Reference Manual. Technical Report MIT/LCS/TR-400, M.I.T. Laboratory for Computer Science, Cambridge, Ma., 1987. Google ScholarDigital Library
- 11. Liskov, B., and Guttag, J., Abstraction and Specification in Program Development. MIT Press and McGraw Hill, 1986. Google ScholarDigital Library
- 12. Liskov, B., and Zilles, S. "Programming with abstract data types". Proc. of ACM SIGPLAN Conference on Very High Level Languages, SIGPLAN Notices 9 (1974). Google ScholarDigital Library
- 13. Moon, D. "Object-Oriented Programming with Flavors". Proc. of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, SIGPLAN Notices 21, 11 (November 1986). Google ScholarDigital Library
- 14. Morris, J. H. "Protection in Programming Languages". Comm. of the ACM 16, 1 (January 1973). Google ScholarDigital Library
- 15. Parnas, D. Information Distribution Aspects of Design Methodology. In Proceedings of IFIP Congress, North Holland Publishing Co., 1971.Google Scholar
- 16. Parnas, D. "On the Criteria to be Used in Decomposing "Systems into Modules". Comm. of the ACM 15, 12 (December 1972). Google ScholarDigital Library
- 17. Schaffert, C., et al. "An Introduction to Trellis/Owl". Proc. of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, SIGPLAN Notices 21, 11 (November 1986). Google ScholarDigital Library
- 18. Snyder, A. "Encapsulation and Inheritance in Object-Oriented Programming Languages". Proc. of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, SIGPLAN Notices 21, 11 (November 1986). Google ScholarDigital Library
- 19. U. S. Department of Defense. Reference manual for the Ada programming language. 1983. ANSI standard Ada. Google ScholarDigital Library
Index Terms
- Keynote address - data abstraction and hierarchy
Recommendations
Abstraction refinement for termination
SAS'05: Proceedings of the 12th international conference on Static AnalysisAbstraction can often lead to spurious counterexamples. Counterexample-guided abstraction refinement is a method of strengthening abstractions based on the analysis of these spurious counterexamples. For invariance properties, a counterexample is a ...
Transition predicate abstraction and fair termination
POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languagesPredicate abstraction is the basis of many program verification tools. Until now, the only known way to overcome the inherent limitation of predicate abstraction to safety properties was to manually annotate the finite-state abstraction of a program. We ...
Transition predicate abstraction and fair termination
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languagesPredicate abstraction is the basis of many program verification tools. Until now, the only known way to overcome the inherent limitation of predicate abstraction to safety properties was to manually annotate the finite-state abstraction of a program. We ...
Comments