933 search results - page 118 / 187 » Extending Forward Checking |
196
click to vote
POPL
2004
ACM
16 years 1 months ago
2004
ACM
We present in this article a precise security model for data confidentiality in the framework of asynchronous and deterministic objects. Our underlying programming model is based ...
185
click to vote
POPL
2002
ACM
16 years 1 months ago
2002
ACM
An adaptive computation maintains the relationship between its input and output as the input changes. Although various techniques for adaptive computing have been proposed, they r...
101
click to vote
ACRI
2006
Springer
15 years 7 months ago
2006
Springer
We develop two models for Myxobacteria swarming, a modified Lattice Gas Cellular Automata (LGCA) model and an off-lattice CA model. In the LGCA model each cell is represented by on...
126
click to vote
FORMATS
2003
Springer
15 years 6 months ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
110
click to vote
CAV
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is di...