1322 search results - page 28 / 265 » Unsound Theorem Proving |
152
click to vote
PLDI
2003
ACM
15 years 9 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
137
click to vote
TABLEAUX
2005
Springer
15 years 9 months ago
2005
Springer
The Intuitionistic Logic Theorem Proving (ILTP) Library provides a platfom for testing and benchmarking theorem provers for first-order intuitionistic logic. It includes a collect...
132
click to vote
FASE
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
129
Voted
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
136
click to vote
ISOLA
2007
Springer
15 years 10 months ago
2007
Springer
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...