Michael Leuschel
Revised Selected Papers of the 12th International Workshop on Logic Based Program Synthesis and Transformation
LOPSTR, 2002.

@proceedings{LOPSTR-2002,
	address       = "Madrid, Spain",
	editor        = "Michael Leuschel",
	isbn          = "3-540-40438-4",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Selected Papers of the 12th International Workshop on Logic Based Program Synthesis and Transformation}",
	volume        = 2664,
	year          = 2002,
}

Contents (22 items)

7 ×#source code
5 ×#logic programming
3 ×#framework
3 ×#logic
2 ×#calculus
2 ×#higher-order
2 ×#optimisation
2 ×#program transformation
2 ×#synthesis
2 ×#towards

LOPSTR-2002-AlpuenteCEFL #functional #source code

Abstract Diagnosis of Functional Programs (MA, MC, SE, MF, SL), pp. 1–16.

LOPSTR-2002-GutierrezR #calculus #type system #verification

A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene (FG, BCR), pp. 17–31.

LOPSTR-2002-AbdennadherR #constraints #logic programming #synthesis #theorem proving #using

Constraint Solver Synthesis Using Tabled Resolution for Constraint Logic Programming (SA, CR), pp. 32–47.

LOPSTR-2002-GrecoGTZ #optimisation #query #source code

Translating Datalog-Like Optimization Queries into ILOG Programs (GG, SG, IT, EZ), pp. 48–49.

LOPSTR-2002-ClaytonCPU #bottom-up #logic programming

Tabling Structures for Bottom-Up Logic Programming (RC, JGC, BP, MU), pp. 50–51.

LOPSTR-2002-AmatoS #alias #framework #towards

A General Framework for Variable Aliasing: Towards Optimal Operators for Sharing Properties (GA, FS), pp. 52–70.

LOPSTR-2002-SimonKH #abstract domain #difference #linear

Two Variables per Linear Inequality as an Abstract Domain (AS, AK, JMH), pp. 71–89.

LOPSTR-2002-PeraltaG #abstraction #source code

Convex Hull Abstractions in Specialization of CLP Programs (JCP, JPG), pp. 90–108.

LOPSTR-2002-MazurJV #optimisation

Collecting Potential Optimisations (NM, GJ, WV), pp. 109–110.

LOPSTR-2002-FernandezS #approach #calculus

An Operational Approach to Program Extraction in the Calculus of Constructions (MF, PS), pp. 111–125.

LOPSTR-2002-ColvinHHS #higher-order #logic programming #refinement #source code

Refinement of Higher-Order Logic Programs (RC, IJH, DH, PAS), pp. 126–143.

LOPSTR-2002-Berghammer #set

A Generic Program for Minimal Subsets with Applications (RB), pp. 144–157.

LOPSTR-2002-GuoRR #program transformation

Justification Based on Program Transformation (HFG, CRR, IVR), pp. 158–159.

LOPSTR-2002-FioravantiPP #higher-order #logic #logic programming #monad #program transformation #source code

Combining Logic Programs and Monadic Second Order Logics by Program Transformation (FF, AP, MP), pp. 160–181.

LOPSTR-2002-Martin-MateosAHR #framework #verification

Verification in ACL2 of a Generic Framework to Synthesize SAT-Provers (FJMM, JAA, MJH, JLRR), pp. 182–198.

LOPSTR-2002-BossiFPR #data flow #proving #security

A Proof System for Information Flow Security (AB, RF, CP, SR), pp. 199–218.

LOPSTR-2002-Vidal #declarative #multi #partial evaluation #slicing #source code

Forward Slicing of Multi-paradigm Declarative Programs Based on Partial Evaluation (GV), pp. 219–237.

LOPSTR-2002-VanhoofTB #fixpoint #logic programming #semantics #source code

A Fixed Point Semantics for Logic Programs Extended with Cuts (WV, RT, MB), pp. 238–257.

LOPSTR-2002-Gruner #deduction

Abstract Partial Deduction Challenged (SG), pp. 258–259.

LOPSTR-2002-LauO #design #framework #logic #object-oriented #towards

Towards Correct Object-Oriented Design Frameworks in Computational Logic (KKL, MO), pp. 260–261.

LOPSTR-2002-BragaHMM #composition #logic

Mapping Modular SOS to Rewriting Logic (CdOB, EHH, JM, PDM), pp. 262–277.

LOPSTR-2002-AkamaNK #synthesis

Program Synthesis Based on the Equivalent Transformation Computation Model (KA, EN, HK), pp. 278–279.