Germán Vidal
Revised Selected Papers of the 21st International Symposium on Logic-Based Program Synthesis and Transformation
LOPSTR, 2011.

@proceedings{LOPSTR-2011,
	address       = "Odense, Denmark",
	doi           = "10.1007/978-3-642-32211-2",
	editor        = "Germán Vidal",
	isbn          = "978-3-642-32210-5",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Selected Papers of the 21st International Symposium on Logic-Based Program Synthesis and Transformation}",
	volume        = 7225,
	year          = 2011,
}

Contents (16 items)

4 ×#source code
3 ×#analysis
3 ×#logic programming
3 ×#termination
3 ×#using
2 ×#declarative
2 ×#proving
2 ×#semantics

LOPSTR-2011-Gallagher #analysis #logic programming #source code #using

Analysis of Logic Programs Using Regular Tree Languages — (JPG), pp. 1–3.

LOPSTR-2011-Henglein #domain-specific language #implementation #symbolic computation

Dynamic Symbolic Computation for Domain-Specific Language Implementation (FH), pp. 4–24.

LOPSTR-2011-AlbertGR #generative #testing

Resource-Driven CLP-Based Test Case Generation (EA, MGZ, JMR), pp. 25–41.

LOPSTR-2011-Almendros-JimenezCGS #declarative #functional #xquery

A Declarative Embedding of XQuery in a Functional-Logic Language (JMAJ, RC, YGR, FSP), pp. 42–56.

LOPSTR-2011-CabalarD #equilibrium #modelling

Automata-Based Computation of Temporal Equilibrium Models (PC, SD), pp. 57–72.

LOPSTR-2011-CaballeroRVM #debugging #declarative #maude #proving

Simplifying Questions in Maude Declarative Debugger by Transforming Proof Trees (RC, AR, AV, NMO), pp. 73–89.

LOPSTR-2011-DandoisV #detection #how #logic programming #source code

Clones in Logic Programs and How to Detect Them (CD, WV), pp. 90–105.

LOPSTR-2011-FioravantiPPS #using

Using Real Relaxations during Program Specialization (FF, AP, MP, VS), pp. 106–122.

LOPSTR-2011-HidakaHIKMNS #graph transformation #optimisation

Marker-Directed Optimization of UnCAL Graph Transformations (SH, ZH, KI, HK, KM, KN, IS), pp. 123–138.

LOPSTR-2011-MoralesHH #composition #logic

Modular Extensions for Modular (Logic) Languages (JFM, MVH, RH), pp. 139–154.

LOPSTR-2011-Moura #semantics

Meta-predicate Semantics (PM), pp. 155–172.

LOPSTR-2011-FernandezKN #graph grammar

A Strategy Language for Graph Rewriting (MF, HK, ON), pp. 173–188.

LOPSTR-2011-PilozziS #analysis #self #termination #using

Improved Termination Analysis of CHR Using Self-sustainability Analysis (PP, DDS), pp. 189–204.

LOPSTR-2011-Seki #logic programming #proving #source code

Proving Properties of Co-Logic Programs by Unfold/Fold Transformations (HS), pp. 205–220.

LOPSTR-2011-SneyersS #probability #source code #termination

Probabilistic Termination of CHRiSM Programs (JS, DDS), pp. 221–236.

LOPSTR-2011-StroderESGF #analysis #complexity #linear #prolog #semantics #termination

A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog (TS, FE, PSK, JG, CF), pp. 237–252.