Abstract is missing.
- Searching Semantically Equivalent Code Fragments in Logic ProgramsWim Vanhoof. 1-18 [doi]
- Determinacy Analysis for Logic Programs Using Mode and Type InformationPedro López-García, Francisco Bueno, Manuel V. Hermenegildo. 19-35 [doi]
- Mechanical Verification of Automatic Synthesis of Fault-Tolerant ProgramsSandeep S. Kulkarni, Borzoo Bonakdarpour, Ali Ebnenasir. 36-52 [doi]
- Fully Automatic Binding-Time Analysis for PrologStephen-John Craig, John P. Gallagher, Michael Leuschel, Kim S. Henriksen. 53-68 [doi]
- Logical Mobility and Locality TypesJonathan Moody. 69-84 [doi]
- Unwinding Conditions for Security in Imperative LanguagesAnnalisa Bossi, Carla Piazza, Sabina Rossi. 85-100 [doi]
- Natural Rewriting for General Term Rewriting SystemsSantiago Escobar, José Meseguer, Prasanna Thati. 101-116 [doi]
- Negation Elimination for Finite PCFGsTaisuke Sato, Yoshitaka Kameya. 117-132 [doi]
- Specialization of Concurrent Guarded Multi-set Transformation RulesThom W. Frühwirth. 133-148 [doi]
- Efficient Local Unfolding with Ancestor Stacks for Full PrologGermán Puebla, Elvira Albert, Manuel V. Hermenegildo. 149-165 [doi]
- Schema-Guided Synthesis of Imperative Programs by Constraint SolvingMichael Colón. 166-181 [doi]
- Run-Time Profiling of Functional Logic ProgramsBernd Brassel, Michael Hanus, Frank Huch, Josep Silva, Germán Vidal. 182-197 [doi]
- Constructive Specifications for Compositional UnitsKung-Kiu Lau, Alberto Momigliano, Mario Ornaghi. 198-214 [doi]
- Input-Termination of Logic ProgramsM. R. K. Krishna Rao. 215-230 [doi]
- On Termination of Binary CLP ProgramsAlexander Serebrenik, Frédéric Mesnard. 231-244 [doi]
- From Natural Semantics to Abstract MachinesMads Sig Ager. 245-261 [doi]
- Graph-Based Proof Counting and Enumeration with Applications for Program Fragment SynthesisJ. B. Wells, Boris Yakobowski. 262-277 [doi]