Filters








29 Hits in 4.0 sec

A Verification-Based Approach to Memory Fence Insertion in Relaxed Memory Systems [chapter]

Alexander Linden, Pierre Wolper
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Its starting point is a program that is correct for the usual sequential consistency memory model, but that might be incorrect under x86-TSO.  ...  Specifically, it considers the TSO (Total Store Order) relaxation, which corresponds to the use of store buffers, and its extension x86-TSO, which in addition allows synchronization and lock operations  ...  SC is also satisfied under x86-TSO.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-22306-8_10">doi:10.1007/978-3-642-22306-8_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7emfy7wco5e5ja3xzxfs7vlzce">fatcat:7emfy7wco5e5ja3xzxfs7vlzce</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20161008082138/http://spinroot.com/spin/Workshops/ws11/spin2011_submission_12.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2d/77/2d779eca50185d47e51daf2a67388ddfcbff6217.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-22306-8_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Taming x86-TSO persistency

Artem Khyzha, Ori Lahav
<span title="2021-01-04">2021</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dqy7qc7jkzal5bz3gueys3siz4" style="color: black;">Proceedings of the ACM on Programming Languages (PACMPL)</a> </i> &nbsp;
We study the formal semantics of non-volatile memory in the x86-TSO architecture.  ...  Our operational models are accompanied with equivalent declarative formulations, which facilitate our formal arguments, and may prove useful for program verification under x86 persistency.  ...  Finally, the decidability of reachability under Px86 was investigated in [Abdulla et al. 2021 ].  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3434328">doi:10.1145/3434328</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r5drc4q2efazpexbnrxxfckfwa">fatcat:r5drc4q2efazpexbnrxxfckfwa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210817041927/https://dl.acm.org/doi/pdf/10.1145/3434328" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c3/a0/c3a06f1e730a82fe512c073cfea23e360dbeb4aa.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3434328"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Taming x86-TSO Persistency (Extended Version) [article]

Artem Khyzha, Ori Lahav
<span title="2020-10-27">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We study the formal semantics of non-volatile memory in the x86-TSO architecture.  ...  Our operational models are accompanied with equivalent declarative formulations, which facilitate our formal arguments, and may prove useful for program verification under x86 persistency.  ...  We leave the investigation of the decidability of reachability under Px86 (equivalently, under PTSO syn ) to future work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2010.13593v2">arXiv:2010.13593v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/swpqdfnd7jghxh3xhtyssmazbu">fatcat:swpqdfnd7jghxh3xhtyssmazbu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201031040321/https://arxiv.org/pdf/2010.13593v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ae/04/ae048a46b4f4ea2bc2d1dd77d8456386c98c85fb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2010.13593v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO [chapter]

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Tuan-Phong Ngo
<span title="">2015</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We instantiate our framework for the Total Store Ordering (TSO) memory model, and give an algorithm that reduces the fence insertion problem under TSO to the reachability problem for programs running under  ...  To this end, we propose a novel notion of correctness, called persistence, that compares the behavior of the program under the weak memory semantics with that under the classical interleaving (SC) semantics  ...  In other words, c is reachable from c init under TSO iff it is reachable under SC. It is well-known that checking safety properties can be expressed as reachability of sets of (plain) configurations.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-46669-8_13">doi:10.1007/978-3-662-46669-8_13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ialcwz7oefc3dlkxto7qq6r7ri">fatcat:ialcwz7oefc3dlkxto7qq6r7ri</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830051401/http://user.it.uu.se/~tuang296/ESOP2015.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2c/ff/2cff4fdd87259aacc41a652d64a9bed8dda44cfa.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-46669-8_13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Efficient Verification of Concurrent Programs Over TSO Memory Model [article]

Chinmay Narayan, Subodh Sharma, S.Arun-Kumar
<span title="2016-06-17">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
It has been shown that even with finite data domain programs, the complexity of control state reachability under TSO is non-primitive recursive.  ...  We address the problem of efficient verification of multi-threaded programs running over Total Store Order (TSO) memory model.  ...  Its performance was compared against memorax which implements sound and complete verification of state reachability under the TSO memory model.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1606.05435v1">arXiv:1606.05435v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3ncceoyrwfh3jnm4hss43emv6e">fatcat:3ncceoyrwfh3jnm4hss43emv6e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826182230/https://arxiv.org/pdf/1606.05435v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/48/b9/48b9a902769128f6179c1ea4b33b8cec2888083d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1606.05435v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Reasoning About TSO Programs Using Reduction and Abstraction [chapter]

