5015 search results - page 155 / 1003 » Model Checking a Path |
113
click to vote
AAAI
2010
15 years 4 months ago
2010
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...
129
Voted
APN
2008
Springer
15 years 4 months ago
2008
Springer
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
110
Voted
FOCS
1996
IEEE
15 years 6 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
140
click to vote
FMCAD
2004
Springer
15 years 8 months ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
123
click to vote
ISW
2004
Springer
15 years 8 months ago
2004
Springer
We present a model of access control which provides fine-grained data-dependent control, can express permissions about permissions, can express delegation, and can describe syste...