297 search results - page 8 / 60 » ATS: A Language That Combines Programming with Theorem Provi... |
104
click to vote
ESOP
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
184
click to vote
POPL
2008
ACM
16 years 1 months ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
118
click to vote
FMCAD
2000
Springer
15 years 4 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...
103
click to vote
CPP
2011
14 years 1 months ago
2011
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
101
click to vote
ENTCS
2007
15 years 1 months ago
2007
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...