Cargando…

Logic-Based Program Synthesis and Transformation 19th International Symposium, LOPSTR 2009, Coimbra, Portugal, September 2009, Revised Selected Papers /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: De Schreye, Danny (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Edición:1st ed. 2010.
Colección:Theoretical Computer Science and General Issues, 6037
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-642-12592-8
003 DE-He213
005 20230221042121.0
007 cr nn 008mamaa
008 100428s2010 gw | s |||| 0|eng d
020 |a 9783642125928  |9 978-3-642-12592-8 
024 7 |a 10.1007/978-3-642-12592-8  |2 doi 
050 4 |a QA76.6-76.66 
072 7 |a UM  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
072 7 |a UM  |2 thema 
082 0 4 |a 005.11  |2 23 
245 1 0 |a Logic-Based Program Synthesis and Transformation  |h [electronic resource] :  |b 19th International Symposium, LOPSTR 2009, Coimbra, Portugal, September 2009, Revised Selected Papers /  |c edited by Danny De Schreye. 
250 |a 1st ed. 2010. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2010. 
300 |a X, 205 p. 29 illus.  |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 Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 6037 
505 0 |a Towards Scalable Partial Evaluation of Declarative Programs -- Deciding Full Branching Time Logic by Program Transformation -- A Transformational Approach for Proving Properties of the CHR Constraint Store -- The Dependency Triple Framework for Termination of Logic Programs -- Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing -- LP with Flexible Grouping and Aggregates Using Modes -- On Inductive and Coinductive Proofs via Unfold/Fold Transformations -- Coinductive Logic Programming with Negation -- Refining Exceptions in Four-Valued Logic -- Towards a Framework for Constraint-Based Test Case Generation -- Using Rewrite Strategies for Testing BUpL Agents -- Towards Just-In-Time Partial Evaluation of Prolog -- Program Parallelization Using Synchronized Pipelining -- Defining Datalog in Rewriting Logic. 
650 0 |a Computer programming. 
650 0 |a Software engineering. 
650 0 |a Compilers (Computer programs). 
650 0 |a Computer science. 
650 0 |a Machine theory. 
650 0 |a Artificial intelligence. 
650 1 4 |a Programming Techniques. 
650 2 4 |a Software Engineering. 
650 2 4 |a Compilers and Interpreters. 
650 2 4 |a Computer Science Logic and Foundations of Programming. 
650 2 4 |a Formal Languages and Automata Theory. 
650 2 4 |a Artificial Intelligence. 
700 1 |a De Schreye, Danny.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783642125911 
776 0 8 |i Printed edition:  |z 9783642125935 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 6037 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-642-12592-8  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)