(our apologies if you receive multiple copies of this message) ============================================================ CALL FOR PARTICIPATION 21th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2011 http://users.dsic.upv.es/~lopstr11/ Odense, Denmark, July 18-20, 2011 (co-located with PPDP 2011, AAIP 2011 and WFLP 2011) ============================================================ ONLINE REGISTRATION IS OPEN: http://www.imada.sdu.dk/~petersk/OLP/registration.html EARLY REGISTRATION DEADLINE: May 30, 2011 (next Monday!) The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. SYMPOSIUM PROGRAM (tentative): Monday, July 18, 2011: 14:00 - 15:00: Session 1 * 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 * Olivier Namet, Maribel Fernandez and Helene Kirchner. A Strategy Language for Graph Rewriting Coffee break 15:30 - 17:30: Session 2 * Paulo Moura. Meta-Predicate Semantics * Jose F. Morales, Manuel Hermenegildo and Rémy Haemmerlé. Modular Extensions for Modular (Logic) Languages * Nik Sultana. A prototype refactoring tool based on a mechanically-verified core * Céline Dandois and Wim Vanhoof. Clones in logic programs and how to detect them Tuesday, July 19, 2011: 09:00 - 10:00: LOPSTR Invited Talk * John Gallagher. <TBA> Coffee break 10:30 - 12:30: Session 3 * Wim Vanhoof. On the partial deduction of non-ground meta-interpreters * Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti and Valerio Senni. Using Real Relaxations During Program Specialization * 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 Lunch break 14:00 - 15:00: Session 4 * Giovanni Bacci, Marco Comini, Marco A. Feliú and Alicia Villanueva. Automatic Synthesis of Specifications for Curry Programs * Jesus Almendros-Jimenez, Rafael Caballero, Yolanda García-Ruiz and Fernando Saenz-Perez. A Declarative Embedding of XQuery in a Functional-Logic Language Coffee break 15:30 - 17:30: Session 5 * Elvira Albert, Miguel Gomez-Zamalloa and José Miguel Rojas Siles. Resource-driven CLP-based Test Case Generation * Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hiroyuki Kato, Kazutaka Matsuda, Keisuke Nakano and Isao Sasano. Marker-directed optimization of UnCAL graph transformations * Sneyers and Daniel De Schreye. Probabilistic Termination of CHRiSM Programs * Paolo Pilozzi and Daniel De Schreye. Improved termination analysis of CHR using self-sustainability analysis Wednesday, July 20, 2011: 9:00 - 10:00: PPDP/LOPSTR Invited Talk * Fritz Henglein. <TBA> Coffee break 10:30 - 11:30: PPDP/LOPSTR Invited Talk * Vitaly Lagoon. The Challenges of Constraint-Based Test Generation Coffee break 11:30 - 12:30: Session 6: * Pedro Cabalar and Stephane Demri. Automata-based Computation of Temporal Equilibrium Models * Demeyer and Wim Vanhoof. Proper Granularity for Atomic Sections in Concurrent Programs Lunch and Excursion ============================================================