Pierre Flener
Proceedings of the Eighth International Workshop on Logic Programming Synthesis and Transformation
LOPSTR, 1998.

@proceedings{LOPSTR-1998,
	address       = "Manchester, England, United Kingdom",
	editor        = "Pierre Flener",
	isbn          = "3-540-65765-7",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Eighth International Workshop on Logic Programming Synthesis and Transformation}",
	volume        = 1559,
	year          = 1998,
}

Contents (24 items)

12 ×#source code
7 ×#logic programming
6 ×#synthesis
3 ×#logic
3 ×#using
2 ×#constraints
2 ×#deduction
2 ×#named
2 ×#online
2 ×#proving

LOPSTR-1998-FuchsSS #logic #specification

Attempto Controlled English — Not Just Another Logic Specification Language (NEF, US, RS), pp. 1–20.

LOPSTR-1998-BaldanCLP #declarative #semantics #towards

A Step Towards a Methodology for Mercury Program Construction: A Declarative Semantics for Mercury (DB, BLC, CL, IP), pp. 21–40.

LOPSTR-1998-RobertsonA #logic programming #source code #synthesis

Pragmatics in the Synthesis of Logic Programs (DSR, JAC), pp. 41–60.

LOPSTR-1998-BaalenR #deduction #synthesis #using

Using Decision Procedures to Accelerate Domain-Specific Deductive Synthesis Systems (JVB, SR), pp. 61–70.

LOPSTR-1998-AvelloneFM #data type #source code #synthesis

Synthesis of Programs in Abstract Data Types (AA, MF, PM), pp. 81–100.

LOPSTR-1998-LauO #component #development #framework #logic #object-oriented

OOD Frameworks in Component-Based Software — Development in Computational Logic (KKL, MO), pp. 101–123.

LOPSTR-1998-BrogiCT #source code #using

The Use of Renaming in Composing General Programs (AB, SC, FT), pp. 124–142.

LOPSTR-1998-HamfeltN #combinator #composition #induction #logic programming #source code #synthesis

Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes (AH, JFN), pp. 143–158.

LOPSTR-1998-BossiR #logic programming #source code #specification

Specialising Logic Programs with Respect to Call?Post Specifications (AB, SR), pp. 159–178.

LOPSTR-1998-GluckHJ #online

Generalization in Hierarchies of Online Program Specialization Systems (RG, JH, JJ), pp. 179–198.

LOPSTR-1998-Leuschel #online #termination

Improving Homeomorphic Embedding for Online Termination (ML), pp. 199–218.

LOPSTR-1998-BossiC #logic programming #source code

Success in Logic Programs (AB, NC), pp. 219–239.

LOPSTR-1998-HoarauM #compilation #constraints #logic programming #source code #termination

Inferring and Compiling Termination for Constraint Logic Programs (SH, FM), pp. 240–254.

LOPSTR-1998-GabricGS #analysis #constraints #strict #theorem proving

Strictness Analysis as Finite-Domain Constraint Solving (TG, KG, HS), pp. 255–270.

LOPSTR-1998-StarkI #invariant #proving

Invariant Discovery via Failed Proof Attempts (JS, AI), pp. 271–288.

LOPSTR-1998-SmausHK #fault #logic programming #multi #source code #using

Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations (JGS, PMH, AK), pp. 289–307.

LOPSTR-1998-Wolper #algorithm #perspective

Algorithms for Synthesizing Reactive Systems: A Perspective (PW), p. 308.

LOPSTR-1998-ZidoumFH #source code #synthesis

Schema-Guided Synthesis of CLP Programs (HZ, PF, BH), pp. 309–312.

LOPSTR-1998-Richardson #named #proving #theorem proving

Abstract: Proof Planning with Program Schemas (JR), pp. 313–315.

LOPSTR-1998-BellotR #imperative #logic #source code #synthesis

Logical Synthesis of Imperative O. O. Programs (PB, BR), pp. 316–318.

LOPSTR-1998-AyedDFM #program transformation

Mathematical Foundations for Program Transformations (RBA, JD, MF, AM), pp. 319–321.

LOPSTR-1998-Rosenblueth #source code #using

An Exhaustive-Search Method Using Layered Streams Obtained Through a Meta-Interpreter for Chain Programs (DAR), pp. 322–324.

LOPSTR-1998-VanhoofSM #bottom-up #logic programming #source code

Bottom-Up Specialisation of Logic Programs (WV, DDS, BM), pp. 325–327.

LOPSTR-1998-MalletD #database #debugging #deduction #named #relational

Myrtle: A Set-Oriented Meta-Interpreter Driven by a “Relational” Trace for Deductive Databases Debugging (SM, MD), pp. 328–330.