4767 search results - page 278 / 954 » Structures for Abstract Rewriting |
188
click to vote
APLAS
2011
ACM
14 years 6 months ago
2011
ACM
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
144
click to vote
BSL
2004
15 years 6 months ago
2004
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...
200
click to vote
PLDI
2011
ACM
14 years 9 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regular...
133
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating wellfoundedness of unions of relations. To that en...
159
click to vote
CIE
2009
Springer
16 years 1 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...