Sciweavers

10568 search results - page 1603 / 2114
» Computer Intelligence and Formalization
Sort
View
CPAIOR
2007
Springer
16 years 1 months ago
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
Jan-Georg Smaus
ESORICS
2007
Springer
16 years 1 months ago
Modular Access Control Via Strategic Rewriting
Abstract. Security policies, in particular access control, are fundamental elements of computer security. We address the problem of authoring and analyzing policies in a modular wa...
Daniel J. Dougherty, Claude Kirchner, Hél&e...
HYBRID
2007
Springer
16 years 1 months ago
Robust Test Generation and Coverage for Hybrid Systems
Abstract. Testing is an important tool for validation of the system design and its implementation. Model-based test generation allows to systematically ascertain whether the system...
A. Agung Julius, Georgios E. Fainekos, Madhukar An...
ICALP
2007
Springer
16 years 1 months ago
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
ICDT
2007
ACM
126views Database» more  ICDT 2007»
16 years 1 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
« Prev « First page 1603 / 2114 Last » Next »