LEADER 03966nam 22008055 450 001 996465866903316 005 20230220141543.0 010 $a1-280-86484-2 010 $a9786610864843 010 $a3-540-71410-3 024 7 $a10.1007/978-3-540-71410-1 035 $a(CKB)1000000000284119 035 $a(SSID)ssj0000301961 035 $a(PQKBManifestationID)11251738 035 $a(PQKBTitleCode)TC0000301961 035 $a(PQKBWorkID)10265126 035 $a(PQKB)10742027 035 $a(DE-He213)978-3-540-71410-1 035 $a(MiAaPQ)EBC3061512 035 $a(MiAaPQ)EBC6806111 035 $a(Au-PeEL)EBL6806111 035 $a(OCoLC)185026835 035 $a(PPN)123161177 035 $a(EXLCZ)991000000000284119 100 $a20100301d2007 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] $e16th International Symposium, LOPSTR 2006, Venice, Italy, July 12-14, 2006, Revised Selected Papers /$fedited by Germán Puebla 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (VIII, 240 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4407 300 $aIncludes index. 311 $a3-540-71409-X 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- How to Talk to a Human: The Semantic Web and the Clash of the Titans -- CHESS: Systematic Stress Testing of Concurrent Software -- Program Development -- ARM: Automatic Rule Miner -- Constructing Consensus Logic Programs -- Partial Evaluation and Program Transformation -- Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques -- Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs -- Towards Description and Optimization of Abstract Machines in an Extension of Prolog -- Security and Synthesis -- Combining Different Proof Techniques for Verifying Information Flow Security -- On the Automated Synthesis of Proof-Carrying Temporal Reference Monitors -- Synthesis of Asynchronous Systems -- Debugging and Testing -- A Comparative Study of Algorithmic Debugging Strategies -- A Program Transformation for Tracing Functional Logic Computations -- Termination and Analysis -- Automated Termination Analysis for Logic Programs by Term Rewriting -- Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator -- Polytool: Proving Termination Automatically Based on Polynomial Interpretations -- Grids: A Domain for Analyzing the Distribution of Numerical Values. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4407 606 $aSoftware engineering 606 $aComputer science 606 $aComputer programming 606 $aMachine theory 606 $aArtificial intelligence 606 $aSoftware Engineering 606 $aComputer Science Logic and Foundations of Programming 606 $aProgramming Techniques 606 $aFormal Languages and Automata Theory 606 $aArtificial Intelligence 615 0$aSoftware engineering. 615 0$aComputer science. 615 0$aComputer programming. 615 0$aMachine theory. 615 0$aArtificial intelligence. 615 14$aSoftware Engineering. 615 24$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 702 $aPuebla$b Germa?n 712 12$aLOPSTR (Symposium) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465866903316 996 $aLogic-Based Program Synthesis and Transformation$92914320 997 $aUNISA