923 search results - page 129 / 185 » Proving the value of formal methods |
148
click to vote
APAL
2002
15 years 6 months ago
2002
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An ...
159
click to vote
CAV
2007
Springer
16 years 15 days ago
2007
Springer
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
138
click to vote
CICLING
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. Language software applications encounter new words, e.g., acronyms, technical terminology, names or compounds of such words. In order to add new words to a lexicon, we ne...
185
click to vote
TPHOL
2008
IEEE
16 years 21 days ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
147
click to vote
FMCAD
2007
Springer
16 years 15 days ago
2007
Springer
—When model-checking reports that a property holds on a model, vacuity detection increases user confidence in this result by checking that the property is satisfied in the inte...