Debugging Larch Shared Language Specifications

IEEE Transactions on Software Engineering

Volumn 16, Issue 9, 1990, Pages 1044-1057

  Garland, Stephen J ^a   Guttag, John V ^a   Horning, James J ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

Formal specifications; Larch; programming; theorem proving; validation

Indexed keywords

COMPUTER PROGRAMMING--PROGRAM DEBUGGING;

CONCURRENT PROGRAMMING; FORMAL SPECIFICATIONS; SOFTWARE DEVELOPMENT;

COMPUTER SOFTWARE;

EID: 0025488754     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.58789     Document Type: Article

References (19)

1. R. S. Boyer and J. S. Moore, A Computational Logic. New York: Academic, 1979.
2. A Computational Logic Handbook. New York: Academic, 1988.
3. R. M. Burstall and J. A. Goguen, “Putting theories together to make specifications,” in Proc. Fifth Int. Joint Conf. Artificial Intelligence, 1977, pp. 1045–1058.
4. S. J. Garland and J. V. Guttag, “Inductive methods for reasoning about abstract data types,” in Proc. 15th ACM Conf. Principles of Programming Languages, 1988, pp. 219–228.
5. “An overview of LP, the Larch Prover,” in Proc. Third Int. Conf. Rewriting Techniques and Applications (Lecture Notes in Computer Science, vol. 355), Chapel Hill, NC. New York: Springer-Verlag, 1989, pp. 137–151.
6. S. J. Garland, J. V. Guttag, and J. Staunstrup, “Verification of VLSI circuits using LP,” in Proc. IF1P WG 10.2 Conf. Fusion of Hardware Design and Verification. Amsterdam, The Netherlands: North-Holland, 1988, pp. 329–345.
7. S. J. Garland and J. V. Guttag, “Using LP to debug specifications,” in Proc. IFIP TC2/WG2.2/WG2.3 Working Conf. Programming Concepts and Methods. New York: Elsevier, 1990.
8. J. V. Guttag and J. J. Horning, “Formal specification as a design tool,” in Proc. 7th ACM Svmp. Principles of Programming Languages, 1980, pp. 251–261.
9. “Report on the Larch Shared Language,” Sci. Comput. Programming., vol. 6, no. 2, pp. 103–134, Mar. 1986.
10. “A Larch shared language handbook,” Sci. Comput. Program., vol. 6, no. 2, pp. 135–157, Mar. 1986 (revision to appear).
11. J. V. Guttag, J. J. Horning, and A. Modet, “Revised report on the Larch Shared Language,” Digital Equipment Corp. Systems Research Center, Rep. 58, 1990.
12. J. V. Guttag, J. J. Horning, and J. M. Wing, “An overview of the Larch family of specification languages,” IEEE Software, vol. 2, no. 5, pp. 24–36, Sept. 1985.
13. D. E. Knuth and P. B. Bendix, “Simple word problems in universal algebras,” in Computational Problems in Abstract Algebra, J. Leech, Ed. Oxford, England: Pergamon, 1969, pp. 263–297.
14. D. A. McAllester, Ontic: A Knowledge Representation System for Mathematics. Cambridge, MA: MIT Press, 1989.
15. L. C. Paulson, Logic and Computation: Interactive Proof with Cambridge LCF. Cambridge, England: Cambridge University Press. 1987.
16. G. L. Peterson and M. E. Stickel, “Complete sets of reductions for some equational theories,” J. ACM, vol. 28, no. 2, pp. 233–264, Apr. 1981.
17. D. Sannella and A. Tarlecki, “On observational equivalence and algebraic specification,” in Mathematical Foundations of Software Development (Lecture Notes in Computer Science, vol. 186), 1985, pp. 308–322.
18. J. R. Shoenfield, Mathematical Logic. Reading, MA: Addison-Wesley, 1967.
19. J. Staunstrup, S. J. Garland, and J. V. Guttag, “Localized verification of circuit descriptions,” in Proc. Int. Workshop Automatic Verification Methods for Finite Stale Systems (Lecture Notes in Computer Science, vol. 407), Grenoble, France. New York: Springer-Verlag, pp. 349–364.