Over-approximating Descendants by Synchronized Tree Languages - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

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.
No file

Dates and versions

hal-00808871 , version 1 (08-04-2013)

Identifiers

  • HAL Id : hal-00808871 , version 1

Cite

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⟩
76 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More