Sciweavers

3047 search results - page 375 / 610
» On the Meaning of Logical Completeness
Sort
View
103
Voted
CCS
2005
ACM
15 years 4 months ago
Formal security analysis of basic network-attached storage
We study formal security properties of network-attached storage (NAS) in an applied pi calculus. We model NAS as an implementation of a specification based on traditional central...
Avik Chaudhuri, Martín Abadi
CCS
2005
ACM
15 years 4 months ago
The framework of selective interleaving functions and the modular assembly kit
The Framework of Selective Interleaving Functions and the Modular Assembly Kit for Security Properties both provide a basis for the uniform representation and formal analysis of n...
Heiko Mantel
97
Voted
EMSOFT
2005
Springer
15 years 4 months ago
Distributing synchronous programs using bounded queues
This paper is about the modular compilation and distribution of a sub-class of Simulink programs [9] across networks using bounded FIFO queues. The problem is first addressed mat...
Marco Zennaro, Raja Sengupta
69
Voted
ICCS
2005
Springer
15 years 4 months ago
Variables in Concept Graphs
A main feature of many logics used in computer science is a means to express quantification. Usually, syntactical devices like variables and quantifiers are used for this purpose...
Frithjof Dau
100
Voted
ICDT
2005
ACM
139views Database» more  ICDT 2005»
15 years 4 months ago
First Order Paths in Ordered Trees
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled t...
Maarten Marx