Over-approximating Descendants by Synchronized Tree Languages

Abstract : Over-approximating the descendants (successors) of a initial set of terms by a rewrite system is used in verification. The success of such verification methods depends on the quality of the approximation. To get better approximations, we are going to use non-regular languages. We present a procedure that always terminates and that computes an over-approximation of descendants, using synchronized tree-(tuple) languages expressed by logic programs.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00808871
Contributor : Yohan Boichut <>
Submitted on : Monday, April 8, 2013 - 9:43:06 AM
Last modification on : Thursday, January 17, 2019 - 3:06:04 PM

Identifiers

  • HAL Id : hal-00808871, version 1

Collections

Citation

Yohan Boichut, Jacques Chabin, Pierre Rety. Over-approximating Descendants by Synchronized Tree Languages. International Conference on Rewriting Techniques and Applications, Jun 2013, Eindhoven, Netherlands. ⟨hal-00808871⟩

Share

Metrics

Record views

128