Perfect model checking via unfold/fold transformations

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1861, Issue , 2000, Pages 613-628

  Pettorossi, Alberto ^a   Proietti, Maurizio ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION PROCEDURE; FIRST-ORDER FORMULAS; LOGIC PROGRAMS; PERFECT MODEL; PROGRAM TRANSFORMATION TECHNIQUES; PROGRAM TRANSFORMATIONS; STRATIFIED NEGATION;

MODEL CHECKING;

LOGIC PROGRAMMING;

EID: 4444258030     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_41     Document Type: Conference Paper

References (20)

1. K. R. Apt,R. N. Bol Logic programming and negation: A survey Journal of Logic Programming 19, 20, 9-71, 1994.
2. R.S. Boyer and J.S.Moore. AComputationalLogic.Academic Press,NewYork, 1979.
3. S. Brass and J. Dix. Semantics of (disjunctive) logic programs based on partial evaluation. Journal of Logic Programming, 40:1-46, 1999.
4. R. M. Burstall and J. Darlington. A transformation system for developing recursive programs. JACM, 24(1):44-67, January 1977.
5. W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. JACM, 43(1), 1996.
6. K. L. Clark. Negation as failure. In H. Gallaire and J. Minker (eds.) Logic and Data Bases, 293-322. Plenum Press, New York, 1978.
7. H. Comon and R. Nieuwenhuis. Induction = I-Axiomatization + first-order consis-tency. Information and Computation. (To appear
8. B. Courcelle. Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and Grammars. Theo. Comp. Sci., 42:1-122, 1986.
9. E. A. Emerson. Temporal and modal logic. In J. Van Leuveen (ed.) Handbook of Theoretical Computer Science, volume B, 997-1072. Elsevier, 1990.
10. J. Engelfriet. Tree Automata and Tree Grammars. DAIMI FN-10, Department of Computer Science, University of Aarhus, Denmark, April 1975.
11. L. Kott. Unfold/fold program transformation. In M. Nivat and J.C. Reynolds (eds.) Algebraic Methods in Semantics, 411-434. Cambridge University Press, 1985.
12. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987. 2nd Ed.
13. A. Pettorossi and M. Proietti. Synthesis and transformation of logic programs using unfold/fold proofs. Journal of Logic Programming, 41(2&3):197-230, 1999.
14. M. Proietti and A.Pettorossi. Unfolding-de-nition-folding, in this order, for avoid-ing unnecessary variables in logic programs. Theo.Comp. Sci.,142(1):89-124, 1995.
15. T. C. P rzymusinski. On the declarative and procedural semantics of logic programs. Journal of Automated Reasoning, 5:167-205, 1989.
16. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1-34, July 1969.
17. A. Roychoudhury, K. Narayan Kumar, C.R. Ramakrishnan, I.V. Ramakrishnan, and S. A. Smolka. Verification of parametrized systems using logic program trans-formations. In Proc. TACAS 2000, LNCS 1785, 172-187. Springer, 2000.
18. Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Efficient model checking using tabled resolution. In Proc. CAV '97, LNCS 1254, 143-154. Springer, 1997.
19. H. Seki. Unfold/fold transformation of strati-ed programs. Theo. Comp. Sci., 86:107-139, 1991.
20. H. Tamaki and T. Sato. Unfold/fold transformation of logic programs. In Proceed-ings of ICLP'84, 127-138. Uppsala University, Sweden, 1984.