113 search results - page 7 / 23 » LTL Can Be More Succinct |
ESOP
2008
Springer
14 years 11 months ago
2008
Springer
We present a polynomial-time algorithm which at the extra cost of a factor O(k) (k the number of variables) generalizes inter-procedural copy constant propagation. Our algorithm in...
170
click to vote
CONCUR
2011
Springer
13 years 9 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
ISAAC
2001
Springer
15 years 2 months ago
2001
Springer
A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton...
TACAS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
ICTAC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...