Ahmed Bouajjani, Constantin Enea, Suha Orhun Mutluergil, Serdar Tasiran
<span title="">2018</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We present a method for proving that a program running under the Total Store Ordering (TSO) memory model is robust, i.e., all its TSO computations are equivalent to computations under the Sequential Consistency  ...  This enables the use of proof methods designed for the SC semantics in proving invariants that hold on the TSO semantics of a non-robust program.  ...  Related Work The weakest correctness criterion that enables SC reasoning for proving invariants of programs running under TSO is state-robustness i.e., the reachable set of states is the same under both  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-96142-2_21">doi:10.1007/978-3-319-96142-2_21</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yv7hhkuuxrdaxelfds4wmsnovu">fatcat:yv7hhkuuxrdaxelfds4wmsnovu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190501204916/https://link.springer.com/content/pdf/10.1007%2F978-3-319-96142-2_21.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/10/7a/107ae77e9b6b528dbf87035134626001ff0e0733.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-96142-2_21"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Reasoning About TSO Programs Using Reduction and Abstraction [article]

Ahmed Bouajjani, Constantin Enea, Suha Orhun Mutluergil, Serdar Tasiran
<span title="2018-04-14">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We present a method for proving that a program running under the Total Store Ordering (TSO) memory model is robust, i.e., all its TSO computations are equivalent to computations under the Sequential Consistency  ...  This enables the use of proof methods designed for the SC semantics in proving invariants that hold on the TSO semantics of a non-robust program.  ...  Related Work The weakest correctness criterion that enables SC reasoning for proving invariants of programs running under TSO is state-robustness i.e., the reachable set of states is the same under both  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.05196v1">arXiv:1804.05196v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gx3fk6ayl5huheu3ejsz7ombdm">fatcat:gx3fk6ayl5huheu3ejsz7ombdm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826020151/https://arxiv.org/pdf/1804.05196v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/46/fd/46fd7e38c7fd62d0f06955dbcabac1702ca17f62.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.05196v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

View-Based Owicki-Gries Reasoning for Persistent x86-TSO (Extended Version) [article]

Eleni Vafeiadi Bila, Brijesh Dongol, Ori Lahav, Azalea Raad, John Wickerson
<span title="2022-01-15">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Our work aims to help programmers navigate this brave new world by providing a program logic for reasoning about x86 code that uses low-level operations such as memory accesses and fences, as well as persistency  ...  The rise of persistent memory is disrupting computing to its core.  ...  [1] have proven that state-reachability for persistent x86 is decidable, thus opening the door to automatic verification of persistent programs, and Gorjiara et al.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2201.05860v1">arXiv:2201.05860v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/k3spzomc7nhstptpsyjmziyqje">fatcat:k3spzomc7nhstptpsyjmziyqje</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220123034005/https://arxiv.org/pdf/2201.05860v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8b/fb/8bfb030ded6c3005f84e2855c3388871fb7ddf66.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2201.05860v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude? [chapter]

Yehia Abd Alrahman, Marina Andric, Alessandro Beggiato, Alberto Lluch Lafuente
<span title="">2014</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Several techniques have been proposed to mitigate those problems so to make verification under relaxed memory models feasible.  ...  The key idea is to approximate the (possibly unbounded) store buffers in a way that not only makes verification under Tso feasible, but also reduces the reachability problem under Tso to a reachability  ...  As a consequence, for a finite-state program, the context-bounded analysis of Tso programs is decidable.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-12904-4_2">doi:10.1007/978-3-319-12904-4_2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lfec4mjkyvgsnlkz7lyqasrf7e">fatcat:lfec4mjkyvgsnlkz7lyqasrf7e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190505013523/https://link.springer.com/content/pdf/10.1007%2F978-3-319-12904-4_2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fb/35/fb3541574ea8810999c01ddabcd1e33984ec17e9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-12904-4_2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems [chapter]

Alexander Linden, Pierre Wolper
<span title="">2013</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
This program is then first analyzed and corrected for the TSO memory model, and then this TSO-safe program is analyzed and corrected under PSO, producing a PSO-safe program.  ...  To obtain a TSO-safe program, only store-load fences (TSO only allows store-load relaxations) are introduced into the program.  ...  The more theoretical work presented in [17] uses results about systems with lossy fifo channels to prove the decidability of reachability under TSO (or PSO) with respect to unbounded store buffers, but  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-36742-7_24">doi:10.1007/978-3-642-36742-7_24</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fynjc5sosrcjdnymdln4u5omua">fatcat:fynjc5sosrcjdnymdln4u5omua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170816191813/http://orbi.ulg.ac.be/bitstream/2268/137716/1/LW%20TACAS2013.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e0/5d/e05d637737fbc5d3f4f4129821884bcdb9b5d248.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-36742-7_24"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Abstraction for Crash-Resilient Objects (Extended Version) [article]

