Bounded underapproximations
type: Item
instance of: scholarly article
title: Bounded underapproximations
zbMATH Open document ID: 1247.68140
author: Pierre Ganty
author: Benjamin Monmege
author: Rupak Majumdar
published in: Formal Methods in System Design
publication date: 2012-09-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/0809.1236
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 6087631
zbMATH Keywords: context-free grammar
zbMATH Keywords: bounded languages
zbMATH Keywords: Parikh-boundedness
zbMATH Keywords: multithreaded reachability
zbMATH Keywords: recursive counter machines
describes a project that uses: ALGOL 60
MaRDI profile type: Publication
OpenAlex ID: W2914181030
arXiv ID: 0809.1236
cites work: Automated Technology for Verification and Analysis
cites work: A generic approach to the static analysis of concurrent programs with procedures
cites work: Iterating Octagons
cites work: Programs with Lists Are Counter Automata
cites work: Complexity of pattern-based verification for multithreaded programs
cites work: Parikh's theorem: a simple and direct automaton construction
cites work: Newton’s Method for ω-Continuous Semirings
cites work: Q3060977
cites work: Q4415251
cites work: Q5576254
cites work: Bounded Algol-Like Languages
cites work: Some decision problems concerning semilinearity and commutation.
cites work: Q3862379
cites work: CONCUR 2004 - Concurrency Theory
cites work: Tools and Algorithms for the Construction and Analysis of Systems
DOI: 10.1007/S10703-011-0136-Y
description: scientific article; zbMATH DE number 6087631