Name
Abstract | ||
|---|---|---|
Among the several misunderstandings about Program Synthesis (PS), we particularly examine the one relative to Logic Programming alleged to have solve this problem. Even though theoretical reasons are well-known, we provide a detailed analysis of the practical reasons why a formal specification may be hard to program in PROLOG. All that contributes to the clarification of the exact role of PS in AI and in Software Engineering, and its possible application to software certification. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1007/3-540-51734-0_51 | AII |
Keywords | Field | DocType |
certification cycle table of contents:,inductive theorem proving,program synthesis from formal specifications,program synthesis,practical reasoning,theorem proving,table of contents,software engineering,formal specification | Inductive theorem proving,Programming language,Software certification,Program synthesis,Computer science,Formal specification,Prolog,Formal methods,Logic programming,Formal verification | Conference |
Volume | ISBN | Citations |
397 | 3-540-51734-0 | 1 |
PageRank | References | Authors |
0.39 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yves Kodratoff | 1 | 581 | 172.25 |
| Marta Franová | 2 | 22 | 5.53 |
| Derek Partridge | 3 | 9 | 3.85 |