Artem Khyzha, Ori Lahav
<span title="2022-01-28">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Our results provide the first approach to formal compositional reasoning under NVM.  ...  We illustrate our approach on two implementations and specifications of simple persistent objects with different prototypical durability guarantees.  ...  Other abstraction results account for liveness [16] , resource-transferring programs [17] , and x86-TSO [8] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2111.03881v2">arXiv:2111.03881v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ml2qkumiincodnczdzca4767wm">fatcat:ml2qkumiincodnczdzca4767wm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220205220158/https://arxiv.org/pdf/2111.03881v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/59/42/5942e4d497fa85cd62870b2a87b1ef176781c849.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2111.03881v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Concurrent Computing in the Many-core Era (Dagstuhl Seminar 15021)

Michael Philippsen, Pascal Felber, Michael L. Scott, J. Eliot B. Moss, Marc Herbstritt
<span title="2015-04-28">2015</span> <i title="Schloss Dagstuhl Leibniz-Zentrum für Informatik GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/u2phfyhrhje7xnnubtp3vfklcu" style="color: black;">Dagstuhl Reports</a> </i> &nbsp;
The proof explicitly accounts for both of these features, incorporating the x86-TSO model for relaxed memory semantics on x86 multiprocessors.  ...  Boundedness of TSO buffers was discussed. They are not. Proof has to consider reachability of pointers in TSO buffers. The roots may be in the write buffer.  ...  Boehm]: Lots of people are pursuing APIs similar to mmap (with different implementation under the hood). For example, Facebook has an Mmapped file that persists through the rebooting of a process.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.5.1.1">doi:10.4230/dagrep.5.1.1</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/journals/dagstuhl-reports/PhilippsenFSM15.html">dblp:journals/dagstuhl-reports/PhilippsenFSM15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/owcmta65hzb5vmglwq3dwzbehy">fatcat:owcmta65hzb5vmglwq3dwzbehy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220123034336/https://drops.dagstuhl.de/opus/volltexte/2015/5010/pdf/dagrep_v005_i001_p001_s15021.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c0/73/c07300a97ce0d7ba20321ad6cecb4ffd08e1ad56.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.5.1.1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Safety Verification of Parameterized Systems under Release-Acquire [article]

Adwait Godbole, Shankara Narayanan Krishna, Roland Meyer
<span title="2022-05-05">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We study the safety verification problem for parameterized systems under the release-acquire (RA) semantics.  ...  Atig et al. have shown that safety verification is decidable for assembly programs running on TSO, the consistency model of x86 architectures [11] .  ...  If ρ is a computation under RA, then so is M(ρ). Hence if a configuration cf is reachable under RA then so is M(cf). Proof.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2101.12123v2">arXiv:2101.12123v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/76wwxehpt5e37cknq5yl4rrzqm">fatcat:76wwxehpt5e37cknq5yl4rrzqm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220507114615/https://arxiv.org/pdf/2101.12123v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a3/ee/a3eec80ee4c26435371f3153e9343b56461991e2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2101.12123v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Automatic memory reclamation for lock-free data structures

Nachshon Cohen, Erez Petrank
<span title="2015-10-23">2015</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xu5bk2lj5rbdxlx6222nw7tsxi" style="color: black;">SIGPLAN notices</a> </i> &nbsp;
We also assume the TSO memory model, used by the common x86 architecture. For a formal definition of this model, see Owens et al. [18] and the references therein.  ...  In the presence of parallel execution, it is difficult to decide when an object will never be accessed by other threads.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2858965.2814298">doi:10.1145/2858965.2814298</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/eccou5i24reudnuyt62inopjhm">fatcat:eccou5i24reudnuyt62inopjhm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809115652/http://www.cs.technion.ac.il/~erez/Papers/cohen-petrank-oopsla15.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/22/a3/22a3110123362412f91ae44c2b15e2234324f6fd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2858965.2814298"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Automatic memory reclamation for lock-free data structures

Nachshon Cohen, Erez Petrank
<span title="">2015</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6y3m32grtnfktkp2oo6oqjbvta" style="color: black;">Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications - OOPSLA 2015</a> </i> &nbsp;
We also assume the TSO memory model, used by the common x86 architecture. For a formal definition of this model, see Owens et al. [18] and the references therein.  ...  In the presence of parallel execution, it is difficult to decide when an object will never be accessed by other threads.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2814270.2814298">doi:10.1145/2814270.2814298</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/oopsla/CohenP15.html">dblp:conf/oopsla/CohenP15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rdxbubc6svdcthhxkt2ufyglfm">fatcat:rdxbubc6svdcthhxkt2ufyglfm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809115652/http://www.cs.technion.ac.il/~erez/Papers/cohen-petrank-oopsla15.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/22/a3/22a3110123362412f91ae44c2b15e2234324f6fd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2814270.2814298"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 29 results