15 search results - page 2 / 3 » Extending Sledgehammer with SMT Solvers |
207
Voted
FROCOS
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Isabelle/HOL is a popular interactive theorem prover based on higherorder logic. It owes its success to its ease of use and powerful automation. Much of the automation is...
95
Voted
INFORMATICALT
2010
15 years 9 days ago
2010
The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware veri...
115
Voted
KBSE
2009
IEEE
15 years 8 months ago
2009
IEEE
Propositional bounded model checking has been applied successfully to verify embedded software but is limited by the increasing propositional formula size and the loss of structur...
121
click to vote
ICSE
2010
IEEE-ACM
15 years 3 months ago
2010
IEEE-ACM
The transition from single-core to multi-core processors has made multi-threaded software an important subject over the last years in computer-aided verification. Model checkers ...
112
Voted
RTA
2010
Springer
15 years 5 months ago
2010
Springer
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...