Incorporating decision procedures in implicit induction

Journal of Symbolic Computation

Volumn 34, Issue 4, 2002, Pages 241-258

  Armando, Alessandro ^a   Rusinowitch, Michaël ^b   Stratulat, Sorin ^c  

^a UNIVERSITY OF GENOA   (Italy)

^b LORIA   (France)

^c INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036801418     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.2002.0549     Document Type: Article

References (31)

1. Armando, A., Ranise, S. (1998). Constraint contextual rewriting. In Caferra, R., Salzer, G. eds, Proceedings of the 2nd International Workshop on First Order Theorem Proving (FTP'98) (Vienna, Austria, November 23-25, 1998), pp. 65-75.
2. Armando, A., Ranise, S. (2000). Termination of constraint contextual rewriting. In Proceedings of the 3rd International Workshop on Frontiers of Combining Systems (FroCoS'2000), LNAI 1794, pp. 47-61. Nancy, France.
3. Armando, A., Ranise, S., Rusinowitch, M. (2001). Uniform derivation of decision procedures by superposition. In Proceedings on the Annual Conference on Computer Science Logic (CSL01), LNCS 2142, pp. 513-527. Springer.
4. Berregeb, N., Bouhoula, A., Rusinowitch, M. (1996). Automated verification by induction with associative-commutative operators. In Proceedings of the 8th International Conference on Computer Aided Verification, LNCS 1102, pp. 220-231. New Jersey, USA.
5. Bjørner, N. (1998). Private communication.
6. Bjørner et al., N. (1995). STeP. The Stanford Temporal Prover, version 1.0.
7. Bouhoula, A. (1997). Automated theorem proving by test set induction. J. Symb. Comput., 23, 47-78, ISSN 0747-7171.
8. Bouhoula, A., Rusinowitch, M. (1995). Implicit induction in conditional theories. J. Autom. Reasoning, 14, 189-235.
9. Boyer, R. S., Moore, J. S. (1979). A Computational Logic. New York, Academic Press.
10. Boyer, R. S., Moore, J. S. (1985). Integrating decision procedures into heuristic theorem provers: a case study with linear arithmetic. ICSCA-CMP-44. University of Texas at Austin, Also published in Machine Intelligence, volume 11. Oxford University Press, 1988
11. Boyer, R. S., Moore, J S. (1991). MJRTY-a fast majority vote algorithm. In Boyer, R. S. ed., Automated Reasoning: Essays in Honor of Woody Bledsoe, volume 1 of Automated Reasoning, pp. 105-117. Kluwer Academic Publishers.
12. Buchberger, B. (1965). Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach cinem nulldimensionalen Polynomideal. Ph.D. Thesis, Philosophische Fakultät an der Leopold-Franzens-Universität, Insbruck, Austria.
13. Buchberger, B., Winkler, F. (eds) (1998). Gröbner Bases and Applications. Cambridge University Press.
14. Dershowitz, N., Jouannaud, J. P. (1990a). Rewrite systems. In Formal Methods and Semantics of Handbook of Theoretical Computer Science, volume B, chapter 6, pp. 243-320. Amsterdam, North-Holland.
15. Dershowitz, N., Jouannaud, J. P. (1990b). Rewriting systems. In Handbook of Theoretical Computer Science, pp. 243-320. Amsterdam, Elsevier Publishers.
16. Howe, D. J. (1993). Reasoning about functional programs in Nuprl. In Functional Programming, Concurrency, Simulation and Reasoning, LNCS 693, pp. 145-164.
17. Huet, G., Lankford, D. S. (1978). On the uniform halting problem for term rewriting systems. Technical Report 283, Laboria, France.
18. Jackson, P. B. (1994). The Nuprl Proof Development System, version 4.1. Reference Manual and User's Guide, Cornell University.
19. Jaffar, J., Lassez, J.-L. (1987). Constraint logic programming. In Proceedings of the 14th ACM Symposium on Principles of Programming Languages, pp. 111-119.
20. Kamin, S., Lévy, J.-J. (1980). Two generalizations of the recursive path ordering. Unpublished note. Department of Computer Science, University of Illinois, Urbana, IL.
21. Lassez, J.-L., Maher, M. J. (1992). On Fourier's algorithm's for linear arithmetic constraints. J. Autom. Reasoning, 9, 373-379.
22. Naidich, D. (1996). On generic representation of implicit induction procedures. Technical Report CS-R9620, CWI.
23. Nelson, G., Oppen, D. C. (1978). Simplification by cooperating decision procedures. Technical Report STAN-CS-78-652, Stanford Computer Science Department.
24. Owre, S., Rushby, J. M., Shankar, N. (1992). PVS: a prototype verification system: In Kapur, D. ed., 11th International Conference on Automated Deduction (CADE) LNAI 607, pp. 748-752. Springer.
25. Rusinowitch, M., Stratulat, S., Klay, F. (2000). Mechanical verification of an ideal incremental ABR conformance algorithm. In Emerson, E. A., Sistla, A. P. eds, Proceedings of 12th International Conference on Computer Aided Verification (CAV'2000), LNCS 1855, pp. 344-357. Springer.
26. Stratulat, S. (1998). Applying semantic subsumption rules in the context of inductive proofs. In Workshop on Integration of Deductive Systems, CADE-15, pp. 85-95.
27. Stratulat, S. (2000). Preuves par récurrence avec ensembles couvrants contextuels. Applications à la vérification de logiciels de télécommunications. Ph.D. Thesis, Université Henri Poincaré, Nancy I.
28. Stratulat, S. (2001). A general framework to build contextual cover set induction provers. J. Symb. Comput., 32, 403-445.
29. von zur Gathen, J., Gerhard, J. (1999). Modern Computer Algebra. Cambridge University Press.
30. Zhang, H. (1995). Contextual rewriting in automated reasoning. Fundam. Inform., 24, 107-123.
31. Zhang, H., Remy, J. L. (1985). Contextual rewriting. In Jouannaud, J.-P. ed., Proceedings of the 1st International Conference on Rewriting Techniques and Applications, LNCS 202, pp. 46-62. Dijon, France, Springer, ISBN 3-540-15976-2.