2005 |
30 | EE | Olivier Ponsini,
Carine Fédèle,
Emmanuel Kounalis:
Rewriting of imperative programs into logical equations.
Sci. Comput. Program. 56(3): 363-401 (2005) |
2004 |
29 | EE | Pascal Urso,
Emmanuel Kounalis:
Sound generalizations in mathematical induction.
Theor. Comput. Sci. 323(1-3): 443-471 (2004) |
2003 |
28 | EE | Pascal Urso,
Emmanuel Kounalis:
"Term Partition" for Mathematical Induction.
RTA 2003: 352-366 |
2002 |
27 | | Pascal Urso,
Emmanuel Kounalis:
Généralisations correctes pour l'induction mathématique.
JFPLC 2002: 211- |
1999 |
26 | EE | Carine Fédèle,
Emmanuel Kounalis:
Automatic Proofs of Properties of Simple C-- Modules.
ASE 1999: 283-286 |
25 | | Emmanuel Kounalis,
Pascal Urso:
Generalization Discovery for Proofs by Induction in Conditional Theories.
FLAIRS Conference 1999: 250-256 |
24 | | Emmanuel Kounalis,
Pascal Urso:
Mechanizing Proofs of Integrity Constraints in the Situation Calculus.
IEA/AIE 1999: 372-381 |
1995 |
23 | | Emmanuel Kounalis,
Michaël Rusinowitch:
Reasoning with Conditional Axioms.
Ann. Math. Artif. Intell. 15(2): 125-149 (1995) |
22 | | Adel Bouhoula,
Emmanuel Kounalis,
Michaël Rusinowitch:
Automated Mathematical Induction.
J. Log. Comput. 5(5): 631-668 (1995) |
1994 |
21 | | Jacques Chazarain,
Emmanuel Kounalis:
Mechanizable Inductive Proofs for a Class of Forall Exists Formulas.
CADE 1994: 118-132 |
1992 |
20 | | Emmanuel Kounalis:
A Simplification-Based Approach to Program Synthesis.
ECAI 1992: 82-86 |
19 | | Adel Bouhoula,
Emmanuel Kounalis,
Michaël Rusinowitch:
SPIKE, an Automatic Theorem Prover.
LPAR 1992: 460-462 |
18 | | Emmanuel Kounalis:
Testing for the Ground (Co-)Reducibility Property in Term-Rewriting Systems.
Theor. Comput. Sci. 106(1): 87-117 (1992) |
1991 |
17 | | Emmanuel Kounalis,
Michaël Rusinowitch:
Studies on the Ground Convergence Property of Conditional Theories.
AMAST 1991: 363-376 |
16 | | Emmanuel Kounalis,
Michaël Rusinowitch:
Automatic Proof Methods for Algebraic Specifications.
FCT 1991: 307-317 |
15 | | Emmanuel Kounalis,
Denis Lugiez,
Loic Pottier:
A Solution of the Complement Problem in Associative-Commutative Theories.
IWWERT 1991: 197-214 |
14 | | Emmanuel Kounalis,
Denis Lugiez,
Loic Pottier:
A Solution of the Complement Problem in Associative-Commutative Theories.
MFCS 1991: 287-297 |
13 | | Emmanuel Kounalis,
Denis Lugiez:
Compilation of Pattern Matching with Associative-Commutative Functions.
TAPSOFT, Vol.1 1991: 57-73 |
12 | | Emmanuel Kounalis,
Michaël Rusinowitch:
On Word Problems in Horn Theories.
J. Symb. Comput. 11(1/2): 113-127 (1991) |
1990 |
11 | | Emmanuel Kounalis,
Michaël Rusinowitch:
Mechanizing Inductive Reasoning.
AAAI 1990: 240-245 |
10 | | Emmanuel Kounalis:
Testing for Inductive (Co)-Reducibility.
CAAP 1990: 221-238 |
9 | | Emmanuel Kounalis,
Michaël Rusinowitch:
A Proof System for Conditional Algebraic Specifications.
CTRS 1990: 51-63 |
8 | | Emmanuel Kounalis:
Pumping Lemmas for Tree Languages Generated by Rewrite Systems.
MFCS 1990: 369-377 |
7 | | Emmanuel Kounalis,
Michaël Rusinowitch:
Mechanizing inductive reasoning.
Bulletin of the EATCS 41: 216-226 (1990) |
1989 |
6 | | Jean-Pierre Jouannaud,
Emmanuel Kounalis:
Automatic Proofs by Induction in Theories without Constructors
Inf. Comput. 82(1): 1-33 (1989) |
1988 |
5 | | Emmanuel Kounalis,
Michaël Rusinowitch:
On Word Problems in Horn Theories.
CADE 1988: 527-537 |
1987 |
4 | | Emmanuel Kounalis,
Michaël Rusinowitch:
On Word Problems in Horn Theories.
CTRS 1987: 144-160 |
1986 |
3 | | Jean-Pierre Jouannaud,
Emmanuel Kounalis:
Automatic Proofs by Induction in Equational Theories Without Constructors
LICS 1986: 358-366 |
1985 |
2 | | Emmanuel Kounalis:
Completeness in Data Type Specifications.
European Conference on Computer Algebra (2) 1985: 348-362 |
1 | | Jean-Pierre Jouannaud,
Emmanuel Kounalis:
Proofs by induction in equational theories without constructors.
Bulletin of the EATCS 27: 49-55 (1985) |