Maurice Bruynooghe
Revised Selected Papers of the 13th International Symposium on Logic Based Program Synthesis and Transformation
LOPSTR, 2003.

@proceedings{LOPSTR-2003,
	address       = "Uppsala, Sweden",
	editor        = "Maurice Bruynooghe",
	isbn          = "3-540-22174-3",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Selected Papers of the 13th International Symposium on Logic Based Program Synthesis and Transformation}",
	volume        = 3018,
	year          = 2003,
}

Contents (18 items)

3 ×#program transformation
3 ×#proving
3 ×#synthesis
2 ×#algorithm
2 ×#analysis
2 ×#constraints
2 ×#induction
2 ×#logic
2 ×#performance
2 ×#theorem proving

LOPSTR-2003-LehmannL #generative #induction #proving #theorem proving #using

Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce (HL, ML), pp. 1–19.

LOPSTR-2003-AlexandreBD #induction #proving #synthesis

Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures (FA, KB, MD), pp. 20–33.

LOPSTR-2003-LauO #logic #object-oriented

Correct OO Systems in Computational Logic (KKL, MO), pp. 34–53.

LOPSTR-2003-Ellman #animation #automaton #hybrid #specification #synthesis

Specification and Synthesis of Hybrid Automata for Physics-Based Animation (TE), pp. 54–55.

LOPSTR-2003-FischerV #prolog #syntax #synthesis

Adding Concrete Syntax to a Prolog-Based Program Synthesis System (BF, EV), pp. 56–58.

LOPSTR-2003-BerghammerM #algorithm #approximate #development #using #verification

Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables (RB, MMO), pp. 59–74.

LOPSTR-2003-Ruiz-ReinaJHM #case study #data type #performance #reasoning

Formal Reasoning about Efficient Data Structures: A Case Study in ACL2 (JLRR, JAAJ, MJH, FJMM), pp. 75–91.

LOPSTR-2003-Gallagher #analysis #logic programming #program transformation #source code

A Program Transformation for Backwards Analysis of Logic Programs (JPG), pp. 92–105.

LOPSTR-2003-MurakamiHKT #algorithm #analysis #performance #staging

An Efficient Staging Algorithm for Binding-Time Analysis (TM, ZH, KK, MT), pp. 106–107.

LOPSTR-2003-SerebrenikS #proving #termination

Proving Termination with Adornments (AS, DDS), pp. 108–109.

LOPSTR-2003-WeberC

Constructively Characterizing Fold and Unfold (TW, JLC), pp. 110–127.

LOPSTR-2003-YokoyamaHT #higher-order #program transformation

Deterministic Higher-Order Patterns for Program Transformation (TY, ZH, MT), pp. 128–142.

LOPSTR-2003-BiernackiD #interpreter #logic

From Interpreter to Logic Engine by Defunctionalization (DB, OD), pp. 143–159.

LOPSTR-2003-AlvesF #program transformation

Linearization by Program Transformation (SA, MF), pp. 160–175.

LOPSTR-2003-WangG #continuation #horn clause #semantics

Continuation Semantics as Horn Clauses (QW, GG), pp. 176–177.

LOPSTR-2003-ChristiansenM #approach #constraints #database

Simplification of Database Integrity Constraints Revisited: A Transformational Approach (HC, DM), pp. 178–197.

LOPSTR-2003-AbdennadherF #constraints #integration #optimisation #rule-based #theorem proving

Integration and Optimization of Rule-Based Constraint Solvers (SA, TWF), pp. 198–213.

LOPSTR-2003-FlenerPA #combinator #modelling #problem #relational

Introducing esra, a Relational Language for Modelling Combinatorial Problems (PF, JP, MÅ), pp. 214–232.