LEADER 05963nam 22007815 450 001 996466230103316 005 20200706134354.0 010 $a1-280-30782-X 010 $a9786610307821 010 $a3-540-25938-4 024 7 $a10.1007/b98080 035 $a(CKB)1000000000212408 035 $a(SSID)ssj0000193846 035 $a(PQKBManifestationID)11156933 035 $a(PQKBTitleCode)TC0000193846 035 $a(PQKBWorkID)10246396 035 $a(PQKB)11664821 035 $a(DE-He213)978-3-540-25938-1 035 $a(MiAaPQ)EBC3088634 035 $a(PPN)15521960X 035 $a(EXLCZ)991000000000212408 100 $a20121227d2004 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] $e13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers /$fedited by Maurice Bruynooghe 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (X, 238 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v3018 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-22174-3 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talk -- Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce -- Specification and Synthesis -- Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures -- Correct OO Systems in Computational Logic -- Specification and Synthesis of Hybrid Automata for Physics-Based Animation -- Adding Concrete Syntax to a Prolog-Based Program Synthesis System -- Verification -- Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables -- Formal Reasoning about Efficient Data Structures: A Case Study in ACL2 -- Analysis -- A Program Transformation for Backwards Analysis of Logic Programs -- An Efficient Staging Algorithm for Binding-Time Analysis -- Proving Termination with Adornments -- Transformation and Specialisation -- Constructively Characterizing Fold and Unfold -- Deterministic Higher-Order Patterns for Program Transformation -- From Interpreter to Logic Engine by Defunctionalization -- Linearization by Program Transformation -- Continuation Semantics as Horn Clauses -- Constraints -- Simplification of Database Integrity Constraints Revisited: A Transformational Approach -- Integration and Optimization of Rule-Based Constraint Solvers -- Introducing esra, a Relational Language for Modelling Combinatorial Problems. 330 $aThis volume contains selected papers from LOPSTR 2003, the 13th Inter- tional Symposium on Logic-Based Program Synthesis and Transformation. The LOPSTR series is devoted to research in logic-based program development. P- ticular topics of interest are speci?cation, synthesis, veri?cation, transformation, specialization, analysis, optimization, composition, reuse, component-based so- ware development, agent-based software development, software architectures, design patterns and frameworks, program re?nement and logics for re?nement, proofs as programs, and applications and tools. LOPSTR 2003 took place at the University of Uppsala from August 25 to August 27 as part of PLI 2003 (Principles, Logics, and Implementations of High- Level Programming Languages). PLI was an ACM-organized confederation of conferences and workshops with ICFP 2003 (ACM-SIGPLAN International C- ference on Functional Programming) and PPDP 2003 (ACM-SIGPLAN Inter- tional Conference on Principles and Practice of Declarative Programming) as the main events. The LOPSTR community pro?ted from the shared lectures of the invited speakers, and the active scienti?c discussions enabled by the co-location. LOPSTR 2003 was the thirteenth in a series of events. Past events were held in Manchester, UK (1991, 1992, 1998), Louvain-la-Neuve, Belgium (1993), Pisa, Italy (1994), Arnhem, The Netherlands (1995), Stockholm, Sweden (1996), L- ven, Belgium (1997), Venice, Italy (1999), London, UK (2000), Paphos, Cyprus (2001), and Madrid, Spain (2002). 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v3018 606 $aSoftware engineering 606 $aComputer logic 606 $aComputer programming 606 $aMathematical logic 606 $aArtificial intelligence 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 615 0$aSoftware engineering. 615 0$aComputer logic. 615 0$aComputer programming. 615 0$aMathematical logic. 615 0$aArtificial intelligence. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aLogics and Meanings of Programs. 615 24$aProgramming Techniques. 615 24$aMathematical Logic and Formal Languages. 615 24$aArtificial Intelligence. 676 $a005.115 702 $aBruynooghe$b Maurice$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aLOPSTR (Symposium) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466230103316 996 $aLogic Based Program Synthesis and Transformation$9772041 997 $aUNISA