A Verification Technique Using Term Rewriting Systems and Abstract Interpretation-Reference-Cited by-同舟云学术

A Verification Technique Using Term Rewriting Systems and Abstract Interpretation

Published:2004 Issue: Volume: Page:119-133
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Takai Toshinori

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-25979-4_9

Reference13 articles.

1. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

2. Lecture Notes in Computer Science;H. Comon,1990

3. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (1997), http://www.grappa.univ-lille3.fr/tata/

4. Cousot, P., Cousot, R.: Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Proc. of 4th POPL, pp. 238–252. ACM Press, New York (1977)

5. LNAI;T. Genet,2000

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Static analysis of pattern-free properties;23rd International Symposium on Principles and Practice of Declarative Programming;2021-09-06

2. Pattern Eliminating Transformations;Logic-Based Program Synthesis and Transformation;2021

3. Equational Abstraction Refinement for Certified Tree Regular Model Checking;Formal Methods and Software Engineering;2012

4. Characterizing Conclusive Approximations by Logical Formulae;Lecture Notes in Computer Science;2011

5. Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols;Higher-Order and Symbolic Computation;2007-02-24