Sciweavers

8647 search results - page 568 / 1730
» The Container Selection Problem
Sort
View
OPODIS
2003
15 years 8 months ago
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Alper Sen, Vijay K. Garg
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 9 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
ERSHOV
2009
Springer
16 years 1 months ago
Symbolic Bounded Conformance Checking of Model Programs
Abstract. Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of ...
Margus Veanes, Nikolaj Bjørner
CCS
2007
ACM
16 years 1 months ago
Direct static enforcement of high-level security policies
A high-level security policy states an overall safety requirement for a sensitive task. One example of a high-level security policy is a separation of duty policy, which requires ...
Qihua Wang, Ninghui Li
CPM
2007
Springer
101views Combinatorics» more  CPM 2007»
16 years 1 months ago
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
Yufeng Wu, Dan Gusfield