default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th LOPSTR 2004: Verona, Italy
- Sandro Etalle:
Logic Based Program Synthesis and Transformation, 14th International Symposium, LOPSTR 2004, Verona, Italy, August 26-28, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3573, Springer 2005, ISBN 3-540-26655-0
Verification and Analysis
- Wim Vanhoof:
Searching Semantically Equivalent Code Fragments in Logic Programs. 1-18 - Pedro López-García
, Francisco Bueno, Manuel V. Hermenegildo:
Determinacy Analysis for Logic Programs Using Mode and Type Information. 19-35 - Sandeep S. Kulkarni, Borzoo Bonakdarpour, Ali Ebnenasir:
Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs. 36-52 - Stephen-John Craig, John P. Gallagher, Michael Leuschel, Kim S. Henriksen:
Fully Automatic Binding-Time Analysis for Prolog. 53-68
Theory and Security
- Jonathan Moody:
Logical Mobility and Locality Types. 69-84 - Annalisa Bossi, Carla Piazza, Sabina Rossi:
Unwinding Conditions for Security in Imperative Languages. 85-100 - Santiago Escobar, José Meseguer, Prasanna Thati:
Natural Rewriting for General Term Rewriting Systems. 101-116
Transformations
- Taisuke Sato, Yoshitaka Kameya:
Negation Elimination for Finite PCFGs. 117-132 - Thom W. Frühwirth:
Specialization of Concurrent Guarded Multi-set Transformation Rules. 133-148 - Germán Puebla, Elvira Albert, Manuel V. Hermenegildo:
Efficient Local Unfolding with Ancestor Stacks for Full Prolog. 149-165
Program Development
- Michael Colón:
Schema-Guided Synthesis of Imperative Programs by Constraint Solving. 166-181 - Bernd Brassel, Michael Hanus, Frank Huch, Josep Silva, Germán Vidal:
Run-Time Profiling of Functional Logic Programs. 182-197 - Kung-Kiu Lau, Alberto Momigliano, Mario Ornaghi:
Constructive Specifications for Compositional Units. 198-214
Termination
- M. R. K. Krishna Rao:
Input-Termination of Logic Programs. 215-230 - Alexander Serebrenik, Frédéric Mesnard:
On Termination of Binary CLP Programs. 231-244
Program Development and Synthesis
- Mads Sig Ager:
From Natural Semantics to Abstract Machines. 245-261 - J. B. Wells, Boris Yakobowski:
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis. 262-277
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-08 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
