Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis

ISSN： 0928-8910

Source： Automated Software Engineering, Vol.13, Iss.1, 2006-01, pp. : 65-105

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm

By Armando A.

Automated Software Engineering, Vol. 6, Iss. 4, 1999-10 ,pp. : 329-356

Springer Publishing Company

Access to resources Recommend Favorite

Predicate Synthesis for Correcting Faulty Conjectures: The Proof Planning Paradigm

By Monroy R.

Automated Software Engineering, Vol. 10, Iss. 3, 2003-07 ,pp. : 247-269

Springer Publishing Company

Access to resources Recommend Favorite

Logic Program Synthesis as Problem Reduction Using Combining Forms

By Hamfelt A.

Automated Software Engineering, Vol. 8, Iss. 2, 2001-04 ,pp. : 167-193

Springer Publishing Company

Access to resources Recommend Favorite

Constraint Solving for Proof Planning

By Zimmer Jürgen Melis Erica

Journal of Automated Reasoning, Vol. 33, Iss. 1, 2004-07 ,pp. : 51-88

Springer Publishing Company

Access to resources Recommend Favorite

Combining Program and Data Specialization

By Chirokoff S.

LISP and Symbolic Computation, Vol. 12, Iss. 4, 1999-12 ,pp. : 309-335

Springer Publishing Company

Access to resources Recommend Favorite