Sciweavers

2436 search results - page 23 / 488
» Comonadic Notions of Computation
Sort
View
TCS
2010
13 years 2 months ago
A comparison of semantic models for noninterference
The literature on definitions of security based on causality-like notions such as noninterference has used several distinct semantic models for systems. Early work was based on st...
Ron van der Meyden, Chenyi Zhang
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 7 months ago
Liberalizing Dependency
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...
Avik Chaudhuri
BSL
2005
74views more  BSL 2005»
13 years 7 months ago
Turing computations on ordinals
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length to computations on tapes of arbitrary ordinal length. We show that a ...
Peter Koepke
SIAMCOMP
2000
106views more  SIAMCOMP 2000»
13 years 7 months ago
Computationally Sound Proofs
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
Silvio Micali
ASM
2005
ASM
14 years 1 months ago
Scenario based Analysis of Linear Computations
Abstract. In this paper we consider the following task: given an abstract state machine, characterize the subsets of initial values corresponding to different typical scenarios of...
Vladimir Filatov, Rostislav Yavorskiy