3335 search results - page 464 / 667 » Grid result checking |
121
click to vote
SPIN
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The most expensive operation in explicit state model checking is the hash computation required to store the explored states in a hash table. One way to reduce this comput...
152
click to vote
ISSTA
2004
ACM
15 years 11 months ago
2004
ACM
Two operations commute if executing them serially in either order results in the same change of state. In a system in which commands may be issued simultaneously by different use...
156
click to vote
CDB
2004
Springer
15 years 11 months ago
2004
Springer
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
160
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
The paper settles a long standing problem for Mazurkiewicz traces: the pure future local temporal logic defined with the basic modalities exists-next and until is expressively com...
207
click to vote
WIA
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...