Using decision procedures to accelerate domain-specific deductive synthesis systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1559, Issue , 1998, Pages 61-80

  Van Baalen, Jeffrey ^a   Roach, Steven ^a  

^a NASA AMES RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; OPEN SYSTEMS; SYNTHESIS (CHEMICAL);

DECISION PROCEDURE; DEDUCTIVE SYNTHESIS; DOMAIN SPECIFIC; THEOREM PROVERS;

THEOREM PROVING;

EID: 84947945564     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. Baader, F. & Tinelli, C., “A New Approach for Combining Decision Procedures for the Word Problem, and its Connection to the Nelson-Oppen Combination Method,” CADE14, pp. 19-33,1997.
2. R. Boyer and Moore, J, Integrating Decision Procedures into Heuristic Theorem Provers: A Case Study of Linear Arithmetic, Institute for Computing Science and Computer Applications, University of Texas as Austin, 1988.
3. Burckert, H. J., “A Resolution Principle for a Logic With Restricted Quantifiers,” Lecture Notes in Artificial Intelligence, Vol. 568, Springer-Verlag, 1991.
4. Chang, C & Lee, R.C., Symbolic Logic and Mechanical Theorem Proving, Academ ic Press, New York, 1973.
5. Cyrluk, D., Lincoln, P., Shankar, N. “On Shostak’s decision procedures for combinations of theories,” Automated Deduction-CADE-13 in Lecture Notes in AI 1104, (M. A. McRobbie and J. K. Slaney Eds), Springer, pp. 463-477, 1996.
6. Deville, Y. and Lau, K., “Logic Program Synthesis,” Journal of Logic Programming, 19, 20: 321-350, 1994.
7. Dunham, B. and North, J., “Theorem Testing by Computer,” Proceedings of the Symposium on Mathematical Theory of Automata, Polytechnic Press, Brooklyn, N. Y, pp. 173-177, 1963.
8. Gallier, J. H., Logic for Computer Science: Foundations of Automatic Theorem Proving, Harper and Row, 1986.
9. C.A.R. Hoare, “Proof of Correctness of Data Representations,” Acta Infomatica, Vol. 1, pp. 271-281, 1973.
10. M. Lowry and J. Van Baalen, “META-Amphion: Synthesis of Efficient Domain-Specific Program Synthesis Systems”, Automated Software Engineering, vol 4, pp. 199-241, 1997.
11. Nelson, G., and Oppen, D., “Simplification By Cooperating Decision Procedures,” ACM Transactions on Programming Languages and Systems, No. 1, pp. 245-257, 1979.
12. Nelson, G., and Oppen, D., “Fast decision procedures based on congruence closure,” Journal of the ACM, 27, 2, pp. 356-364, 1980.
13. Owre, S., Rushby, M., and Shankar, N., “PVS: A Prototype Verification System,” CADE-11, LNAI Vol. 607, pp. 748-752, 1992.
14. Roach, S., “TOPS: Theory Operationalization for Program Synthesis,” Ph.D. Thesis at University of Wyoming, 1997.
15. Shostak, R., “A practical decision procedure for arithmetic with function symbols,” Journal of the ACM, Vol. 26, pp. 351-360, 1979.
16. Shostak, R., “Deciding Combinations of Theories,” Journal of the ACM, Vol. 31, pp. 1-12, 1984.
17. M. Stickel, R. Waldinger, M. Lowry, T. Pressburger, and I. Underwood, “Deductive Composition of Astronomical Software from Subroutine Libraries,” CADE-12, 1994. See http://ic-www.arc.nasa.gov/ic/projects/amphion/docs/ amphion.html