On the practical need for abstraction relations to verify abstract data type representations

IEEE Transactions on Software Engineering

Volumn 23, Issue 3, 1997, Pages 157-170

  Sitaraman, Murali ^a   Weide, Bruce W ^b   Ogden, William F ^a  

^a WEST VIRGINIA UNIVERSITY   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Abstract data type; Abstraction function; Abstraction mapping; Abstraction relation; Data abstraction; Formal specification; Greedy algorithm; Nondeterminism; Optimization problem; Program verification; Relation

Indexed keywords

EID: 0012083603     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.585503     Document Type: Article

References (27)

1. M. Abadi and L. Lamport, "The Existence of Refinement Mappings," Theoretical Computing Science, vol. 82, no. 2, pp. 253-284, May 1991.
2. A. Bloesch, E. Kazmierczak, P. Kearney, and O. Traynor, "Cogito: A Methodology and System for Formal Software Development,"
3. Intl. J. Software Eng. and Knowledge Eng., vol. 5, no. 4 pp. 599-617, Dec. 1995.
4. S.A. Cook, "Soundness and Completeness of an Axiom System for Program Verification," SIAM J. Computing, vol. 7, no. 1, pp. 70-90, Feb. 1978.
5. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. Cambridge, Mass.: MIT Press, 1990.
6. H.-D. Ehrich and A. Sernadas, "Algebraic Implementation of Objects over Objects," Stepwise Refinement of Distributed Systems - Lecture Notes in Computer Science 430. New York: Springer-Verlag, pp. 239-266, 1990.
7. G.W. Ernst, R.J. Hookway, J.A. Menegay, and W.F. Ogden, "Modular Verification of Ada Generics," Computer Language, vol. 16, nos. 3/4, pp. 259-280, 1991.
8. G.W. Ernst, R.J. Hookway, and W.F. Ogden, "Modular Verification of Data Abstractions with Shared Realizations," IEEE Trans. Software Eng. vol. 20, no. 4, pp. 288-307, Apr. 1994.
9. D.E. Harms and B.W. Weide, "Copying and Swapping: Influences on the Design of Reusable Software Components," IEEE Trans. Software Eng., vol. 17, no. 5, pp. 424-435, May 1991.
10. J. He, C.A.R. Hoare, and J.W. Sanders, "Data Refinement Refined," Lecture Notes in Computer Science 213, B. Robinet and R. Wilhelm, eds., pp. 187-196, Springer-Verlag.
11. C.A.R. Hoare, "Proof of Correctness of Data Representations," Acta Informatica, vol. 1, no. 1, pp. 271-281, 1972; also in D. Cries, ed., Programming Methodology: A Collection of Articles by Members of IFIP WG 2.3, pp. 269-281, New York: Springer-Verlag, 1978.
12. C.B. Jones, Systematic Software Development Using VDM, Hertford-shire, U.K.: Prentice Hall Int'l, 1990.
13. D. Kapur and S. Mandayam, "Expressiveness of the Operation Set of a Data Abstraction," Conf. Record Seventh Ann. ACM Symp. Principles of Programming Languages, pp. 139-153, ACM, 1980.
14. G.T. Leavens, "Modular Specification and Verification of Object-Oriented Programs," IEEE Software, vol. 8, no. 4, pp. 72-80, July 1991.
15. B. Liskov and J.M. Wing, "A New Definition of the Subtype Relation," ECOOP 1993 - Lecture Notes in Computer Science 707, pp. 118-141. New York: Springer-Verlag, 1993.
16. B. Liskov and J.M. Wing, "Corrigenda to ECOOP '93 Paper," ACM SIGPLAN Notices, vol. 29, no. 4, p. 4, Apr. 1994.
17. N. Lynch, "Multivalued Possibilities Mappings," Stepwise Refinement of Distributed Systems - Lecture Notes in Computer Science 430, pp. 519-543, New York: Springer-Verlag, 1990.
18. G. Nelson, "A Generalization of Dijkstra's Calculus," ACM Trans. on Program Languages and Systems, vol. 11, no. 4, pp. 517-561, Oct. 1989.
19. T. Nipkow, "Are Homomorphisms Sufficient for Behavioral Implementations of Deterministic and Nondeterministic Data Types?" Lecture Notes in Computer Science 247, F.J. Brandenburg, G. Vidal-Naquet, and M. Wirsing, eds., pp. 260-271, New York: Springer-Verlag, 1987.
20. O. Schoett, "Behavioral Correctness of Data Representations," Science of Computer Programming, vol. 14, pp. 43-57, 1990.
21. M. Sitaraman, L.R. Welch, and D.E. Harms, "On Specification of Reusable Software Components," Intl. J. Software Eng. and Knowledge Eng., vol. 3, no. 2 , pp. 207-219, June 1993.
22. "Special Feature: Component-Based Software Using RESOLVE," M. Sitaraman and B.W. Weide, eds., ACM SIGSOFT Software Eng. Notes, vol. 19, no. 4, pp. 21-67, Oct. 1994.
23. M. Sitaraman, "Impact of Performance Considerations on Formal Specification Design," Formal Aspects of Computing, vol. 8, no. 6, pp. 716-736, 1997.
24. B.W. Weide and J.E. Hollingsworth, "Scalability of Reuse Technology to Large Systems Requires Local Certifiability," Proc. Fifth Ann. Workshop Software Reuse, Palo Alto, Calif., Oct. 1992.
25. B.W. Weide, W.F. Ogden, and M. Sitaraman, "Recasting Algorithms to Encourage Reuse," IEEE Software, vol. 11, no. 5 pp. 80-88, Sept. 1994.
26. B.W. Weide, S.H. Edwards, W.D. Heym, T.J. Long, and W.F. Ogden, "Characterizing Observability and Controllability of Software Components," Proc. Fourth Int'l Conf. Software Reuse, M. Sitaraman, ed., pp. 62-71, IEEE, Apr. 1996.
27. J.M. Wing, "A Specifier's Introduction to Formal Methods," Computer, vol. 23, no. 9, pp. 8-24, Sept. 1990.