SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Rezvan Rojin) "

Search: WFRF:(Rezvan Rojin)

  • Result 1-1 of 1
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Abdulla, Parosh Aziz, 1961-, et al. (author)
  • Parameterized verification under TSO is PSPACE-complete
  • 2020
  • In: Proceedings of the ACM on Programming Languages. - New York, NY, USA : Association for Computing Machinery (ACM). - 2475-1421. ; 4:POPL, s. 26:1-26:29
  • Journal article (peer-reviewed)abstract
    • We consider parameterized verification of concurrent programs under the Total Store Order (TSO) semantics. A program consists of a set of processes that share a set of variables on which they can perform read and write operations. We show that the reachability problem for a system consisting of an arbitrary number of identical processes is PSPACE-complete. We prove that the complexity is reduced to polynomial time if the processes are not allowed to read the initial values of the variables in the memory. When the processes are allowed to perform atomic read-modify-write operations, the reachability problem has a non-primitive recursive complexity.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-1 of 1
Type of publication
journal article (1)
Type of content
peer-reviewed (1)
Author/Editor
Abdulla, Parosh Aziz ... (1)
Atig, Mohamed Faouzi (1)
Rezvan, Rojin (1)
University
Uppsala University (1)
Language
English (1)
Research subject (UKÄ/SCB)
Natural sciences (1)
Year
2020 (1)

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view