3228 search results - page 192 / 646 » Computationally Sound Proofs |
137
click to vote
SCP
2010
15 years 5 months ago
2010
Refinement is the notion of development between formal specifications. For specifications given in a relational formalism, downward and upward simulations are the standard meth...
180
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
133
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We prove that interactive learning based classical realizability (introduced by Aschieri and Berardi for first order arithmetic [1]) is sound with respect to Coquand game...
162
click to vote
CPP
2011
14 years 6 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...
149
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Nonlinear dynamical and control systems are an important source of applications for theories of computation over the the real numbers, since these systems are usually to complicate...