632 search results - page 24 / 127 » Combining programming with theorem proving |
JSYML
2007
13 years 7 months ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
GI
2001
Springer
14 years 8 days ago
2001
Springer
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
ENTCS
2002
13 years 7 months ago
2002
We give a short description of Hybrid, a new tool for interactive theorem proving, s introduced in [4]. It provides a form of Higher Order Abstract Syntax (HOAS) combined consiste...
ICSE
2005
IEEE-ACM
14 years 7 months ago
2005
IEEE-ACM
We present an automatic error-detection approach that combines static checking and concrete test-case generation. Our approach consists of taking the abstract error conditions inf...
FROCOS
2009
Springer
14 years 2 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...