The decidability of verification under PS 2.0 (Q2233444): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401496743
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-72019-3_1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3138980809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and algorithms for the construction and analysis of systems. 23rd international conference, TACAS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22--29, 2017. Proceedings. Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of verification under PS 2.0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying programs with unreliable channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the verification problem for weak memory models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delay-bounded scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: A promising semantics for relaxed-memory concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing concurrent analysis under a context bound to sequential analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Java memory model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Relaxed Dependencies in Weak Memory Concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of a recursively unsolvable problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A separation logic for a promising semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-Bounded Analysis of Concurrent Queue Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing Context-Bounded Concurrent Reachability to Sequential Reachability / rank
 
Normal rank

Latest revision as of 19:51, 26 July 2024

scientific article
Language Label Description Also known as
English
The decidability of verification under PS 2.0
scientific article

    Statements

    The decidability of verification under PS 2.0 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 October 2021
    0 references
    model-checking
    0 references
    memory models
    0 references
    promising semantics
    0 references

    Identifiers