Using Term Rewriting to Verify Software

IEEE Transactions on Software Engineering

Volumn 20, Issue 4, 1994, Pages 259-274

  Gannon, John ^b  

^a PORTLAND STATE UNIVERSITY   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Program verification; specification design; theorem proving

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING; HEURISTIC METHODS; PROGRAM PROCESSORS;

BOYER MOORE PROVER; SOFTWARE VERIFICATION; SPECIFICATION DESIGN; TERM REWRITING;

COMPUTER SOFTWARE;

EID: 0028416361     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.277574     Document Type: Article

References (31)

1. P. America, “A parallel object-oriented language with inheritance and subtyping,” ACM SIGPLAN Notices, vol. 25, pp. 161–168, Oct. 1990.
2. S. Antoy, “Automatically provable specifications,” Tech. Rep. 1876. Dept. of Comput. Sci., Univ. of Md., 1987.
3. S. Antoy, “Design strategies for rewrite rules,” CTRS’90, published in Lecture Notes in Comput. Sci., vol. 516, pp. 333–341, 1990.
4. S. K. Basu, “On development of iterative programs from functional specifications,” IEEE Trans. Software Eng., vol. 6, no. 2, pp. 170–182, 1980.
5. R. S. Boyer and J. S. Moore, A Computational Logic. New York: Academic Press, 1979.
6. R. Burstall, “Proving properties of programs by structural induction,” Comput. J., vol. 12, no. 1, pp. 41–48, 1969.
7. C. Choppy, S. Kaplan, and M. Soria, “Complexity analysis of term-rewriting rewriting systems,” Theoretical Comput. Sci., vol. 67, pp. 261–282, 1989.
8. J. de Bakker, Mathematical Theory of Program Correctness. London, UK: Prentice-Hall, 1980.
9. N. Dershowitz, “Termination of rewriting,” J. Symbolic Computation, vol. 3, pp. 69–116, 1987.
10. N. Dershowitz and J. Jouannaud, “Rewrite systems,” in Handbook of Theoretical Computer Science B: Formal Methods and Semantics, J. van Leeuwen, ed. Amsterdam: North Holland, 1990, pp. 243–320.
11. E. W. Dijkstra, A Discipline of Programming. Englewood Cliffs, NJ: Prentice-Hall, 1976.
12. H. Ehrig and B. Mahr, Fundamental of Algebraic Specification I: Equations and Initial Semantics. Berlin: Springer-Verlag, 1985.
13. S. J. Garland, J. V. Guttag, and J. J. Horning, “Debugging Larch shared language specifications,” IEEE Trans. Software Eng. vol. 16, pp. 1044–1057, 1990.
14. J. Goguen, “Reusing and interconnecting software components,” IEEE Comput., vol. 19, pp. 16–28, 1986.
15. J. Goguen, J.-P. Jouannaud, and J. Meseguer, “Operational semantics of order-sorted algebras,” CALP’ 85, 1985. Lecture Notes in Computer Science, vol. 194.
16. J. A. Goguen and T. Winkler, “Introducing OBJ3,” Tech. Rep. SRI—CSL-88-9, SRI International, Menlo Park, CA, 1988.
17. J. Guttag, “Notes on type abstraction.” IEEE Trans. Software Eng., vol. 6, pp. 13–23, 1980.
18. J. V. Guttag, E. Horowitz, and D. Musser. “Abstract data types and software validation,” Commun. ACM, vol. 21, pp. 1048–1064, 1978.
19. C. A. R. Hoare, “An axiomatic basis for computer programming,” CACM, vol. 12, pp. 576–583, 1969.
20. C. A. R. Hoare, “Proof of correctness of data representations,” Acta Informatica, vol. 1, pp. 271–281, 1972.
21. G. Huet, “Confluent reductions: Abstract properties and applications to term-rewriting systems,” JACM, vol. 27, pp. 797–821, 1980.
22. G. Huet and J.-M. Hullot, “Proofs by induction in equational theories with constructors,” JCSS, vol. 25, pp. 239–266, 1982.
23. S. Kamin, “The expressive theory of stacks,” Acta Informatica, vol. 24, pp. 695–709, 1987.
24. D. Kapur, P. Narendran, and H. Zhang, “On sufficient-completeness and related properties of term rewriting systems,” Acta Informatica, vol. 24, pp. 395–415, 1987.
25. J. W. Klop, “Term rewriting systems,” Handbook of Logic in Computer Science, volume 11, In D. Gabbay S. Abramsky and T. Maibaum, eds. New York: Oxford University Press, 1992, pp. 1–112.
26. D. E. Knuth and P. B. Bendix, Simple Word Problems in Universal Algebras. New York: Pergamon, 1970, pp. 263–297.
27. G. T. Leavens, “Modular specification and verification of object-oriented programs.” IEEE Software, vol. 8, pp. 72–80, July 1991.
28. B. Liskov and J. M. Wing, “Family values: A semantic notion of subtyping,” typing,” Tech. Rep. LCS—TR-562, Mass. Inst. of Technol., Cambridge, MA, 1992.
29. M. Wang, “A new incompleteness result for Hoare's system,” JACM, vol. 25, pp. 168–175, 1980.
30. W. A. Wulf, R. L. London, and M. Shaw, “An introduction to the construction and verification of Alphard programs,” IEEE Trans. Software Eng., vol. 2, pp. 253–265, 1976.
31. R. T. Yeh, “Verification of programs by predicate transformation,” in Current Trends in Programming Methodology, vol. 1. R. T. Yeh, ed. Englewood Cliffs, NJ: Prentice-Hall, 1978, pp. 228–247.