Data flow analysis of asynchronous systems using infinite abstract domains

DOI10.1007/978-3-030-72019-3_2zbMath1473.68110arXiv2101.10233OpenAlexW3141564970MaRDI QIDQ2233447

Snigdha Athaiya, K. Narayan Kumar, Raghavan Komondoor

Publication date: 18 October 2021

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

zbMATH Keywords

message-passing systemsdata flow analysis

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Data flow analysis of asynchronous systems using infinite abstract domains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Precise interprocedural dataflow analysis with applications to constant propagation
• The octagon abstract domain
• On the reachability problem for 5-dimensional vector addition systems
• A structure to decide reachability in Petri nets
• The covering and boundedness problems for vector addition systems
• Monotone data flow analysis frameworks
• State space reduction using partial order techniques
• Verifying programs with unreliable channels
• Data flow analysis of asynchronous systems using infinite abstract domains
• Effect-driven flow analysis
• Parallel program schemata
• Expand, enlarge and check: new algorithms for the coverability problem of WSTS
• Well-Structured Pushdown Systems
• Safety Verification of Asynchronous Pushdown Systems with Shaped Stacks
• Analysis of recursively parallel programs
• Complexity Analysis of the Backward Coverability Algorithm for VASS
• Interprocedural analysis of asynchronous programs
• Precise interprocedural analysis through linear algebra
• Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
• On Communicating Finite-State Machines
• The Complexity of the Finite Containment Problem for Petri Nets
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• Hyper-Ackermannian bounds for pushdown vector addition systems
• Verifying liveness for asynchronous programs
• Fencing off go: liveness and safety for channel-based programming
• Context-Bounded Analysis of Concurrent Queue Systems
• Model Checking Multithreaded Programs with Asynchronous Atomic Methods
• Well-structured transition systems everywhere!

This page was built for publication: Data flow analysis of asynchronous systems using infinite abstract domains