Adel Bouhoula, Jean-Pierre Jouannaud, José Meseguer  Home/Search
Context Related
| loria.fr/~bouhoula...uhoulaJMCAAP97.ps lri.fr/LRI/article...pmeltapsoft.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: loria.fr/~bouhoula...publications (more) From: fermivista.math.juss...ftp.lri.fr (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper is part of a long term effort to increase expressiveness of algebraic specification languages while at the same time having a simple semantic basis on which efficient execution by rewriting and powerful theorem-proving tools can be based. In particular, our rewriting techniques provide semantic foundations for Maude's functional sublanguage, where they have been efficiently implemented. Membership equational logic is quite simple, and yet quite powerful. Its atomic formulae are... (Update)
Cited by: More
Representing the MSR Cryptoprotocol Specification Language.. - Cervesato, Stehr (2005) (Correct)
Relational Analysis of Algebraic Datatypes - Viktor Kuncak Massachusetts (2005) (Correct)
On Relational Analysis of Algebraic Datatypes - Kuncak, Jackson (Correct)
Active bibliography (related documents): More All
0.7: Membership Algebra as a Logical Framework for Equational.. - Meseguer (1998) (Correct)
0.5: Covariance and Contravariance: Conflict without a Cause - Castagna (1994) (Correct)
0.3: Automata-Driven Automated Induction - Bouhoula, Jouannaud (1996) (Correct)
Similar documents based on text: More All
0.6: Interpreting Abstract Interpretations in Membership . . . - Fischer, Rosu (2001) (Correct)
0.2: Automated Theorem Proving by Test Set Induction - Bouhoula (1997) (Correct)
0.2: Automated Verification by Induction with.. - Berregeb, Bouhoula.. (1995) (Correct)
Related documents from co-citation: More All
30: Conditional rewriting logic as a unified model of concurrency (context) - Meseguer - 1992
23: Maude: Specification and programming in rewriting logic - Clavel, Dur'an et al. - 1999
22: Axiomatizing Reflective Logics and Languages - Clavel, Meseguer - 1996
BibTeX entry: (Update)
Adel Bouhoula, Jean-Pierre Jouannaud, and Jos'e Meseguer. Specification and proof in membership equational logic. Draft, 1996. http://citeseer.ist.psu.edu/bouhoula96specification.html More
@article{ bouhoula00specification,
author = "Adel Bouhoula and Jean-Pierre Jouannaud and Jos{\'e} Meseguer",
title = "Specification and proof in membership equational logic",
journal = "Theoretical Computer Science",
volume = "236",
number = "1--2",
pages = "35--132",
year = "2000",
url = "citeseer.ist.psu.edu/bouhoula96specification.html" }
Citations (may not include all citations):173 Order-sorted algebra I: Equational deduction for multiple in.. - Goguen, Meseguer - 1992
173 An initial algebra approach to the specification (context) - Goguen, Thatcher et al. - 1978
106 Principles of Maude - Lincoln, Clavel et al. - 1996
75 Completion of rewrite systems with membership constraints - Comon - 1992
51 Specification and proof in membership equational logic - Bouhoula, Jouannaud et al. - 1996
47 A rationale for conditional equational programming (context) - Dershowitz, Okada - 1990
45 Jean-Pierre Jouannaud (context) - Futatsugi, Goguen - 1985
45 Operational semantics for order-sorted algebra (context) - Goguen, Jouannaud et al. - 1985
43 Theoretical Computer Science (context) - Kaplan, rules - 1984
41 Encompassment properties and automata with constraints (context) - Caron, Coquid'e et al. - 1993
34 Equational formulae with membership constraints - Comon, Delor - 1994
34 and Partial Algebras (context) - Reichel, Algebraic - 1987
21 Automata-driven automated induction - Bouhoula, Jouannaud - 1996
15 Dynamically-typed computations for order-sorted equational p.. - Hintermeier, Kirchner et al. - 1994
15 Tree automata help one to solve equational formulae in ac-th.. - Lugiez, Moysset - 1994
15 Inductive proofs by specifications transformation (context) - Comon - 1989
12 Automated Theorem Proving by Test Set Induction - Bouhoula
9 Ground reducibility and automata with disequality constraint.. - Comon, Jacquemard - 1994
8 Order-sorted Horn logic: Semantics and deduction (context) - Smolka - 1986
5 Reductive conditional term rewriting systems (context) - Jouannaud, Waldmann - 1986
4 Parallel programming in Maude (context) - M'eseguer, Winkler - 1991
4 Lecture at the Dagstuhl Seminar on Specification and Semanti.. (context) - Meseguer - 1996
2 Springer Lecture Notes in Mathematics No (context) - Gabriel, Ulmer et al. - 1971
2 overloading and parametrization (context) - Jouannaud, Kirchner et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.loria.fr/~bouhoula/publications.html): More
Automated Mathematical Induction - Bouhoula, Kounalis, Rusinowitch (1992) (Correct)
Using Induction and Rewriting to Verify and Complete.. - Bouhoula (1996) (Correct)
SPIKE User Manual - Bouhoula, Rusinowitch (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC