The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. Kokichi Futatsugi, Joseph A. Goguen, Jean-Pierre Jouannaud, José Meseguer
    Principles of OBJ2. [Citation Graph (2, 0)][DBLP]
    POPL, 1985, pp:52-66 [Conf]
  2. Joseph A. Goguen, Jean-Pierre Jouannaud, José Meseguer
    Operational Semantics for Order-Sorted Algebra. [Citation Graph (1, 0)][DBLP]
    ICALP, 1985, pp:221-231 [Conf]
  3. Jean-Pierre Jouannaud
    Introduction to Rewriting. [Citation Graph (0, 0)][DBLP]
    Term Rewriting, 1993, pp:1-15 [Conf]
  4. Jean-Pierre Jouannaud
    Programming and Checking Data Types with REVE. [Citation Graph (0, 0)][DBLP]
    ADT, 1983, pp:- [Conf]
  5. Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner, Aristide Mégrelis
    OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization. [Citation Graph (0, 0)][DBLP]
    ALP, 1988, pp:41-52 [Conf]
  6. Jean-Pierre Jouannaud
    Theorem Proving Languages for Verification. [Citation Graph (0, 0)][DBLP]
    ATVA, 2004, pp:11-14 [Conf]
  7. Jacek Chrzaszcz, Jean-Pierre Jouannaud
    From OBJ to ML to Coq. [Citation Graph (0, 0)][DBLP]
    Essays Dedicated to Joseph A. Goguen, 2006, pp:216-234 [Conf]
  8. Jean-Pierre Jouannaud
    Higher-Order Rewriting: Framework, Confluence and Termination. [Citation Graph (0, 0)][DBLP]
    Processes, Terms and Cycles, 2005, pp:224-250 [Conf]
  9. Jean-Pierre Jouannaud, Claude Kirchner
    Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification. [Citation Graph (0, 0)][DBLP]
    Computational Logic - Essays in Honor of Alan Robinson, 1991, pp:257-321 [Conf]
  10. Jean-Pierre Jouannaud
    Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data Types. [Citation Graph (0, 0)][DBLP]
    CAAP, 1983, pp:269-283 [Conf]
  11. Jieh Hsiang, Jean-Pierre Jouannaud
    Tutorial on Rewrite-Based Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:684- [Conf]
  12. Jean-Pierre Jouannaud, Miguel Munoz
    Termination of a Set of Rules Modulo a Set of Equations. [Citation Graph (0, 0)][DBLP]
    CADE, 1984, pp:175-193 [Conf]
  13. Jean-Pierre Jouannaud, Ralf Treinen
    Constraints and Constraint Solving: An Introduction. [Citation Graph (0, 0)][DBLP]
    CCL, 1999, pp:1-46 [Conf]
  14. Maribel Fernández, Jean-Pierre Jouannaud
    Modular Termination of Term Rewriting Systems Revisited. [Citation Graph (0, 0)][DBLP]
    COMPASS/ADT, 1994, pp:255-272 [Conf]
  15. Jean-Pierre Jouannaud
    Rewriting Techniques for Software Engineering. [Citation Graph (0, 0)][DBLP]
    COMPASS/ADT, 1992, pp:30-52 [Conf]
  16. Jean-Pierre Jouannaud, Walid Sadfi
    Strong Sequentiality of Left-Linear Overlapping Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1994, pp:235-246 [Conf]
  17. Jean-Pierre Jouannaud, Claude Marché
    Completion modulo Associativity, Commutativity and Identity (AC1). [Citation Graph (0, 0)][DBLP]
    DISCO, 1990, pp:111-120 [Conf]
  18. Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner
    Incremental Construction of Unification Algorithms in Equational Theories. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:361-373 [Conf]
  19. Jean-Pierre Jouannaud, Mitsuhiro Okada
    Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:455-468 [Conf]
  20. Jean-Pierre Jouannaud, Gérard D. Guiho, Jean-Pierre Treuil
    SISP/1: An Interactive System Able to Synthesize Functions from Examples. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1977, pp:412-418 [Conf]
  21. Jean-Pierre Jouannaud, Hélène Kirchner, Jean-Luc Remy
    Church-Rosser Properties of Weakly Terminating Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1983, pp:909-915 [Conf]
  22. Claude Kirchner, Hélène Kirchner, Jean-Pierre Jouannaud
    Algebraic Manipulations as a Unification and Matching Strategy for Linear Equations in Signed Binary Trees. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1981, pp:1016-1023 [Conf]
  23. Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß
    Unification in Free Extensions of Boolean Rings and Abelian Groups [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:121-130 [Conf]
  24. Adel Bouhoula, Jean-Pierre Jouannaud
    Automata-Driven Automated Induction. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:14-25 [Conf]
  25. Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud
    Decidable Problems in Shallow Equational Theories (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1992, pp:255-265 [Conf]
  26. Jean-Pierre Jouannaud, Emmanuel Kounalis
    Automatic Proofs by Induction in Equational Theories Without Constructors [Citation Graph (0, 0)][DBLP]
    LICS, 1986, pp:358-366 [Conf]
  27. Jean-Pierre Jouannaud, Mitsuhiro Okada
    A Computation Model for Executable Higher-Order Algebraic Specification Languages [Citation Graph (0, 0)][DBLP]
    LICS, 1991, pp:350-361 [Conf]
  28. Jean-Pierre Jouannaud, Albert Rubio
    The Higher-Order Recursive Path Ordering. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:402-411 [Conf]
  29. Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio
    Higher-Order Termination: From Kruskal to Computability. [Citation Graph (0, 0)][DBLP]
    LPAR, 2006, pp:1-14 [Conf]
  30. Jean-Pierre Jouannaud
    Syntactic Theories. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:15-25 [Conf]
  31. Jean-Pierre Jouannaud, Hélène Kirchner
    Completion of a Set of Rules Modulo a Set of Equations. [Citation Graph (0, 0)][DBLP]
    POPL, 1984, pp:83-92 [Conf]
  32. Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
    The Calculus of algebraic Constructions. [Citation Graph (0, 0)][DBLP]
    RTA, 1999, pp:301-316 [Conf]
  33. Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop
    Open Problems in Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:445-456 [Conf]
  34. Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop
    More Problems in Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:468-487 [Conf]
  35. Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop
    Problems in Rewriting III. [Citation Graph (0, 0)][DBLP]
    RTA, 1995, pp:457-471 [Conf]
  36. Jean-Pierre Jouannaud
    Twenty Years Later. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:368-375 [Conf]
  37. Jean-Pierre Jouannaud
    Modular Church-Rosser Modulo. [Citation Graph (0, 0)][DBLP]
    RTA, 2006, pp:96-107 [Conf]
  38. Jean-Pierre Jouannaud, Albert Rubio
    Higher-Order Orderings for Normal Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2006, pp:387-399 [Conf]
  39. Jean-Pierre Jouannaud, Albert Rubio
    A Recursive Path Ordering for Higher-Order Terms in eta-Long beta-Normal Form. [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:108-122 [Conf]
  40. Jean-Pierre Jouannaud
    Executable Higher-Order Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:16-25 [Conf]
  41. Adel Bouhoula, Jean-Pierre Jouannaud, José Meseguer
    Specification and Proof in Membership Equational Logic. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:67-92 [Conf]
  42. Hubert Comon, Mehmet Dincbas, Jean-Pierre Jouannaud, Claude Kirchner
    A Methodological View of Constraint Solving. [Citation Graph (0, 0)][DBLP]
    Constraints, 1999, v:4, n:4, pp:337-361 [Journal]
  43. Nachum Dershowitz, Jean-Pierre Jouannaud
    Notations for Rewting. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1991, v:43, n:, pp:162-174 [Journal]
  44. Jean-Pierre Jouannaud, Emmanuel Kounalis
    Proofs by induction in equational theories without constructors. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:27, n:, pp:49-55 [Journal]
  45. Jean-Pierre Jouannaud
    Membership equational logic, calculus of inductive instructions, and rewrite logic. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:15, n:, pp:- [Journal]
  46. Jean-Pierre Jouannaud, Weiwen Xu
    Automatic Complexity Analysis for Programs Extracted from Coq Proof. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:153, n:1, pp:35-53 [Journal]
  47. Adel Bouhoula, Jean-Pierre Jouannaud
    Automata-Driven Automated Induction. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:169, n:1, pp:1-22 [Journal]
  48. Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud
    Syntacticness, Cycle-Syntacticness, and Shallow Theories [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:111, n:1, pp:154-191 [Journal]
  49. Jean-Pierre Jouannaud, Emmanuel Kounalis
    Automatic Proofs by Induction in Theories without Constructors [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:82, n:1, pp:1-33 [Journal]
  50. Jean-Pierre Jouannaud, Pierre Lescanne
    On Multiset Orderings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:2, pp:57-63 [Journal]
  51. Jean-Pierre Jouannaud, Hélène Kirchner
    Construction D'un Plus Petit Odre de Simplification. [Citation Graph (0, 0)][DBLP]
    ITA, 1984, v:18, n:3, pp:191-208 [Journal]
  52. Jean-Pierre Jouannaud, Albert Rubio
    Polymorphic higher-order recursive path orderings. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:1, pp:- [Journal]
  53. Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner, Aristide Mégrelis
    Programming with Equalitiers, Subsorts, Overloading and Parametrization in OBJ. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1992, v:12, n:3&4, pp:257-279 [Journal]
  54. Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß
    Unification in Boolean Rings and Abelian Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:8, n:5, pp:449-477 [Journal]
  55. Jean-Pierre Jouannaud, Hélène Kirchner
    Completion of a Set of Rules Modulo a Set of Equations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:4, pp:1155-1194 [Journal]
  56. Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
    Inductive-data-type systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:272, n:1-2, pp:41-68 [Journal]
  57. Adel Bouhoula, Jean-Pierre Jouannaud, José Meseguer
    Specification and proof in membership equational logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:236, n:1-2, pp:35-132 [Journal]
  58. Jean-Pierre Jouannaud, Claude Marché
    Termination and Completion Modulo Associativity, Commutativity and Identity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:104, n:1, pp:29-51 [Journal]
  59. Jean-Pierre Jouannaud, Mitsuhiro Okada
    Abstract Data Type Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:173, n:2, pp:349-391 [Journal]
  60. Jean-Pierre Jouannaud, Albert Rubio
    Rewrite Orderings for Higher-Order Terms in eta-Long beta-Normal Form and Recursive Path Ordering. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:208, n:1-2, pp:33-58 [Journal]
  61. Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub
    Building Decision Procedures in the Calculus of Inductive Constructions. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:328-342 [Conf]
  62. Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio
    HORPO with Computability Closure: A Reconstruction. [Citation Graph (0, 0)][DBLP]
    LPAR, 2007, pp:138-150 [Conf]
  63. Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
    The Calculus of Algebraic Constructions [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  64. Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
    Inductive-data-type Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  65. Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio
    Higher-Order Termination: from Kruskal to Computability [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  66. Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub
    Building Decision Procedures in the Calculus of Inductive Constructions [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  67. Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio
    HORPO with Computability Closure : A Reconstruction [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  68. Jean-Pierre Jouannaud, Ian Mackie
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:171, n:3, pp:1-2 [Journal]

  69. The Computability Path Ordering: The End of a Quest. [Citation Graph (, )][DBLP]


  70. Diagrammatic Confluence and Completion. [Citation Graph (, )][DBLP]


  71. From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures. [Citation Graph (, )][DBLP]


  72. From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures [Citation Graph (, )][DBLP]


  73. The computability path ordering: the end of a quest [Citation Graph (, )][DBLP]


Search in 0.024secs, Finished in 0.029secs
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