212 search results - page 22 / 43 » Completeness and Complexity of Bounded Model Checking |
135
click to vote
DATE
2009
IEEE
15 years 8 months ago
2009
IEEE
—Verification is a major issue in circuit and system design. Formal methods like bounded model checking (BMC) can guarantee a high quality of the verification. There are severa...
153
click to vote
FOSSACS
2006
Springer
15 years 5 months ago
2006
Springer
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...
179
click to vote
CSCLP
2008
Springer
15 years 3 months ago
2008
Springer
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
156
click to vote
PODS
1994
ACM
15 years 6 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
137
click to vote
ICDE
2011
IEEE
14 years 5 months ago
2011
IEEE
—Complex SQL queries are widely used today, but it is rather difficult to check if a complex query has been written correctly. Formal verification based on comparing a specifi...