1302 search results - page 157 / 261 » Free-Style Theorem Proving |
167
click to vote
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
187
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...
186
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...
184
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...
195
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...