Kung-Kiu Lau
Extended Abstracts of the 10th International Workshop on Logic-based Program Synthesis and Transformation
LOPSTR, 2000.

@proceedings{LOPSTR-2000,
	address       = "London, England, United Kingdom",
	editor        = "Kung-Kiu Lau",
	ee            = "ftp://ftp.cs.man.ac.uk/pub/TR/UMCS-00-6-1.html",
	publisher     = "{Department of Computer Science, University of Manchester}",
	series        = "{Technical Report}",
	title         = "{Extended Abstracts of the 10th International Workshop on Logic-based Program Synthesis and Transformation}",
	volume        = "UMCS-00-6-1",
	year          = 2000,
}

Contents (14 items)

6 ×#logic programming
5 ×#source code
3 ×#analysis
2 ×#composition
2 ×#higher-order
2 ×#prolog
2 ×#specification

LOPSTR-2000-AlbertAV #effectiveness #partial evaluation

Measuring the Effectiveness of Partial Evaluation (EA, SA, GV).

LOPSTR-2000-AvelloneFF #framework #logic programming #source code #synthesis #verification

A formal framework for synthesis and verification of logic programs (AA, MF, CF).

LOPSTR-2000-BuenoBHMPS #analysis #compilation #optimisation

A model for inter-module analysis and optimizing compilation (FB, MJGdlB, MVH, KM, GP, PJS).

LOPSTR-2000-ColvinHS #composition #logic programming #refinement

Modular Logic Program Refinement (RC, IJH, PAS).

LOPSTR-2000-Demoen #abduction #garbage collection #prolog

Prolog and abduction 4 writing garbage collectors (BD).

LOPSTR-2000-EtalleM #functional #lazy evaluation #logic programming

The lazy functional side of logic programming (SE, JM).

LOPSTR-2000-FioravantiPP #automation #constraints #logic programming #source code

Automated strategies for specializing constraint logic programs (FF, AP, MP).

LOPSTR-2000-JahierDR #continuation #modelling #prolog #semantics #specification

Specifying Prolog trace models with a continuation semantics (EJ, MD, OR).

LOPSTR-2000-PierroW #abstract interpretation #on the #precise

On the precision of abstract interpretations (ADP, HW).

LOPSTR-2000-PoernomoC #protocol #proving #source code

Protocols between programs and proofs (IP, JNC).

LOPSTR-2000-SerebrenikS #analysis #logic programming #source code #termination

Non-tranformational termination analysis of logic programs, based on general term-orderings (AS, DDS).

LOPSTR-2000-SeresS #higher-order #logic programming #source code

Higher-order transformation of logic programs (SS, JMS).

LOPSTR-2000-VanhoofB #analysis #composition #higher-order #towards

Towards a modular binding-time analysis for higher-order Mercury (WV, MB).

LOPSTR-2000-Wilson #specification

A minimal specification language (WWW).