Sciweavers

2137 search results - page 69 / 428
» Proving Abstract Non-interference
Sort
View
FOSSACS
2006
Springer
15 years 1 months ago
Undecidability Results for Bisimilarity on Prefix Rewrite Systems
Abstract. We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the de...
Petr Jancar, Jirí Srba
IFIPTCS
2000
15 years 1 months ago
An Asynchronous, Distributed Implementation of Mobile Ambients
Abstract We present a first distributed implementation of the CardelliGordon's ambient calculus. We use Jocaml as an implementation language and we present a formal translatio...
Cédric Fournet, Jean-Jacques Lévy, A...
CDC
2009
IEEE
176views Control Systems» more  CDC 2009»
15 years 1 months ago
A characterization of solution sets of LTI differential equations
Abstract— We prove that a controllable set of smooth trajectories is the solution set of a constant coefficient linear differential equation if and only if it is linear, time in...
Jean-Charles Delvenne, Tzvetan Ivanov
AAIM
2010
Springer
155views Algorithms» more  AAIM 2010»
15 years 1 months ago
The (K, k)-Capacitated Spanning Tree Problem
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 1 months ago
The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions
Abstract. We prove asymptotically optimal bounds on the Gaussian noise sensitivity of degree-d polynomial threshold functions. These bounds translate into optimal bounds on the Gau...
Daniel M. Kane