11716 search results - page 267 / 2344 » Computable symbolic dynamics |
172
click to vote
DAC
1999
ACM
15 years 11 months ago
1999
ACM
Abstract We describe the use of parametric representations of Boolean predicates to encode data-space constraints and signi cantly extend the capacity of formal veri cation. The co...
139
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
148
click to vote
MFCS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
172
click to vote
CADE
2008
Springer
15 years 8 months ago
2008
Springer
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...
149
click to vote
TCS
2010
15 years 5 months ago
2010
In a left-forbidding grammar, a set of nonterminals is attached to every context-free production, and such a production can rewrite a nonterminal if no symbol from the attached se...