Sciweavers

2137 search results - page 61 / 428
» Proving Abstract Non-interference
Sort
View
CADE
1992
Springer
15 years 2 months ago
IMPS: System Description
network of theories. Results are typically proved in compact, abstract theories, and then transported as needed to more concrete theories, or indeed to Supported by the MITRE-Spon...
William M. Farmer, Joshua D. Guttman, F. Javier Th...
EUROCAST
2007
Springer
108views Hardware» more  EUROCAST 2007»
15 years 1 months ago
Pattern-Based Verification for Trees
Abstract. Pattern-based verification trying to abstract away the concrete number of repeated memory structures is one of the approaches that have recently been proposed for verific...
Milan Ceska, Pavel Erlebach, Tomás Vojnar
FCS
2006
14 years 11 months ago
The Church-Turing-Deutsch Principle in Quantum Computation
This paper is based on the idea that the Church-Turing-Deutsch (CTD) principle can play a very fundamental role in Physics similar to those of conservation laws in the constructio...
P. Prashant
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
14 years 11 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
ANOR
2002
47views more  ANOR 2002»
14 years 10 months ago
Nonparametric Adverse Selection Problems
This article is devoted to adverse selection problems in which individual private information is a whole utility function and cannot be reduced to some finite-dimensional parameter...
Guillaume Carlier