Succinct representation of concurrent trace sets

DOI10.1145/2676726.2677008zbMATH Open1345.68108OpenAlexW2154445728MaRDI QIDQ2819829FDOQ2819829

Thorsten Tarrach, Arjun Radhakrishna, Thomas A. Henzinger, Ashutosh Gupta, Roopsha Samanta

Publication date: 29 September 2016

Published in: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://repository.ist.ac.at/317/1/author_version.pdf

zbMATH Keywords

concurrent programsCEGARbug summarizationsynchronization synthesistrace generalization

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cited In (3)

• Automated synthesis of asynchronizations
• From non-preemptive to preemptive scheduling using synchronization synthesis
• On the synchronization of traces

Uses Software

• z3
• CPAchecker
• Eraser
• RacerX
• SatAbs

This page was built for publication: Succinct representation of concurrent trace sets

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