Sciweavers

317 search results - page 15 / 64
» Bounded Model Checking with QBF
Sort
View
101
Voted
DATE
2003
IEEE
100views Hardware» more  DATE 2003»
15 years 9 months ago
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals
: Binary Decision Diagrams (BDDs) have been widely used in synthesis and verification. Boolean Satisfiability (SAT) Solvers, on the other hand, have been gaining
Gianpiero Cabodi, Sergio Nocco, Stefano Quer
98
Voted
CHARME
2003
Springer
87views Hardware» more  CHARME 2003»
15 years 8 months ago
Efficient Distributed SAT and SAT-Based Distributed Bounded Model Checking
Malay K. Ganai, Aarti Gupta, Zijiang Yang, Pranav ...
111
Voted
ATVA
2007
Springer
98views Hardware» more  ATVA 2007»
15 years 7 months ago
Model Checking Bounded Prioritized Time Petri Nets
Bernard Berthomieu, Florent Peres, François...
111
Voted
ATAL
2010
Springer
15 years 4 months ago
Improved bounded model checking for a fair branching-time temporal epistemic logic
Xiaowei Huang, Cheng Luo, Ron van der Meyden