Testing for race conditions in distributed systems via SMT solving

DOI10.1007/978-3-030-50995-8_7MaRDI QIDQ6487263zbMATH OpenFDO

Authors Jorge Sousa Pinto

Publication date 9 November 2022

Full work available at URL https://doi.org/10.1007/978-3-030-50995-8_7

Mathematics Subject Classification ID

Distributed systems (68M14) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Reachability analysis on distributed executions
• Testing Distributed Systems Through Symbolic Model Checking
• Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions
• scientific article; zbMATH DE number 6712238
• scientific article; zbMATH DE number 2089169

Cites work

• The complexity of theorem-proving procedures
• Time, clocks, and the ordering of events in a distributed system

Cited in

(1)

• Finding race conditions in Erlang with quickcheck and PULSE

This page was built for publication: Testing for race conditions in distributed systems via SMT solving

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