1322 search results - page 144 / 265 » Unsound Theorem Proving |
189
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
187
click to vote
ECOOP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Generic types in C behave invariantly with respect to subtyping. We propose a system of type-safe variance for C that supports the declaration of covariant and contravari...
186
click to vote
FMCAD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We present a formal verification methodology for datapathdominated hardware. This provides a systematic but flexible framework within which to organize the activities und...
197
click to vote
FSTTCS
1991
Springer
15 years 10 months ago
1991
Springer
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
163
click to vote
ASM
2008
ASM
15 years 8 months ago
2008
ASM
As systems become ever more complex, verification becomes more main stream. Event-B and Alloy are two formal specification languages based on fairly different methodologies. While...