Specification-based automatic verification of Prolog programs-Reference-Cited by-同舟云学术

Specification-based automatic verification of Prolog programs

Published:1997 Issue: Volume: Page:38-57
ISSN:0302-9743
Container-title:Logic Program Synthesis and Transformation
language:
Short-container-title:

Author:

Cortesi Agostino,Charlier Baudouin,Rossi Sabina

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-62718-9_3.pdf

Reference19 articles.

1. A. Bossi, N. Cocco, and M. Fabris. Norms on Terms and Their Use in Proving Universal Termination of a Logic Program, Theoretical Computer Science, 124:297–328, 1994.

2. C. Braem, B. Le Charlier, S. Modart, and P. Van Hentenryck. Cardinality Analysis of Prolog. In Proc. Int'l Logic Programming Symposium, (ILPS'94), Ithaca, NY. The MIT Press, Cambridge, Mass., 1994.

3. K.L. Clark. Negation as Failure. In H. Gallaire and J. Minker editors, Advances in Data Base Theory, Plenum Press, New York, pp. 293–322, 1978.

4. J. Cohen and J. Katcoff. Symbolic solution of finite-difference equations. ACM Transactions on Mathematical Software, 3(3):261–271, 1977.

5. A. Cortesi, B. Le Charlier and P. van Hentenryck, Conceptual and Software Support for Abstract Domain Design: Generic Structural Domain and Open Product. Technical Report CS-93-13, Brown University, 1993.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Finite-tree analysis for constraint logic-based languages;Information and Computation;2004-09

2. Logic for Component-Based Software Development;Computational Logic: Logic Programming and Beyond;2002

3. Abstract Interpretation based Verification of Logic Programs;Electronic Notes in Theoretical Computer Science;1999

4. Automatic Verification Based on Abstract Interpretation;Functional and Logic Programming;1999

5. Generalised Logic Program Transformation Schemas;Logic Program Synthesis and Transformation;1998