Sciweavers

90 search results - page 14 / 18
» On the Structure of Industrial SAT Instances
Sort
View
ATS
2009
IEEE
111views Hardware» more  ATS 2009»
15 years 4 months ago
Dynamic Compaction in SAT-Based ATPG
SAT-based automatic test pattern generation has several advantages compared to conventional structural procedures, yet often yields too large test sets. We present a dynamic compa...
Alejandro Czutro, Ilia Polian, Piet Engelke, Sudha...
ICST
2010
IEEE
14 years 8 months ago
Timed Moore Automata: Test Data Generation and Model Checking
Abstract—In this paper we introduce Timed Moore Automata, a specification formalism which is used in industrial train control applications for specifying the real-time behavior ...
Helge Löding, Jan Peleska
DAC
2007
ACM
15 years 10 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
ECAI
2008
Springer
14 years 11 months ago
A new Approach for Solving Satisfiability Problems with Qualitative Preferences
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previo...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
IJCAI
2007
14 years 11 months ago
Nogood Recording from Restarts
Abstract. In this paper, nogood recording is investigated for CSP within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to ...
Christophe Lecoutre, Lakhdar Sais, Sébastie...