Sciweavers

423 search results - page 52 / 85
» The Generalization of Generalized Automata: Expression Autom...
Sort
View
ACL
1998
13 years 10 months ago
A Descriptive Characterization of Tree-Adjoining Languages (Project Note)
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
James Rogers
ESORICS
2010
Springer
13 years 9 months ago
A Theory of Runtime Enforcement, with Results
This paper presents a theory of runtime enforcement based on mechanism models called MRAs (Mandatory Results Automata). MRAs can monitor and transform security-relevant actions and...
Jay Ligatti, Srikar Reddy
TSE
2010
120views more  TSE 2010»
13 years 7 months ago
Time and Probability-Based Information Flow Analysis
Abstract—In multilevel systems it is important to avoid unwanted indirect information flow from higher levels to lower levels, namely the so called covert channels. Initial stud...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
IANDC
2011
119views more  IANDC 2011»
13 years 3 months ago
Quantitative Kleene coalgebras
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative ...
Alexandra Silva, Filippo Bonchi, Marcello M. Bonsa...
EMSOFT
2004
Springer
14 years 2 months ago
A model-based approach to integrating security policies for embedded devices
Embedded devices like smart cards can now run multiple interacting applications. A particular challenge in this domain is to dynamically integrate diverse security policies. In th...
Michael McDougall, Rajeev Alur, Carl A. Gunter