Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

89

Voted

RTA
2004
Springer

108views Theoretical Computer Science» more RTA 2004»

A Verification Technique Using Term Rewriting Systems and Abstract Interpretation

15 years 8 months ago

A Verification Technique Using Term Rewriting Systems and Abstract Interpretation

Download css.jaist.ac.jp

Toshinori Takai

Real-time Traffic

RTA 2004 | Theoretical Computer Science |

claim paper

Related Content

» A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs

» Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting

» Polynomial Interpretations with Negative Coefficients

» A Compositional Semantics for Conditional Term Rewriting Systems

» Monotonicity Criteria for Polynomial Interpretations over the Naturals

» RewritingBased Techniques for Runtime Verification

» Dynamic Dependence in Term rewriting Systems and its Application to Program Slicing

» Decomposing bytecode verification by abstract interpretation

» Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over t...

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	RTA
Authors	Toshinori Takai

Comments (0)