Sciweavers

376 search results - page 22 / 76
» Developing Theories of Types and Computability via Realizabi...
Sort
View
CCA
2009
Springer
13 years 11 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi
POPL
2004
ACM
14 years 7 months ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
TPHOL
2007
IEEE
14 years 1 months ago
Verifying Nonlinear Real Formulas Via Sums of Squares
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
John Harrison
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 7 months ago
The source coding game with a cheating switcher
Motivated by the lossy compression of an active-vision video stream, we consider the problem of finding the rate-distortion function of an arbitrarily varying source (AVS) compos...
Hari Palaiyanur, Cheng Chang, Anant Sahai
ATAL
2003
Springer
14 years 23 days ago
Robust software via agent-based redundancy
This paper describes how multiagent systems can be used to achieve robust software, one of the major goals of software engineering. The paper first positions itself within the sof...
Michael N. Huhns, Vance T. Holderfield, Rosa Laura...