000 | 03300nam a22005535i 4500 | ||
---|---|---|---|
001 | 978-3-540-31683-1 | ||
003 | DE-He213 | ||
005 | 20240730193607.0 | ||
007 | cr nn 008mamaa | ||
008 | 100718s2005 gw | s |||| 0|eng d | ||
020 |
_a9783540316831 _9978-3-540-31683-1 |
||
024 | 7 |
_a10.1007/b137785 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aLogic Based Program Synthesis and Transformation _h[electronic resource] : _b14th International Symposium, LOPSTR 2004, Verona, Italy, August 26-28, 2004, Revised Selected Papers / _cedited by Sandro Etalle. |
250 | _a1st ed. 2005. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2005. |
|
300 |
_aVIII, 284 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3573 |
|
505 | 0 | _aVerification and Analysis -- Searching Semantically Equivalent Code Fragments in Logic Programs -- Determinacy Analysis for Logic Programs Using Mode and Type Information -- Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs -- Fully Automatic Binding-Time Analysis for Prolog -- Theory and Security -- Logical Mobility and Locality Types -- Unwinding Conditions for Security in Imperative Languages -- Natural Rewriting for General Term Rewriting Systems -- Transformations -- Negation Elimination for Finite PCFGs -- Specialization of Concurrent Guarded Multi-set Transformation Rules -- Efficient Local Unfolding with Ancestor Stacks for Full Prolog -- Program Development -- Schema-Guided Synthesis of Imperative Programs by Constraint Solving -- Run-Time Profiling of Functional Logic Programs -- Constructive Specifications for Compositional Units -- Termination -- Input-Termination of Logic Programs -- On Termination of Binary CLP Programs -- Program Development and Synthesis -- From Natural Semantics to Abstract Machines -- Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis. | |
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aComputer programming. _94169 |
|
650 | 0 |
_aMachine theory. _9153960 |
|
650 | 0 |
_aArtificial intelligence. _93407 |
|
650 | 1 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
650 | 2 | 4 |
_aProgramming Techniques. _9153961 |
650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9153962 |
650 | 2 | 4 |
_aArtificial Intelligence. _93407 |
700 | 1 |
_aEtalle, Sandro. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9153963 |
|
710 | 2 |
_aSpringerLink (Online service) _9153964 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540266556 |
776 | 0 | 8 |
_iPrinted edition: _z9783540812579 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3573 _9153965 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b137785 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c94790 _d94790 |