Sciweavers

512 search results - page 96 / 103
» Automata as Abstractions
Sort
View
ENTCS
2006
145views more  ENTCS 2006»
13 years 7 months ago
A Classification of Time and/or Probability Dependent Security Properties
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 studnformation ...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
ITA
2007
153views Communications» more  ITA 2007»
13 years 7 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
JUCS
2010
130views more  JUCS 2010»
13 years 5 months ago
On the Linear Number of Matching Substrings
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
Yo-Sub Han
MST
2010
101views more  MST 2010»
13 years 5 months ago
Automatic Presentations and Semigroup Constructions
atic presentation for a relational structure is, informally, an abstract representation of the elements of that structure by means of a regular language such that the relations ca...
Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Ric...
WRLA
2010
13 years 5 months ago
The Linear Temporal Logic of Rewriting Maude Model Checker
Abstract. This paper presents the foundation, design, and implementation of the Linear Temporal Logic of Rewriting model checker as an extension of the Maude system. The Linear Tem...
Kyungmin Bae, José Meseguer