Sciweavers

2432 search results - page 447 / 487
» Cryptographic logical relations
Sort
View
KBSE
2010
IEEE
15 years 2 months ago
Analyzing security architectures
We present a semi-automated approach, Secoria, for analyzing a security runtime architecture for security and for conformance to an object-oriented implementation. Typecheckable a...
Marwan Abi-Antoun, Jeffrey M. Barnes
LICS
2010
IEEE
15 years 2 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...
124
Voted
LOGCOM
2010
143views more  LOGCOM 2010»
15 years 2 months ago
Vietoris Bisimulations
Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation...
Nick Bezhanishvili, Gaëlle Fontaine, Yde Vene...
225
Voted
MST
2010
140views more  MST 2010»
15 years 2 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
NC
2010
179views Neural Networks» more  NC 2010»
15 years 2 months ago
Representation before computation
My main objective is to point out a fundamental weakness in the conventional conception of computation and suggest a promising way out. This weakness is directly related to a gross...
Lev Goldfarb