#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1985

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jean-Pierre Jouannaud, Emmanuel Kounalis
- Inf. Comput.
- 1989

- Emmanuel Kounalis, Michaël Rusinowitch
- Bulletin of the EATCS
- 1990

Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We present a new method to prove (and disprove) automatically inductive properties. Given a set of axioms, a well-suited induction scheme is constructed automatically. We call such a… (More)

- Jean-Pierre Jouannaud, Emmanuel Kounalis
- LICS
- 1986

- Emmanuel Kounalis
- Theor. Comput. Sci.
- 1992

- Pascal Urso, Emmanuel Kounalis
- Theor. Comput. Sci.
- 2004

- Adel Bouhoula, Emmanuel Kounalis, Michaël Rusinowitch
- J. Log. Comput.
- 1995

Proofs by induction are important in many computer science and artiicial intelligence applications , in particular, in program veriication and speciication systems. We present a new method to prove (and disprove) automatically inductive properties. Given a set of axioms, a well-suited induction scheme is constructed automatically. We call such an induction… (More)

- Emmanuel Kounalis
- European Conference on Computer Algebra
- 1985

- Olivier Ponsini, Carine Fédèle, Emmanuel Kounalis
- Sci. Comput. Program.
- 2005

This paper describes SOSSubC: a system for automatically translating programs written in SubC, a simple imperative language, into a set of first-order equations. This set of equations represents a SubC program and has a precise mathematical meaning; moreover, the standard techniques for mechanizing equational reasoning can be used for verifying properties… (More)

- Emmanuel Kounalis, Michaël Rusinowitch
- AMAST
- 1991