LOPSTR C

15 papers

YearTitle / Authors
2000A formal framework for synthesis and verification of logic programs.
Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini
2000A minimal specification language.
Walter W. Wilson
2000A model for inter-module analysis and optimizing compilation.
Francisco Bueno, Maria J. García de la Banda, Manuel V. Hermenegildo, Kim Marriott, Germán Puebla, Peter J. Stuckey
2000Automated strategies for specializing constraint logic programs.
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2000Extended Abstracts of the 10th International Workshop on Logic-based Program Synthesis and Transformation, LOPSTR 2000, London, UK, July 24-28, 2000.
Kung-Kiu Lau
2000Higher-order transformation of logic programs.
Silvija Seres, J. Michael Spivey
2000Measuring the Effectiveness of Partial Evaluation.
Elvira Albert, Sergio Antoy, Germán Vidal
2000Modular Logic Program Refinement.
Robert Colvin, Ian J. Hayes, Paul A. Strooper
2000Non-tranformational termination analysis of logic programs, based on general term-orderings.
Alexander Serebrenik, Danny De Schreye
2000On the precision of abstract interpretations.
Alessandra Di Pierro, Herbert Wiklicky
2000Prolog and abduction 4 writing garbage collectors.
Bart Demoen
2000Protocols between programs and proofs.
Iman Poernomo, John N. Crossley
2000Specifying Prolog trace models with a continuation semantics.
Erwan Jahier, Mireille Ducassé, Olivier Ridoux
2000The lazy functional side of logic programming.
Sandro Etalle, Jon Mountjoy
2000Towards a modular binding-time analysis for higher-order Mercury.
Wim Vanhoof, Maurice Bruynooghe