Derived preconditions and their use in program synthesis
Identifieur interne : 004361 ( Main/Merge ); précédent : 004360; suivant : 004362Derived preconditions and their use in program synthesis
Auteurs : R. Smith [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1982.
Abstract
Abstract: In this paper we pose and begin to explore a deductive problem more general than that of finding a proof that a given goal formula logically follows from a given set of hypotheses. The problem is most simply stated in the propositional calculus: given a goal A and hypothesis H we wish to find a formula P, called a precondition, such that A logically follows from P ∧ H. A precondition provides any additional conditions under which A can be shown to follow from H. A slightly more complex definition of preconditions in a first-order theory is given and used throughout the paper. A formal system based on natural deduction is presented in which preconditions can be derived. A number of examples are then given which show how derived preconditions are used in a program synthesis method we are developing. These uses include theorem proving, formula simplification, simple code generation, the completion of partial specifications for a subalgorithm, and other tasks of a deductive nature.
Url:
DOI: 10.1007/BFb0000059
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002A80
- to stream Istex, to step Curation: 002869
- to stream Istex, to step Checkpoint: 003308
Links to Exploration step
ISTEX:6B63D41968FFC10EE987372D50A6CB0E02B55305Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Derived preconditions and their use in program synthesis</title><author><name sortKey="Smith, R" sort="Smith, R" uniqKey="Smith R" first="R." last="Smith">R. Smith</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:6B63D41968FFC10EE987372D50A6CB0E02B55305</idno><date when="1982" year="1982">1982</date><idno type="doi">10.1007/BFb0000059</idno><idno type="url">https://api.istex.fr/document/6B63D41968FFC10EE987372D50A6CB0E02B55305/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002A80</idno><idno type="wicri:Area/Istex/Curation">002869</idno><idno type="wicri:Area/Istex/Checkpoint">003308</idno><idno type="wicri:doubleKey">0302-9743:1982:Smith R:derived:preconditions:and</idno><idno type="wicri:Area/Main/Merge">004361</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Derived preconditions and their use in program synthesis</title><author><name sortKey="Smith, R" sort="Smith, R" uniqKey="Smith R" first="R." last="Smith">R. Smith</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, Naval Postgraduate School, 93940, Monterey, California</wicri:regionArea><placeName><region type="state">Californie</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1982</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">6B63D41968FFC10EE987372D50A6CB0E02B55305</idno><idno type="DOI">10.1007/BFb0000059</idno><idno type="ChapterID">11</idno><idno type="ChapterID">Chap11</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this paper we pose and begin to explore a deductive problem more general than that of finding a proof that a given goal formula logically follows from a given set of hypotheses. The problem is most simply stated in the propositional calculus: given a goal A and hypothesis H we wish to find a formula P, called a precondition, such that A logically follows from P ∧ H. A precondition provides any additional conditions under which A can be shown to follow from H. A slightly more complex definition of preconditions in a first-order theory is given and used throughout the paper. A formal system based on natural deduction is presented in which preconditions can be derived. A number of examples are then given which show how derived preconditions are used in a program synthesis method we are developing. These uses include theorem proving, formula simplification, simple code generation, the completion of partial specifications for a subalgorithm, and other tasks of a deductive nature.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004361 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 004361 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:6B63D41968FFC10EE987372D50A6CB0E02B55305
|texte= Derived preconditions and their use in program synthesis
}}
| This area was generated with Dilib version V0.6.32. |  |