1199 search results - page 100 / 240 » Parameterized Proof Complexity |
CORR
2000
Springer
13 years 9 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
ISSAC
2005
Springer
14 years 3 months ago
2005
Springer
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We give a new, and hopefully more easily understandable, structural proof of the decomposition of a k-valued transducer into k unambiguous functional ones, a result established by...