J. Madre

Publications
Influence

A unified framework for the formal verification of sequential circuits

O. Coudert, J. Madre
Computer Science
IEEE International Conference on Computer-Aided…
1990

A unified framework for the verification of synchronous circuits is presented. Expand

Verification of Synchronous Sequential Machines Based on Symbolic Execution

O. Coudert, C. Berthet, J. Madre
Computer Science
Automatic Verification Methods for Finite State…
12 June 1989

This paper presents an original method to compare two synchronous sequential machines using a symbolic execution of the product machine. Expand

New Ideas for Solving Covering Problems

O. Coudert, J. Madre
Computer Science
32nd Design Automation Conference
1995

We present a better lower bound computation algorithm and two new pruning techniques that significantly improve the efficiency of covering problem solvers. Expand

Implicit and incremental computation of primes and essential primes of Boolean functions

O. Coudert, J. Madre
Computer Science
[] Proceedings 29th ACM/IEEE Design Automation…
1 July 1992

We use implicit set manipulation techniques to compute and manipulate implicitly large sets of prime and essential prime implicants of incompletely specified Boolean functions. Expand

A unified framework for the formal verification of sequential circuits

O. Coudert, J. Madre
Computer Science
ICCAD
11 November 1990

A unified framework for the verification of synchronous circuits is presented. Expand

Verifying Temporal Properties of Sequential Machines Without Building their State Diagrams

O. Coudert, J. Madre, C. Berthet
Computer Science
CAV
18 June 1990

This paper presents the algorithm we have developed for proving that a finite state machine holds some properties expressed in temporal logic using Boolean function manipulations, which are represented by typed decision graphs. Expand

Automating the diagnosis and the rectification of design errors with PRIAM

J. Madre, O. Coudert, J. Billon
Computer Science
ICCAD
5 November 1989

The authors present the original extensions brought to PRIAM to automate both the diagnosis and the rectification of the design errors detected by this tool. Expand

Fault Tree Analysis: 1020 Prime Implicants and Beyond

O. Coudert, J. Madre
Computer Science
1993

The performances of almost all available fault tree analysis tools are limited by the performance of the prime implicant computation procedure they use. Expand

New ideas on symbolic manipulations of finite state machines

C. Berthet, O. Coudert, J. Madre
Computer Science
Proceedings., IEEE International Conference on…
17 September 1990

Formal verification of finite state machines (FSM) using symbolic manipulations is addressed. Expand

A new method to compute prime and essential prime implicants of Boolean functions

J. Madre, O. Coudert
Mathematics
1992

Computing the prime implicants and the essential prime implicants of Boolean functions is a problem that has applications in several areas of computer science, for instance it is critical in circuit… Expand

Recommended Authors