Reachability in Concurrent Uninterpreted Programs.

DOI10.4230/LIPICS.FSTTCS.2019.46MaRDI QIDQ5875684zbMATH OpenOpenAlexFDO

Authors Salvatore La Torre, Madhusudan Parthasarathy

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPIcs.FSTTCS.2019.46

zbMATH Keywords

concurrent programsshared memoryuninterpreted programsverification

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cited in

(3)

• Property Directed Reachability for Proving Absence of Concurrent Modification Errors
• Functional behavior of nondeterministic and concurrent programs
• Trace Abstraction-Based Verification for Uninterpreted Programs

This page was built for publication: Reachability in Concurrent Uninterpreted Programs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875684)