A Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations - Archive ouverte HAL Access content directly
Journal Articles Information Processing Letters Year : 2008

A Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations

(1, 2) , (3)
1
2
3

Abstract

In computer aided verification, the reachability problem is particularly relevant for safety analyses. Given a regular tree language L, a term t and a relation R, the reachability problem consists in deciding whether there exist a positive integer n and terms t0,t1,...,tn such that t0set membership, variantL, tn=t and for every 0less-than-or-equals, slanti

Dates and versions

inria-00328487 , version 1 (10-10-2008)

Identifiers

Cite

Yohan Boichut, Pierre-Cyrille Heam. A Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations. Information Processing Letters, 2008, 108 (1), pp.1-2. ⟨10.1016/j.ipl.2008.03.012⟩. ⟨inria-00328487⟩
129 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More