Read more
Thisvolumecontainsaselectionofthepaperspresentedatthe19thInternational SymposiumonLogic-BasedProgramSynthesisandTransformation(LOPSTR 2009)heldSeptember 9-11,2009in Coimbra,Portugal. Informationaboutthe conference can be found at cs. kuleuven. be/conference/ lopstr09+. PreviousLOPSTRsymposiawereheldinValencia(2008),Lyngby (2007),Venice(2006and1999),London(2005and2000),Verona(2004),U- sala(2003),Madrid(2002),Paphos(2001),Manchester(1998,1992,and1991), Leuven(1997),Stockholm(1996),Arnhem(1995),Pisa(1994),andLouvain-la- Neuve(1993). The aim of the LOPSTR series is to stimulate and promote international researchandcollaborationonlogic-basedprogramdevelopment. LOPSTRt- ditionally solicits papers in the areas of speci?cation, synthesis, veri?cation, transformation,analysis,optimization,composition,security,reuse,applications andtools,component-basedsoftwaredevelopment,softwarearchitectures,age- basedsoftwaredevelopment,andprogramre?nement. LOPSTRhasareputation forbeingalively,friendlyforumforpresentinganddiscussingworkinprogress. Formalproceedingsareproducedonlyafterthesymposiumsothatauthorscan incorporateanyfeedbackinthepublishedpapers. IwouldliketothankallthosewhosubmittedcontributionstoLOPSTRinthe categoriesoffullpapersandextendedabstracts. Eachsubmissionwasreviewed byatleastthreeProgramCommitteemembers. Thecommitteedecidedtoaccept threefullpapersforimmediateinclusioninthe?nalproceedings,andtenpapers wereacceptedafterrevisionandanotherroundofreviewing. Inadditiontothe accepted papers, the program also included an invited talk by Germ an Vidal (TechnicalUniversityofValencia). IamgratefultotheProgramCommitteememberswhoworkedhardtop- duce high-qualityreviewsforthe submitted papersin atight schedule, aswell as all the external reviewers involved in the paper selection. I also would like to thank Andrei Voronkov for his excellent EasyChair system that automates manyofthetasksinvolvedinchairingaconference. LOPSTR2009wasco-locatedwithPPDP2009andCSL2009. Manythanks tothelocalorganizersoftheseevents,inparticular,toAnaAlmeida,theLOP- STR2009LocalOrganizationChair. January2010 DannyDeSchreye Conference Organization Program Chair DannyDeSchreye DepartmentofComputerScience KatholiekeUniversiteitLeuven B-3001Heverlee,Belgium Email:danny. deschreye@cs. kuleuven. be Local Organization Chair AnaAlmeida DepartamentodeMatematica FaculdadedeCienciaseTecnologia UniversidadedeCoimbra Coimbra,Portugal Email:amca@mat. uc. pt Program Committee SlimAbdennadher GermanUniversityCairo,Egypt Mar ?aAlpuenteFrasnedoTechnicalUniversityofValencia,Spain RobertoBagnara UniversityofParma,Italy DannyDeSchreye K. U. Leuven,Belgium(Chair) JohnGallagher RoskildeUniversity,Denmark RobertGluc k UniversityofCopenhagen,Denmark MichaelHanus UniversityofKiel,Germany ReinhardKahle UniversidadeNovadeLisboa,Portugal AndyKing UniversityofKent,UK MichaelLeuschel UniversityofDu sseldorf,Germany FabioMartinelli IstitutodiInformaticaeTelematicaPisa,Italy Fred Mesnard Universit edeLaR eunion,France MarioOrnaghi Universita `degliStudidiMilano,Italy Germ anPuebla TechnicalUniversityofMadrid,Spain SabinaRossi Universit` aCa FoscaridiVenezia,Italy JosepSilva TechnicalUniversityofValencia,Spain PeterSchneider-Kamp UniversityofSouthernDenmark,Denmark TomSchrijvers K. U. Leuven,Belgium PetrStepanek CharlesUniversityPrague,CzechRepublic WimVanhoof UniversityofNamur,Belgium VIII Organization Organizing Committee AnaAlmeida PedroQuaresma ReinhardKahle External Reviewers JesperLouisAndersen FedericoBergenti UlrichBerger CarlFriedrichBolz PedroCabalar GabrieleCosta Francois Degrave MarcDenecker CamilloFiorentini SebastianFischer EmilioJesusGallegoArias MichaelGelfond PepeIborra HaythemIsmail LeanidKrautsevich JoaoLeite GiftNuka EtiennePayet PaoloPilozzi FrankRaiser JuanRodriguez-Hortala CesarSanchez AntonSetzer MajaTonnesen PeterVanWeert DeanVoets GianluigiZavattaro Table of Contents Towards Scalable Partial Evaluation of Declarative Programs (Invited Talk) . . . . . . . . . . . . . . . . . . .
List of contents
Towards Scalable Partial Evaluation of Declarative Programs.- Deciding Full Branching Time Logic by Program Transformation.- A Transformational Approach for Proving Properties of the CHR Constraint Store.- The Dependency Triple Framework for Termination of Logic Programs.- Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing.- LP with Flexible Grouping and Aggregates Using Modes.- On Inductive and Coinductive Proofs via Unfold/Fold Transformations.- Coinductive Logic Programming with Negation.- Refining Exceptions in Four-Valued Logic.- Towards a Framework for Constraint-Based Test Case Generation.- Using Rewrite Strategies for Testing BUpL Agents.- Towards Just-In-Time Partial Evaluation of Prolog.- Program Parallelization Using Synchronized Pipelining.- Defining Datalog in Rewriting Logic.
