META-AMPHION: Synthesis of Efficient Domain-Specific Program Synthesis Systems

Automated Software Engineering

Volumn 4, Issue 2, 1997, Pages 199-241

  Lowry, Michael R ^a   Van Baalen, Jeffrey ^b  

^a NASA AMES RESEARCH CENTER   (United States)

^b UNIVERSITY OF WYOMING   (United States)

Author keywords

Automatic decision procedure selection; Decision procedures to accelerate reasoning; Deductive synthesis

Indexed keywords

COMPUTER APPLICATIONS; COMPUTER PROGRAMMING LANGUAGES; KNOWLEDGE BASED SYSTEMS; PROGRAM COMPILERS; REPORT GENERATORS; THEOREM PROVING;

DECLARATIVE DOMAIN THEORY; KNOWLEDGE BASED SOFTWARE ENGINEERING SYSTEM; META AMPHION; PROGRAM SYNTHESIS SYSTEMS; SOFTWARE COMPONENT LIBRARIES;

SOFTWARE ENGINEERING;

EID: 0031126206     PISSN: 09288910     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008637201658     Document Type: Article

References (16)

1. Cleaveland, J.C. and Kintala, C. 1988. Tools for building application generators. AT&T Technical Journal, 67(4):46-58.
2. Gallier, J.H. 1986. Logic for Computer Science, Foundations of Automatic Theorem Proving. Harper & Row.
3. Giunchigliam, R, Pecchiari, P., and Talcott, C. 1994. Reasoning theories: Towards an architecture for open mechanized reasoning systems. Stanford CS Technical Report CS-TN-94-15.
4. Hoare, C.A.R. 1973. Proof of correctness of data representations. Acta Informatica, 271-281.
5. Jullig, R. and Srinivas, Y.V. 1993. Diagrams for Software Synthesis. KBSE.
6. Lowry, M., Philpot, A., Pressburger, T, and Underwood, I. 1994. A Formal Approach to Domain-Oriented Software Design Environments, KBSE.
7. Manna, Z. and Waldinger, R. 1992. Fundamentals of deductive program synthesis. IEEE Transactions on Software Engineering, 8(18):674-704.
8. Nelson, G. 1984. Combining satisfiability procedures by equality sharing. In Bledsoe and Loveland editors, Automated Theorem Proving after 25 Years, American Mathematical Society.
9. Reyes, A.A. 1996. An approach to automatic generation of domain theories from intuitive, semiformal domain models. Proceedings of the California Software Symposium CSS'96, W. Scacchi and R. Taylor, editors, University of California, Los Angeles, CA.
10. Smith, D.R. 1993. Classification approach to design. Kestrel Institute Technical Report.
11. Smith, D.R. and Lowry, M.R. 1990. Algorithm theories and design tactics. Science of Computer Programming, 14:305-321.
12. Stickel, M. 1985. Automated deduction by theory resolution. Automated Reasoning, 1:333-355.
13. Stickel, M., Waldinger, R., Lowry, M., Pressburger, T, and Underwood, I. 1994. Deductive composition of astronomical software from subroutine libraries. CADE-12.
14. Tyugu, E.H. 1988. Knowledge-Based Programming, Turing Institute Press, Glasgow, Scotland.
15. Van Baalen, J. 1991. The completeness of DRAT, a technique for automatic design of satisfiability procedures. International Conference of Knowledge Representation and Reasoning.
16. Van Baalen, J. 1992. Automated design of specialized representations. Artificial Intelligence, 54.