14 search results - page 2 / 3 » Symbolic Backwards-Reachability Analysis for Higher-Order Pu... |
FOSSACS
2009
Springer
14 years 3 days ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
IJFCS
2008
13 years 5 months ago
2008
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
HYBRID
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. This paper describes the implementation of predicate abstraction techniques to automatically compute symbolic backward reachable sets of high dimensional piecewise affine...
FORTE
2009
13 years 3 months ago
2009
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...