364 search results - page 64 / 73 » Model checking with Boolean Satisfiability |
ICCAD
2009
IEEE
13 years 6 months ago
2009
IEEE
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
FOSSACS
2001
Springer
14 years 1 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
CCGRID
2006
IEEE
14 years 2 months ago
2006
IEEE
Component-based software construction is widely used in a variety of applications, from embedded environments to grid computing. However, errors in these applications and systems ...
IQ
2007
13 years 10 months ago
2007
: This research has attempted to find the impact of information quality (IQ) and system quality (SQ) on users’ attitude to adopt the interactive TV based auction service. The pri...
AAAI
2006
13 years 10 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...