Sandro Etalle
Revised Selected Papers of the 14th International Symposium on Logic Based Program Synthesis and Transformation
LOPSTR, 2004.

@proceedings{LOPSTR-2004,
	address       = "Verona, Italy",
	editor        = "Sandro Etalle",
	isbn          = "3-540-26655-0",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Selected Papers of the 14th International Symposium on Logic Based Program Synthesis and Transformation}",
	volume        = 3573,
	year          = 2004,
}

Contents (17 items)

7 ×#source code
4 ×#logic programming
3 ×#synthesis
2 ×#analysis
2 ×#automation
2 ×#imperative
2 ×#prolog
2 ×#semantics

LOPSTR-2004-Vanhoof #logic programming #semantics #source code

Searching Semantically Equivalent Code Fragments in Logic Programs (WV), pp. 1–18.

LOPSTR-2004-Lopez-GarciaBH #analysis #logic programming #source code #using

Determinacy Analysis for Logic Programs Using Mode and Type Information (PLG, FB, MVH), pp. 19–35.

LOPSTR-2004-KulkarniBE #automation #fault tolerance #source code #synthesis #verification

Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs (SSK, BB, AE), pp. 36–52.

LOPSTR-2004-CraigGLH #analysis #automation #prolog

Fully Automatic Binding-Time Analysis for Prolog (SJC, JPG, ML, KSH), pp. 53–68.

LOPSTR-2004-Moody #locality #logic

Logical Mobility and Locality Types (JM), pp. 69–84.

LOPSTR-2004-BossiPR #imperative #security

Unwinding Conditions for Security in Imperative Languages (AB, CP, SR), pp. 85–100.

LOPSTR-2004-EscobarMT #term rewriting

Natural Rewriting for General Term Rewriting Systems (SE, JM, PT), pp. 101–116.

LOPSTR-2004-SatoK #finite

Negation Elimination for Finite PCFGs (TS, YK), pp. 117–132.

LOPSTR-2004-Fruhwirth #concurrent #multi

Specialization of Concurrent Guarded Multi-set Transformation Rules (TWF), pp. 133–148.

LOPSTR-2004-PueblaAH #performance #prolog

Efficient Local Unfolding with Ancestor Stacks for Full Prolog (GP, EA, MVH), pp. 149–165.

LOPSTR-2004-Colon #constraints #imperative #source code #synthesis #theorem proving

Schema-Guided Synthesis of Imperative Programs by Constraint Solving (MC), pp. 166–181.

LOPSTR-2004-BrasselHHSV #functional #logic programming #profiling #runtime #source code

Run-Time Profiling of Functional Logic Programs (BB, MH, FH, JS, GV), pp. 182–197.

LOPSTR-2004-LauMO #composition #specification

Constructive Specifications for Compositional Units (KKL, AM, MO), pp. 198–214.

LOPSTR-2004-Rao #logic programming #source code

Input-Termination of Logic Programs (MRKKR), pp. 215–230.

LOPSTR-2004-SerebrenikM #on the #source code #termination

On Termination of Binary CLP Programs (AS, FM), pp. 231–244.

LOPSTR-2004-Ager #automaton #semantics

From Natural Semantics to Abstract Machines (MSA), pp. 245–261.

LOPSTR-2004-WellsY #graph #proving #synthesis

Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis (JBW, BY), pp. 262–277.