• 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
TLDR
A unified framework for the verification of synchronous circuits is presented. Expand
  • 220
  • 18
  • PDF
Verification of Synchronous Sequential Machines Based on Symbolic Execution
TLDR
This paper presents an original method to compare two synchronous sequential machines using a symbolic execution of the product machine. Expand
  • 416
  • 16
  • PDF
New Ideas for Solving Covering Problems
TLDR
We present a better lower bound computation algorithm and two new pruning techniques that significantly improve the efficiency of covering problem solvers. Expand
  • 80
  • 11
  • PDF
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
TLDR
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
  • 182
  • 8
  • PDF
A unified framework for the formal verification of sequential circuits
TLDR
A unified framework for the verification of synchronous circuits is presented. Expand
  • 146
  • 7
Verifying Temporal Properties of Sequential Machines Without Building their State Diagrams
TLDR
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
  • 146
  • 6
  • PDF
Automating the diagnosis and the rectification of design errors with PRIAM
TLDR
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
  • 68
  • 5
Fault Tree Analysis: 1020 Prime Implicants and Beyond
TLDR
The performances of almost all available fault tree analysis tools are limited by the performance of the prime implicant computation procedure they use. Expand
  • 74
  • 4
  • PDF
New ideas on symbolic manipulations of finite state machines
TLDR
Formal verification of finite state machines (FSM) using symbolic manipulations is addressed. Expand
  • 62
  • 3
A new method to compute prime and essential prime implicants of Boolean functions
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 circuitExpand
  • 52
  • 3
  • PDF
...
1
2
3
4
...