Bounded underapproximations

DOI10.1007/s10703-011-0136-yzbMath1247.68140arXiv0809.1236OpenAlexW2914181030MaRDI QIDQ453533

Pierre Ganty, Benjamin Monmege, Rupak Majumdar

Publication date: 27 September 2012

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.1236

zbMATH Keywords

bounded languagescontext-free grammarmultithreaded reachabilityParikh-boundednessrecursive counter machines

Mathematics Subject Classification ID

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

Related Items (4)

Forward analysis and model checking for trace bounded WSTS ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ Decidable models of integer-manipulating programs with recursive parallelism ⋮ Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some decision problems concerning semilinearity and commutation.
• Parikh's theorem: a simple and direct automaton construction
• A generic approach to the static analysis of concurrent programs with procedures
• Newton’s Method for ω-Continuous Semirings
• Iterating Octagons
• CONCUR 2004 - Concurrency Theory
• Complexity of pattern-based verification for multithreaded programs
• Automated Technology for Verification and Analysis
• Bounded Algol-Like Languages
• Tools and Algorithms for the Construction and Analysis of Systems
• Programs with Lists Are Counter Automata

This page was built for publication: Bounded underapproximations