Sciweavers

206 search results - page 30 / 42
» Deterministic Caterpillar Expressions
Sort
View
SEMWEB
2005
Springer
14 years 3 months ago
PR-OWL: A Bayesian Ontology Language for the Semantic Web
This paper addresses a major weakness of current technologies for the Semantic Web, namely the lack of a principled means to represent and reason about uncertainty. This not only h...
Paulo Cesar G. da Costa, Kathryn B. Laskey, Kennet...
LICS
1994
IEEE
14 years 1 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
STOC
2001
ACM
161views Algorithms» more  STOC 2001»
14 years 10 months ago
Quantitative solution of omega-regular games
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
Luca de Alfaro, Rupak Majumdar
KBSE
2009
IEEE
14 years 4 months ago
Generating Vulnerability Signatures for String Manipulating Programs Using Automata-Based Forward and Backward Symbolic Analyses
Given a program and an attack pattern (specified as a regular expression), we automatically generate string-based vulnerability signatures, i.e., a characterization that includes...
Fang Yu, Muath Alkhalaf, Tevfik Bultan
LICS
2009
IEEE
14 years 4 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp