798 search results - page 69 / 160 » Proving More Properties with Bounded Model Checking |
168
click to vote
ADHOCNOW
2004
Springer
15 years 9 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
133
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
130
click to vote
CSFW
2009
IEEE
15 years 8 months ago
2009
IEEE
This paper presents a language, based on transaction logic, for specifying dynamic authorisation policies, i.e., rules governing actions that may depend on and update the authoris...
136
click to vote
TIT
2002
15 years 4 months ago
2002
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
108
click to vote
JCT
2008
15 years 4 months ago
2008
A three-dimensional analogue of the classical direction problem is proposed and an asymptotically sharp bound for the number of directions determined by a nonplanar set in AG(3, p)...