135 search results - page 14 / 27 » Structure-aware computation of predicate abstraction |
HYBRID
2003
Springer
15 years 2 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...
85
Voted
ICLP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
79
Voted
ISW
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Program obfuscation is a semantic-preserving transformation aimed at bringing a program into such a form, which impedes the understanding of its algorithm and data struct...
84
Voted
FUIN
2010
14 years 7 months ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
CIE
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...