LOPSTR 2011 Accepted Papers

Paulo Moura. Meta-Predicate Semantics
Thomas Stroeder, Peter Schneider-Kamp, Jürgen Giesl, Fabian Emmes and Carsten Fuhs. A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog
Jon Sneyers and Daniel De Schreye. Probabilistic Termination of CHRiSM Programs
Hirohisa Seki. Proving Properties of  Co-logic Programs by Unfold/Fold Transformations
Rafael Caballero, Adrian Riesco, Alberto Verdejo and Narciso Marti-Oliet. Simplifying Questions in Maude Declarative Debugger by Transforming Proof Trees
Paolo Pilozzi and Daniel De Schreye. Improved termination analysis of CHR using self-sustainability analysis
Olivier Namet, Maribel Fernandez and Helene Kirchner. A strategy language for graph rewriting
Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hiroyuki Kato, Kazutaka Matsuda, Keisuke Nakano and Isao Sasano. Marker-directed optimization of UnCAL graph transformations
Jose F. Morales, Manuel Hermenegildo and Rémy Haemmerlé. Modular Extensions for Modular (Logic) Languages
Pedro Cabalar and Stephane Demri. Automata-based Computation of Temporal Equilibrium Models
Romain Demeyer and Wim Vanhoof. Proper Granularity for Atomic Sections in Concurrent Programs
Jesus Almendros-Jimenez, Rafael Caballero, Yolanda García-Ruiz and Fernando Saenz-Perez. A Declarative Embedding of XQuery  in a Functional-Logic Language
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti and Valerio Senni. Using Real Relaxations During Program Specialization
Elvira Albert, Miguel Gomez-Zamalloa and José Miguel Rojas Siles. Resource-driven CLP-based Test Case Generation
Wim Vanhoof. On the partial deduction of non-ground meta-interpreters
Céline Dandois and Wim Vanhoof. Clones in logic programs and how to detect them
Giovanni Bacci, Marco Comini, Marco A. Feliú and Alicia Villanueva. Automatic Synthesis of Specifications for Curry Programs - Extended Abstract
Nik Sultana. Work in progress: A prototype refactoring tool based on a mechanically-verified core