LEADER 03545nam 22006495 450 001 996465823203316 005 20230406001310.0 024 7 $a10.1007/b137785 035 $a(CKB)1000000000213092 035 $a(SSID)ssj0000318693 035 $a(PQKBManifestationID)11923603 035 $a(PQKBTitleCode)TC0000318693 035 $a(PQKBWorkID)10311014 035 $a(PQKB)11296123 035 $a(DE-He213)978-3-540-31683-1 035 $a(MiAaPQ)EBC3067622 035 $a(PPN)123095859 035 $a(EXLCZ)991000000000213092 100 $a20100718d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLogic Based Program Synthesis and Transformation$b[electronic resource] $e14th International Symposium, LOPSTR 2004, Verona, Italy, August 26-28, 2004, Revised Selected Papers /$fedited by Sandro Etalle 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (VIII, 284 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3573 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$aPrinted edition: 9783540266556 320 $aIncludes bibliographical references and index. 327 $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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3573 606 $aComputer science 606 $aComputer programming 606 $aMachine theory 606 $aArtificial intelligence 606 $aComputer Science Logic and Foundations of Programming 606 $aProgramming Techniques 606 $aFormal Languages and Automata Theory 606 $aArtificial Intelligence 615 0$aComputer science. 615 0$aComputer programming. 615 0$aMachine theory. 615 0$aArtificial intelligence. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aProgramming Techniques. 615 24$aFormal Languages and Automata Theory. 615 24$aArtificial Intelligence. 676 $a005.1/15 702 $aEtalle$b Sandro$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aLOPSTR (Symposium) 906 $aBOOK 912 $a996465823203316 996 $aLogic-Based Program Synthesis and Transformation$92914320 997 $aUNISA