Recent advances in Boolean satisfiability have made it attractive to solve many digital VLSI design problems such as verification and test generation. Fault diagnosis and logic debugging have not been addressed by existing satisfiability-based solutions. This paper attempts to bridge this gap by proposing a model-free satisfiability-based solution to these problems. The proposed formulation is intuitive and easy to implement. It shows that satisfiability captures significant problem characteristics and it offers different trade-offs. It also provides new opportunities for satisfiabilitybased diagnosis tools and diagnosis-specific satisfiability algorithms. Theory and experiments validate the claims and demonstrate its potential.
The diagnosis of a discrete-event system is the problem of computing possible behaviors of the syste...
We show how testing whether a system is diagnosable can be reduced to the satisfiability problem and...
Abstract. This paper proposes a new algorithm for solving the Boolean satisfiability (SAT) problem. ...
Abstract — Recent advances in Boolean satisfiability have made it an attractive engine for solving m...
Logic debugging of today's complex sequential circuits is an important problem. In this paper, ...
Due to the increasing complexity of today’s circuits a high degree of automation in the design proce...
We propose a new method for SAT-based Boolean reasoning on multiple defects in digital ICs. Although...
Abstract—Equivalence checking and property checking are powerful techniques to detect error traces. ...
This work extends to the switch level the verification and testing techniques based upon boolean sat...
Abstract—Debugging significantly slows down the design pro-cess of complex systems. Only limited too...
Boolean satisfiability has been successfully applied to various problems in electronic design automa...
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation (EDA). It finds...
International audienceEquivalence checking and property checking are powerful techniques to detect e...
An Automatic Test Pattern Generator is an indispensable tool in the production of reliable computer ...
Currently, Very Large Scale Integrated (VLSI) circuits and the resulting digital systems are widely ...
The diagnosis of a discrete-event system is the problem of computing possible behaviors of the syste...
We show how testing whether a system is diagnosable can be reduced to the satisfiability problem and...
Abstract. This paper proposes a new algorithm for solving the Boolean satisfiability (SAT) problem. ...
Abstract — Recent advances in Boolean satisfiability have made it an attractive engine for solving m...
Logic debugging of today's complex sequential circuits is an important problem. In this paper, ...
Due to the increasing complexity of today’s circuits a high degree of automation in the design proce...
We propose a new method for SAT-based Boolean reasoning on multiple defects in digital ICs. Although...
Abstract—Equivalence checking and property checking are powerful techniques to detect error traces. ...
This work extends to the switch level the verification and testing techniques based upon boolean sat...
Abstract—Debugging significantly slows down the design pro-cess of complex systems. Only limited too...
Boolean satisfiability has been successfully applied to various problems in electronic design automa...
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation (EDA). It finds...
International audienceEquivalence checking and property checking are powerful techniques to detect e...
An Automatic Test Pattern Generator is an indispensable tool in the production of reliable computer ...
Currently, Very Large Scale Integrated (VLSI) circuits and the resulting digital systems are widely ...
The diagnosis of a discrete-event system is the problem of computing possible behaviors of the syste...
We show how testing whether a system is diagnosable can be reduced to the satisfiability problem and...
Abstract. This paper proposes a new algorithm for solving the Boolean satisfiability (SAT) problem. ...