A theoretical limit for safety verification techniques with regular fix-point computations
From MaRDI portal
Publication:963463
DOI10.1016/J.IPL.2008.03.012zbMATH Open1186.68280OpenAlexW2070896619MaRDI QIDQ963463FDOQ963463
Authors: 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
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Abstract regular tree model checking
- Decidable approximations of term rewriting systems
- Rewriting Approximations for Fast Prototyping of Static Analyzers
- Title not available (Why is that?)
- Handling Algebraic Properties in Automatic Analysis of Security Protocols
- Reachability analysis over term rewriting systems
- Regular sets of descendants by leftmost strategy
Cited In (9)
- Verifying relative safety, accuracy, and termination for program approximations
- How to Tackle Integer Weighted Automata Positivity
- Undecidability of safety for the schematic protection model with cyclic creates
- Termination criteria for tree automata completion
- Synchronized tree languages for reachability in non-right-linear term rewrite systems
- SAT-based automated completion for reachability analysis
- An Improved Safety Solver in Go Using Partial Regions
- Towards more precise rewriting approximations
- HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA
Uses Software
This page was built for publication: A theoretical limit for safety verification techniques with regular fix-point computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963463)
