Sciweavers

82 search results - page 7 / 17
» Selected Methods of Model Checking Using SAT and SMT-Solvers
Sort
View
PRDC
2002
IEEE
15 years 3 months ago
Detecting Feature Interactions in Telecommunication Services with a SAT Solver
Feature interaction is a kind of inconsistent conflict between multiple communication services and considered an obstacle to developing reliable telephony systems. In this paper ...
Tatsuhiro Tsuchiya, Masahide Nakamura, Tohru Kikun...
CORR
2010
Springer
95views Education» more  CORR 2010»
14 years 10 months ago
Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold
We give a new insight into the upper bounding of the 3-SAT threshold by the first moment method. The best criteria developed so far to select the solutions to be counted discrimina...
Thomas Hugel, Yacine Boufkhad
ICST
2010
IEEE
14 years 9 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
KBSE
2007
IEEE
15 years 4 months ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 2 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz