Sciweavers

82 search results - page 5 / 17
» Scalable error detection using boolean satisfiability
Sort
View
TSP
2008
132views more  TSP 2008»
13 years 7 months ago
Robust Intervention in Probabilistic Boolean Networks
Probabilistic Boolean networks (PBNs) have been recently introduced as a paradigm for modeling genetic regulatory networks. One of the objectives of PBN modeling is to use the netw...
Ranadip Pal, Aniruddha Datta, Edward R. Dougherty
ACSD
2003
IEEE
105views Hardware» more  ACSD 2003»
13 years 10 months ago
Detecting State Coding Conflicts in STG Unfoldings Using SAT
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
LPAR
2005
Springer
14 years 16 days ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...
JSAT
2008
85views more  JSAT 2008»
13 years 7 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren
SPIN
2004
Springer
14 years 11 days ago
Directed Error Detection in C++ with the Assembly-Level Model Checker StEAM
Most approaches for model checking software are based on ration of abstract models from source code, which may greatly reduce the search space, but may also introduce errors that a...
Peter Leven, Tilman Mehler, Stefan Edelkamp