A theoretical limit for safety verification techniques with regular fix-point computations
type: Item
instance of: scholarly article
title: A theoretical limit for safety verification techniques with regular fix-point computations
zbMATH Open document ID: 1186.68280
published in: Information Processing Letters
publication date: 2010-04-19T00:00:00Z
full work available at URL: RR-6411.pdf
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5694992
zbMATH Keywords: reachability problem
zbMATH Keywords: regular tree languages
zbMATH Keywords: formal methods
zbMATH Keywords: theoretical limit
author: Yohan Boichut
author: Pierre-Cyrille Héam
describes a project that uses: Timbuk
MaRDI profile type: Publication
OpenAlex ID: W2070896619
cites work: Rewriting Approximations for Fast Prototyping of Static Analyzers
cites work: Handling Algebraic Properties in Automatic Analysis of Security Protocols
cites work: Abstract regular tree model checking
cites work: Reachability analysis over term rewriting systems
cites work: Q2723425
cites work: Q4847003
cites work: Decidable approximations of term rewriting systems
cites work: Regular sets of descendants by leftmost strategy
DOI: 10.1016/J.IPL.2008.03.012
description: scientific article; zbMATH DE number 5694992