Sophie Renault - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2005

Derivation of Efficient Logic Programs by Specialization and Reduction of NondeterminismAlberto Pettorossi, Maurizio Proietti, Sophie Renault. lisp, 18(1-2):121-210, 2005. [doi]

1999

Improving Termination of MDG-Based Abstract State Enumeration via Term SchematizationSophie Renault, Eduard Cerny. ENTCS, 23(2):57-74, 1999. [doi]

1997

Reducing Nondeterminism while Specializing Logic ProgramsAlberto Pettorossi, Maurizio Proietti, Sophie Renault. POPL 1997: 414-427 [doi]

1996

How to Extend Partial Deduction to Derive the KMP String-Matching Algorithm from a Naive Specification (Poster Abstract)Alberto Pettorossi, Maurizio Proietti, Sophie Renault. ICLP 1996: 539

Enhancing Partial Deduction via Unfold/Fold RulesAlberto Pettorossi, Maurizio Proietti, Sophie Renault. LOPSTR 1997: 146-168

1995

Towards a Complete Proof Procedure to Prove Properties of Normal Logic Programs under the CompletionSophie Renault. LOPSTR 1996: 204-218

1994

Design of Redundant Formal Specifications by Logic Programming: Merging Formal Text and Good CommentsSophie Renault, Pierre Deransart. ijseke, 4(3):369-390, 1994. [doi]

Généralisation de l Exécution Étendue aux programmes normauxSophie Renault. jfplc 1994: 109

A Proof Manager for Verification of Logic ProgramsSophie Renault, Pierre Deransart. ICLP 1994:

Generalizing Extended Execution for Normal ProgramsSophie Renault. LOPSTR 1994: 154-169

Design of Redundant Formal Specifications by Logic programming: Merging Formal Text and Good CommentsSophie Renault, Pierre Deransart. ICLP 1994:

1993

Validation of Stratified Logic Programs: Methodology and Practical ExperienceSophie Renault. eurovav 1993: 143-157

Sign in or sign up to see more results.

runs on WebDSL