A theoretical limit for safety verification techniques with regular fix-point computations

DOI10.1016/J.IPL.2008.03.012zbMath1186.68280OpenAlexW2070896619MaRDI QIDQ963463

Yohan Boichut, Pierre-Cyrille Héam

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00204579/file/RR-6411.pdf

zbMATH Keywords

regular tree languagesformal methodsreachability problemtheoretical limit

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (5)

Towards more precise rewriting approximations ⋮ Termination criteria for tree automata completion ⋮ Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems ⋮ HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA ⋮ How to Tackle Integer Weighted Automata Positivity

Uses Software

• Timbuk

Cites Work

• Reachability analysis over term rewriting systems
• Handling Algebraic Properties in Automatic Analysis of Security Protocols
• Decidable approximations of term rewriting systems
• Rewriting Approximations for Fast Prototyping of Static Analyzers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A theoretical limit for safety verification techniques with regular fix-point computations