Search Sciweavers | Sciweavers

500 search results - page 18 / 100

» ACD Term Rewriting

click to vote

RTA
2010
Springer

178views Theoretical Computer Science» more RTA 2010»

Closing the Gap Between Runtime Complexity and Polytime Computability

15 years 1 months ago

Download cl-informatik.uibk.ac.at

In earlier work, we have shown that for conﬂuent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...

Martin Avanzini, Georg Moser

claim paper

Read More »

click to vote

RTA
2009
Springer

86views Theoretical Computer Science» more RTA 2009»

Proving Termination of Integer Term Rewriting

15 years 4 months ago

Download verify.rwth-aachen.de

Carsten Fuhs, Jürgen Giesl, Martin Plück...

claim paper

Read More »

Voted

RTA
2004
Springer

113views Theoretical Computer Science» more RTA 2004»

A Visual Environment for Developing Context-Sensitive Term Rewriting Systems

15 years 3 months ago

Download www.eecs.northwestern.edu

Over the past decade, researchers have found context-sensitive term-rewriting semantics to be powerful and expressive tools for modeling programming languages, particularly in esta...

Jacob Matthews, Robert Bruce Findler, Matthew Flat...

claim paper

Read More »

Voted

RTA
2004
Springer

108views Theoretical Computer Science» more RTA 2004»

A Verification Technique Using Term Rewriting Systems and Abstract Interpretation

15 years 3 months ago