|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996466108303316 |
|
|
Titolo |
Logic Based Program Synthesis and Transformation [[electronic resource] ] : 15th International Symposium, LOPSTR 2005, London, UK, September 7-9, 2005, Revised Selected Papers / / edited by Patricia M. Hill |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2006.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 182 p.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 3901 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science |
Artificial intelligence |
Computer programming |
Machine theory |
Computer Science Logic and Foundations of Programming |
Artificial Intelligence |
Programming Techniques |
Formal Languages and Automata Theory |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Held concurrently with SAS 2005, the Symposium on Static Analysis in Imperial College, University of London. |
|
|
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and author index. |
|
|
|
|
|
|
Nota di contenuto |
|
Temporal Logic Constraints in the Biochemical Abstract Machine BIOCHAM -- Temporal Logic Constraints in the Biochemical Abstract Machine BIOCHAM -- Tools for Program Development -- Declarative Programming with Function Patterns -- Transformational Verification of Parameterized Protocols Using Array Formulas -- Design and Implementation of : A Real-Time Action Description Language -- Program Transformations -- An Algorithm for Local Variable Elimination in Normal Logic Programs -- Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs -- Extension of Type-Based Approach to Generation of Stream-Processing Programs by Automatic Insertion of Buffering Primitives -- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure |
|
|
|
|