923 search results - page 104 / 185 » Proving the value of formal methods |
165
click to vote
CHARME
2003
Springer
15 years 11 months ago
2003
Springer
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
220
click to vote
POPL
2011
ACM
14 years 9 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
197
click to vote
CP
2010
Springer
15 years 4 months ago
2010
Springer
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
265
click to vote
ECOOP
2009
Springer
16 years 7 months ago
2009
Springer
Software frameworks impose constraints on how plugins may interact with them. Many of hese constraints involve multiple objects, are temporal, and depend on runtime values. Additi...
177
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...