default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Deransart
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[i9]Armando Gonçalves Da Silva Junior, Pierre Deransart, Luis-Carlos Menezes, Marcos Aurélio Almeida da Silva, Jacques Robin:
Towards a Generic Trace for Rule Based Constraint Reasoning. CoRR abs/1204.5280 (2012)- 2011
- [i8]Pierre Deransart:
Generic Traces and Constraints, GenTra4CP revisited. CoRR abs/1105.6210 (2011) - 2010
- [i7]Pierre Deransart, Rafael Oliveira:
Towards a Generic Framework to Generate Explanatory Traces of Constraint Solving and Rule-Based Reasoning. CoRR abs/1001.2188 (2010)
2000 – 2009
- 2007
- [i6]Pierre Deransart, Mireille Ducassé, Gérard Ferrand:
Une sémantique observationnelle du modèle des boîtes pour la résolution de programmes logiques (version étendue). CoRR abs/0706.3159 (2007) - [i5]Pierre Deransart, Mireille Ducassé, Gérard Ferrand:
Observational semantics of the Prolog Resolution Box Model. CoRR abs/0711.4071 (2007) - [i4]Pierre Deransart:
On using Tracer Driver for External Dynamic Process Observation. CoRR abs/cs/0701106 (2007) - 2004
- [c42]Pierre Deransart:
Main Results of the OADymPPaC Project. ICLP 2004: 456-457 - 2003
- [j11]Pierre Deransart, Ludovic Langevine:
Un nouveau traceur générique pour GNU-Prolog. Tech. Sci. Informatiques 22(1): 97-110 (2003) - [c41]Ludovic Langevine, Pierre Deransart, Mireille Ducassé:
A Generic Trace Schema for the Portability of CP(FD) Debugging Tools. CSCLP 2003: 171-195 - [c40]Ludovic Langevine, Mireille Ducassé, Pierre Deransart:
A Propagation Tracer for GNU-Prolog: From Formal Definition to Efficient Implementation. ICLP 2003: 269-283 - [c39]Ludovic Langevine, Pierre Deransart:
Un nouveau traceur générique pour GNU-Prolog. JFPLC 2003: 97-110 - [c38]Pierre Deransart, Ludovic Langevine, Mireille Ducassé:
Demonstration: Debugging constraint problems with portable tools. WLPE 2003: 46-47 - [i3]Mireille Ducassé, Ludovic Langevine, Pierre Deransart:
Rigorous design of tracers: an experiment for constraint logic programming. CoRR cs.SE/0310042 (2003) - 2002
- [j10]Pierre Deransart, Jan-Georg Smaus:
Subject Reduction of Logic Programs as Proof-Theoretic Property. J. Funct. Log. Program. 2002 (2002) - [c37]Ludovic Langevine, Pierre Deransart, Mireille Ducassé, Erwan Jahier:
Prototypage de traceurs CLP(FD): un modèle de trace et son expérimentation. JFPLC 2002: 135- - 2001
- [c36]Pierre Deransart, Jan-Georg Smaus:
Well-Typed Logic Programs Are not Wrong. FLOPS 2001: 280-295 - [c35]AbdelAli Ed-Dbali, Pierre Deransart, Mariza Andrade da Silva Bigonha, José de Siqueira, Roberto da Silva Bigonha:
HyperPro: Un environment intégré de documentation pour la PLC. JFPLC 2001: 257-270 - [c34]AbdelAli Ed-Dbali, Pierre Deransart, Mariza Andrade da Silva Bigonha, José de Siqueira, Roberto da Silva Bigonha:
HyperPro - An integrated documentation environment for CLP. WLPE 2001 - [c33]Ludovic Langevine, Pierre Deransart, Mireille Ducassé, Erwan Jahier:
Prototyping CLP(FD) tracers: a trace model and an experimental validation environment. WLPE 2001 - 2000
- [c32]Pierre Deransart, Manuel V. Hermenegildo, Jan Maluszynski:
Debugging of Constraint Programs: The DiSCiPl Methodology and Tools - Introduction. Analysis and Visualization Tools for Constraint Programming 2000: 1-20 - [c31]Christophe Aillaud, Pierre Deransart:
Towards a Language for CLP Choice-Tree Visualisation. Analysis and Visualization Tools for Constraint Programming 2000: 209-236 - [c30]Jan-Georg Smaus, François Fages, Pierre Deransart:
Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping. FSTTCS 2000: 214-226 - [c29]Pierre Deransart, Jan-Georg Smaus:
Les programmes bien typés ont tout bon. JFPLC 2000: 49-66 - [e4]Pierre Deransart, Manuel V. Hermenegildo, Jan Maluszynski:
Analysis and Visualization Tools for Constraint Programming, Constrain Debugging (DiSCiPl project). Lecture Notes in Computer Science 1870, Springer 2000, ISBN 3-540-41137-2 [contents] - [i2]Jan-Georg Smaus, François Fages, Pierre Deransart:
Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping. CoRR cs.LO/0010029 (2000) - [i1]Pierre Deransart, Jan-Georg Smaus:
Well-Typed Logic Programs Are not Wrong. CoRR cs.LO/0012015 (2000)
1990 – 1999
- 1999
- [c28]Christophe Aillaud, Pierre Deransart:
Vers un arbre de spécification d'arbres de choix en PLC. JFPLC 1999: 249-264 - 1997
- [c27]Francisco Bueno, Pierre Deransart, Wlodzimierz Drabent, Gérard Ferrand, Manuel V. Hermenegildo, Jan Maluszynski, Germán Puebla:
On the Role of Semantic Approximations on Validation and Diagnosis of Contraint Logic Programs. AADEBUG 1997: 155-169 - 1996
- [b3]Pierre Deransart, AbdelAli Ed-Dbali, Laurent Cervoni:
Prolog - the standard: reference manual. Springer 1996, ISBN 978-3-540-59304-1, pp. I-XIV, 1-272 - [c26]Pierre Deransart, Patrick Parot, Roberto da Silva Bigonha, José de Siqueira:
A Hypertext Based Environment to Write Literate Logic Programs (Poster Abstract). JICSLP 1996: 540 - [c25]Pascal Chambre, Pierre Deransart, Jan Maluszynski:
Une méthode de preuve pour programmes concurrents avec contraintes sous forme clausale. JFPLC 1996: 115-130 - 1995
- [c24]Pierre Deransart, Henryk Jan Komorowski:
Task Force on Logic Program Development (Compulog Project). LPE 1995 - 1994
- [j9]Sophie Renault, Pierre Deransart:
Design of Redundant Formal Specifications by Logic Programming: Merging Formal Text and Good Comments. Int. J. Softw. Eng. Knowl. Eng. 4(3): 369-390 (1994) - [c23]Pascal Chambre, Pierre Deransart:
Towards a Proof method of Non-Suspension of Concurrent Constraint Logic Programs. ICLP Workshop: Verification and Analysis of (Concurrent) Logic Languages 1994 - [c22]Sophie Renault, Pierre Deransart:
A Proof Manager for Verification of Logic Programs. LPE 1994 - [c21]Sophie Renault, Pierre Deransart:
Design of Redundant Formal Specifications by Logic programming: Merging Formal Text and Good Comments. ICLP Workshop: Applications of Logic Programming to Software Engineering 1994 - 1993
- [b2]Pierre Deransart, Jan Maluszynski:
A grammatical view of logic programming. MIT Press 1993, ISBN 978-0-262-04140-9, pp. I-XXXI, 1-454 - [j8]Gérard Ferrand, Pierre Deransart:
Proof Method of Partial Correctness and Weak Completeness for Normal Logic Programs. J. Log. Program. 17(2/3&4): 265-278 (1993) - [j7]Pierre Deransart:
Proof Methods of Declarative Properties of Definite Programs. Theor. Comput. Sci. 118(2): 99-166 (1993) - 1992
- [j6]Pierre Deransart, Gérard Ferrand:
An Operational Formal Definition of PROLOG: A Specification Method and Its Application. New Gener. Comput. 10(2): 121-172 (1992) - [c20]Gérard Ferrand, Pierre Deransart:
Proof Method of Partial Correctness and Weak Completeness for Normal Logic Programs. JICSLP 1992: 161-174 - [c19]AbdelAli Ed-Dbali, Pierre Deransart:
Software Formal Specification by Logic Programming: The Example of Standard Prolog. Logic Programming Summer School 1992: 278-289 - 1991
- [c18]Yves Deville, Leon Sterling, Pierre Deransart:
Software Development and Logic Programming. ICLP 1991: 941 - [c17]Pierre Deransart, Gérard Ferrand, Michel Téguia:
NSTO Programs (Not Subject to Occur-Check). ISLP 1991: 533-547 - 1990
- [e3]Pierre Deransart, Jan Maluszynski:
Programming Language Implementation and Logic Programming, 2nd International Workshop PLILP'90, Linköping, Sweden, August 20-22, 1990, Proceedings. Lecture Notes in Computer Science 456, Springer 1990, ISBN 3-540-53010-X [contents] - [e2]Pierre Deransart, Martin Jourdan:
Attribute Grammars and their Applications, International Conference WAGA, Paris, France, September 19-21, 1990, Proceedings. Lecture Notes in Computer Science 461, Springer 1990, ISBN 3-540-53101-7 [contents]
1980 – 1989
- 1989
- [c16]Pierre Deransart:
Sur la multiplicité des Sémantiques Opérationnelles de la Programmation en Logique, leur Modélisation à l'aide de Grammaires Attribuées et leur utilisation pour valider des Programmes Logiques. SPLT 1989: 41- - [c15]Pierre Deransart, Gérard Ferrand, Michel Téguia:
Test d'occurence en PROLOG et grammaires attribuées. SPLT 1989: 113-142 - [c14]Pierre Deransart, Gérard Ferrand:
Une vue méthodologique de la Programmation en Logique avec négation. SPLT 1989: 403- - [c13]Pierre Deransart:
Proofs of Declarative Properties of Logic Programs. TAPSOFT, Vol.1 1989: 207-226 - [e1]Pierre Deransart, Bernard Lorho, Jan Maluszynski:
Programming Language Implementation and Logic Programming, 1st International Workshop PLILP'88, Orléans, France, May 16-18, 1988, Proceedings. Lecture Notes in Computer Science 348, Springer 1989, ISBN 3-540-50820-1 [contents] - 1988
- [b1]Pierre Deransart, Martin Jourdan, Bernard Lorho:
Attribute Grammars: Definitions, Systems, and Bibliography. Lecture Notes in Computer Science 323, Springer 1988, ISBN 3-540-50056-1 - [j5]Bruno Courcelle, Pierre Deransart:
Proofs of Partial Correctness for Attribute Grammars with Applications to Recursive Procedures and Logic Programming. Inf. Comput. 78(1): 1-55 (1988) - [c12]Pierre Deransart, Jan Maluszynski:
A Grammatical View of Logic Programming. PLILP 1988: 219-251 - 1987
- [c11]Pierre Deransart:
Preuves de correction partielle des programmes logiques. SPLT 1987: 29- - [c10]Pierre Deransart, C. Moss, G. Richard:
Spécification formelle de Prolog standard. SPLT 1987: 455- - [c9]Pierre Deransart, Gérard Ferrand:
An Operational Formal Definition of PROLOG. SLP 1987: 162-172 - 1986
- [c8]Pierre Deransart, Gérard Ferrand:
Programmation en logique: méthodologie et enseignement. SPLT 1986: 75-90 - 1985
- [j4]Pierre Deransart, Jan Maluszynski:
Relating Logic Programs and Attribute Grammars. J. Log. Program. 2(2): 119-155 (1985) - [c7]Pierre Deransart, Gérard Ferrand:
Détection d'erreurs en programmation en logique. SPLT 1985 - 1984
- [j3]Pierre Deransart, Martin Jourdan, Bernard Lorho:
Speeding up Circularity Tests for Attribute Grammars. Acta Informatica 21: 375-391 (1984) - [c6]Pierre Deransart, Jan Maluszynski:
Modélisation du flot de données par des schémas d'attributs dans les programmes logiques. SPLT 1984 - 1983
- [c5]Pierre Deransart:
An Operational Algebraic Semantics of Prolog Programs. Logic Programming Workshop 1983: 437-442 - [c4]Pierre Deransart:
Logical Attribute Grammars. IFIP Congress 1983: 463-469 - [c3]Pierre Deransart:
Une sémantique opérationnelle algébrique de programmes PROLOG. SPLT 1983 - 1982
- [c2]Pierre Deransart:
Prolog et types abstraits algébriques. SPLT 1982 - 1981
- [c1]Marc Bergman, Pierre Deransart:
Abstract Data Types and Rewriting Systems: Application to the Programming of Algebraic Abstract Data Types in Prolog. CAAP 1981: 101-116
1970 – 1979
- 1979
- [j2]Pierre Deransart:
Proof by Semantic Attributes of a LISP Compiler. Comput. J. 22(3): 240-245 (1979) - [j1]Pierre Deransart:
The language LISP does not exist? ACM SIGPLAN Notices 14(5): 24-27 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
