|
|
|
|
| LEADER |
03105nam a22005535i 4500 |
| 001 |
978-3-540-31683-1 |
| 003 |
DE-He213 |
| 005 |
20151204174346.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100718s2005 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540316831
|9 978-3-540-31683-1
|
| 024 |
7 |
|
|a 10.1007/b137785
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.L63
|
| 050 |
|
4 |
|a QA76.5913
|
| 050 |
|
4 |
|a QA76.63
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a UYF
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 072 |
|
7 |
|a COM036000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1015113
|2 23
|
| 245 |
1 |
0 |
|a Logic Based Program Synthesis and Transformation
|h [electronic resource] :
|b 14th International Symposium, LOPSTR 2004, Verona, Italy, August 26 – 28, 2004, Revised Selected Papers /
|c edited by Sandro Etalle.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2005.
|
| 300 |
|
|
|a VIII, 284 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3573
|
| 505 |
0 |
|
|a Verification 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 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
| 700 |
1 |
|
|a Etalle, Sandro.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540266556
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3573
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/b137785
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
