1138 search results - page 180 / 228 » First-Order Model Checking Problems Parameterized by the Mod... |
128
Voted
VLDB
1998
ACM
15 years 6 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
99
Voted
CAV
2010
Springer
15 years 6 months ago
2010
Springer
We present the algorithms used in MCVETO (Machine-Code VErification TOol), a tool to check whether a stripped machinecode program satisfies a safety property. The verification p...
110
Voted
FORTE
2000
15 years 4 months ago
2000
The paper addresses the problem of test derivation from partially defined specifications. A specification is modeled by an Input/Output FSM such that transitions from some states ...
102
Voted
STOC
1998
ACM
15 years 6 months ago
1998
ACM
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
120
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...