1410 search results - page 141 / 282 » Proving theorems by reuse |
130
click to vote
ALP
1990
Springer
15 years 10 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
159
click to vote
ATVA
2006
Springer
15 years 9 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...
180
click to vote
CAV
2006
Springer
15 years 9 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...
183
click to vote
ECOOP
2006
Springer
15 years 9 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...
177
click to vote
FMCAD
2000
Springer
15 years 9 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...