161
click to vote
CONEXT
2007
ACM
15 years 9 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
110
Voted
CONEXT
2007
ACM
15 years 9 months ago
2007
ACM
122
click to vote
CONCUR
2007
Springer
15 years 9 months ago
2007
Springer
We re-examine vacuity in temporal logic model checking. We note two disturbing phenomena in recent results in this area. The first indicates that not all vacuities detected in prac...
161
click to vote
CONCUR
2007
Springer
15 years 9 months ago
2007
Springer
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
139
click to vote
CONCUR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...