632 search results - page 63 / 127 » Combining programming with theorem proving |
CADE
2005
Springer
14 years 8 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
GG
2004
Springer
14 years 1 months ago
2004
Springer
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
FMCAD
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We present a simple method for verifying the safety properties of cache coherence protocols with arbitrarily many nodes. Our presentation begins with two examples. The fi...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
JSYML
2008
13 years 7 months ago
2008
Abstract. We prove new upper bound theorems on the consistency strengths of SPFA(), SPFA(-linked) and SPFA(+ -cc). Our results are in terms of (, )-subcompactness, which is a new l...