The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pierre Deransart: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pierre Deransart, Gérard Ferrand
    An Operational Formal Definition of PROLOG. [Citation Graph (1, 0)][DBLP]
    SLP, 1987, pp:162-172 [Conf]
  2. Bruno Courcelle, Pierre Deransart
    Proofs of Partial Correctness for Attribute Grammars with Applications to Recursive Procedures and Logic Programming [Citation Graph (1, 0)][DBLP]
    Inf. Comput., 1988, v:78, n:1, pp:1-55 [Journal]
  3. 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. [Citation Graph (0, 0)][DBLP]
    AADEBUG, 1997, pp:155-169 [Conf]
  4. Marc Bergman, Pierre Deransart
    Abstract Data Types and Rewriting Systems: Application to the Programming of Algebraic Abstract Data Types in Prolog. [Citation Graph (0, 0)][DBLP]
    CAAP, 1981, pp:101-116 [Conf]
  5. Ludovic Langevine, Pierre Deransart, Mireille Ducassé
    A Generic Trace Schema for the Portability of CP(FD) Debugging Tools. [Citation Graph (0, 0)][DBLP]
    CSCLP, 2003, pp:171-195 [Conf]
  6. Christophe Aillaud, Pierre Deransart
    Towards a Language for CLP Choice-Tree Visualisation. [Citation Graph (0, 0)][DBLP]
    Analysis and Visualization Tools for Constraint Programming, 2000, pp:209-236 [Conf]
  7. Pierre Deransart, Manuel V. Hermenegildo, Jan Maluszynski
    Introduction. [Citation Graph (0, 0)][DBLP]
    Analysis and Visualization Tools for Constraint Programming, 2000, pp:1-20 [Conf]
  8. Pierre Deransart, Jan-Georg Smaus
    Well-Typed Logic Programs Are not Wrong. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2001, pp:280-295 [Conf]
  9. Jan-Georg Smaus, François Fages, Pierre Deransart
    Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:214-226 [Conf]
  10. Pierre Deransart
    Main Results of the OADymPPaC Project. [Citation Graph (0, 0)][DBLP]
    ICLP, 2004, pp:456-457 [Conf]
  11. Pierre Deransart, Patrick Parot, Roberto da Silva Bigonha, José de Siqueira
    A Hypertext Based Environment to Write Literate Logic Programs (Poster Abstract). [Citation Graph (0, 0)][DBLP]
    JICSLP, 1996, pp:540- [Conf]
  12. Yves Deville, Leon Sterling, Pierre Deransart
    Software Development and Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:941- [Conf]
  13. Gérard Ferrand, Pierre Deransart
    Proof Method of Partial Correctness and Weak Completeness for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1992, pp:161-174 [Conf]
  14. Ludovic Langevine, Mireille Ducassé, Pierre Deransart
    A Propagation Tracer for GNU-Prolog: From Formal Definition to Efficient Implementation. [Citation Graph (0, 0)][DBLP]
    ICLP, 2003, pp:269-283 [Conf]
  15. Sophie Renault, Pierre Deransart
    A Proof Manager for Verification of Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPE, 1994, pp:0-0 [Conf]
  16. Pierre Deransart
    Logical Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1983, pp:463-469 [Conf]
  17. Pascal Chambre, Pierre Deransart, Jan Maluszynski
    Une méthode de preuve pour programmes concurrents avec contraintes sous forme clausale. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1996, pp:115-130 [Conf]
  18. Christophe Aillaud, Pierre Deransart
    Vers un arbre de spécification d'arbres de choix en PLC. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1999, pp:249-264 [Conf]
  19. Pierre Deransart
    Prolog et types abstraits algébriques. [Citation Graph (0, 0)][DBLP]
    SPLT, 1982, pp:- [Conf]
  20. Pierre Deransart
    Une sémantique opérationnelle algébrique de programmes PROLOG. [Citation Graph (0, 0)][DBLP]
    SPLT, 1983, pp:- [Conf]
  21. Pierre Deransart
    Preuves de correction partielle des programmes logiques. [Citation Graph (0, 0)][DBLP]
    SPLT, 1987, pp:29-0 [Conf]
  22. 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. [Citation Graph (0, 0)][DBLP]
    SPLT, 1989, pp:41-0 [Conf]
  23. Pierre Deransart, Gérard Ferrand
    Détection d'erreurs en programmation en logique. [Citation Graph (0, 0)][DBLP]
    SPLT, 1985, pp:- [Conf]
  24. Pierre Deransart, Gérard Ferrand
    Programmation en logique: méthodologie et enseignement. [Citation Graph (0, 0)][DBLP]
    SPLT, 1986, pp:75-90 [Conf]
  25. Pierre Deransart, Gérard Ferrand
    Une vue méthodologique de la Programmation en Logique avec négation. [Citation Graph (0, 0)][DBLP]
    SPLT, 1989, pp:403-0 [Conf]
  26. Pierre Deransart, Gérard Ferrand, Michel Téguia
    Test d'occurence en PROLOG et grammaires attribuées. [Citation Graph (0, 0)][DBLP]
    SPLT, 1989, pp:113-142 [Conf]
  27. Pierre Deransart, Jan Maluszynski
    Modélisation du flot de données par des schémas d'attributs dans les programmes logiques. [Citation Graph (0, 0)][DBLP]
    SPLT, 1984, pp:- [Conf]
  28. Pierre Deransart, C. Moss, G. Richard
    Spécification formelle de Prolog standard. [Citation Graph (0, 0)][DBLP]
    SPLT, 1987, pp:455-0 [Conf]
  29. Pierre Deransart, Jan-Georg Smaus
    Les programmes bien typés ont tout bon. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2000, pp:49-66 [Conf]
  30. 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. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2001, pp:257-270 [Conf]
  31. Ludovic Langevine, Pierre Deransart, Mireille Ducassé, Erwan Jahier
    Prototypage de traceurs CLP(FD): un modèle de trace et son expérimentation. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2002, pp:135-0 [Conf]
  32. Ludovic Langevine, Pierre Deransart
    Un nouveau traceur générique pour GNU-Prolog. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2003, pp:97-110 [Conf]
  33. Pierre Deransart, Henryk Jan Komorowski
    Task Force on Logic Program Development (Compulog Project). [Citation Graph (0, 0)]
    LPE, 1995, pp:- [Conf]
  34. Pierre Deransart, Ludovic Langevine, Mireille Ducassé
    Demonstration: Debugging constraint problems with portable tools. [Citation Graph (0, 0)][DBLP]
    WLPE, 2003, pp:46-47 [Conf]
  35. AbdelAli Ed-Dbali, Pierre Deransart, Mariza Andrade da Silva Bigonha, José de Siqueira, Roberto da Silva Bigonha
    HyperPro - An integrated documentation environment for CLP. [Citation Graph (0, 0)][DBLP]
    WLPE, 2001, pp:- [Conf]
  36. Ludovic Langevine, Pierre Deransart, Mireille Ducassé, Erwan Jahier
    Prototyping CLP(FD) tracers: a trace model and an experimental validation environment. [Citation Graph (0, 0)][DBLP]
    WLPE, 2001, pp:- [Conf]
  37. AbdelAli Ed-Dbali, Pierre Deransart
    Software Formal Specification by Logic Programming: The Example of Standard Prolog. [Citation Graph (0, 0)][DBLP]
    Logic Programming Summer School, 1992, pp:278-289 [Conf]
  38. Pierre Deransart, Jan Maluszynski
    A Grammatical View of Logic Programming. [Citation Graph (0, 0)][DBLP]
    PLILP, 1988, pp:219-251 [Conf]
  39. Pierre Deransart, Gérard Ferrand, Michel Téguia
    NSTO Programs (Not Subject to Occur-Check). [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:533-547 [Conf]
  40. Pierre Deransart
    Proofs of Declarative Properties of Logic Programs. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:207-226 [Conf]
  41. Pierre Deransart, Martin Jourdan, Bernard Lorho
    Speeding up Circularity Tests for Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1984, v:21, n:, pp:375-391 [Journal]
  42. Pierre Deransart
    Proof by Semantic Attributes of a LISP Compiler. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1979, v:22, n:3, pp:240-245 [Journal]
  43. Jan-Georg Smaus, François Fages, Pierre Deransart
    Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  44. Pierre Deransart, Jan-Georg Smaus
    Well-Typed Logic Programs Are not Wrong [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  45. Mireille Ducassé, Ludovic Langevine, Pierre Deransart
    Rigorous design of tracers: an experiment for constraint logic programming [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  46. Pierre Deransart, Jan-Georg Smaus
    Subject Reduction of Logic Programs as Proof-Theoretic Property. [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 2002, v:2002, n:, pp:- [Journal]
  47. Gérard Ferrand, Pierre Deransart
    Proof Method of Partial Correctness and Weak Completeness for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1993, v:17, n:2/3&4, pp:265-278 [Journal]
  48. Pierre Deransart, Jan Maluszynski
    Relating Logic Programs and Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1985, v:2, n:2, pp:119-155 [Journal]
  49. Pierre Deransart, Gérard Ferrand
    An Operational Formal Definition of PROLOG: A Specification Method and Its Application. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1992, v:10, n:2, pp:121-172 [Journal]
  50. Pierre Deransart
    Proof Methods of Declarative Properties of Definite Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:118, n:2, pp:99-166 [Journal]
  51. Pierre Deransart, Ludovic Langevine
    Un nouveau traceur générique pour GNU-Prolog. [Citation Graph (0, 0)][DBLP]
    Technique et Science Informatiques, 2003, v:22, n:1, pp:97-110 [Journal]
  52. Pierre Deransart
    On using Tracer Driver for External Dynamic Process Observation [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  53. 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) [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  54. Observational semantics of the Prolog Resolution Box Model [Citation Graph (, )][DBLP]


  55. Towards a Generic Framework to Generate Explanatory Traces of Constraint Solving and Rule-Based Reasoning [Citation Graph (, )][DBLP]


Search in 0.044secs, Finished in 0.048secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002