Sciweavers

303 search results - page 27 / 61
» Unifying Theories of Confidentiality
Sort
View
JUCS
2007
95views more  JUCS 2007»
13 years 9 months ago
Equivalent Transformations of Automata by Using Behavioural Automata
: This paper uses category theory to emphasize the relationships between Mealy, Moore and Rabin-Scott automata, and the behavioural automata are used as a unifying framework. Some ...
Gabriel Ciobanu, Sergiu Rudeanu
UTP
2010
13 years 7 months ago
Specification Coverage for Testing in Circus
Abstract. The Unifying Theories of Programming underpins the development of Circus, a state-rich process algebra for refinement. We have previously presented a theory of testing fo...
Ana Cavalcanti, Marie-Claude Gaudel
ICIP
2009
IEEE
13 years 7 months ago
Geometrical plenoptic sampling
In this paper, we present a general framework for analysis of plenoptic sampling by investigating the spectral analysis of plenoptic imaging. The proposed framework provides a uni...
Chong Chen, Dan Schonfeld
POPL
2006
ACM
14 years 10 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
NIPS
1998
13 years 11 months ago
Gradient Descent for General Reinforcement Learning
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
Leemon C. Baird III, Andrew W. Moore