1497 search results - page 79 / 300 » Extended static checking |
103
click to vote
CAV
2004
Springer
15 years 7 months ago
2004
Springer
Verifying whether an ω-regular property is satisfied by a finite-state system is a core problem in model checking. Standard techniques build an automaton with the complementary ...
123
Voted
ATVA
2007
Springer
15 years 6 months ago
2007
Springer
A fair non-repudiation protocol should guarantee, (1) when a sender sends a message to a receiver, neither the sender nor the receiver can deny having participated in this communic...
CAV
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In order to make multithreaded programming manageable, programmers often follow a design principle where they break the problem into tasks which are then solved asynchron...
117
Voted
FSTTCS
2006
Springer
15 years 5 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
133
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...