Computing race variants in message-passing concurrent programming with selective receives (Q2165226): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4293196910 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2210.03026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Source Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal dynamic partial order reduction with observers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic partial-order reduction for model checking software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prefix-based tracing in message-passing concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time, clocks, and the ordering of events in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of reversibility for Erlang / rank
 
Normal rank
Property / cites work
 
Property / cites work: Causal-consistent replay debugging for message passing programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Causal-Consistent Replay Reversible Semantics for Message Passing Concurrent Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3771629 / rank
 
Normal rank

Latest revision as of 22:47, 29 July 2024

scientific article
Language Label Description Also known as
English
Computing race variants in message-passing concurrent programming with selective receives
scientific article

    Statements