A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Filters
On the verification problem for weak memory models
2010
SIGPLAN notices
Preserved Fulltext
Atig, Bouajjani, Burckhardt, Musuvathi () Verification problem for weak memory models
February 3rd, 2010
16 / 22
Atig, Bouajjani, Burckhardt, Musuvathi () Verification problem for weak memory ...
models February 3rd, 2010
Atig, Bouajjani, Burckhardt, Musuvathi () Verification problem for weak memory models February 3rd, 2010 20 / 22 ...
doi:10.1145/1707801.1706303
fatcat:vmmh63t6q5bgjg5vf2vgpw6qgu
On the verification problem for weak memory models
2010
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Atig, Bouajjani, Burckhardt, Musuvathi () Verification problem for weak memory models
February 3rd, 2010
16 / 22
Atig, Bouajjani, Burckhardt, Musuvathi () Verification problem for weak memory ...
models February 3rd, 2010
Atig, Bouajjani, Burckhardt, Musuvathi () Verification problem for weak memory models February 3rd, 2010 20 / 22 ...
doi:10.1145/1706299.1706303
dblp:conf/popl/AtigBBM10
fatcat:h62twhafqzfyzmlq4gki6whia4
Formal Reasoning about the C11 Weak Memory Model
2015
Proceedings of the 2015 Conference on Certified Programs and Proofs - CPP '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
This abstract introduces the C11 weak memory model, summarises known verification results, and discusses some open problems. ...
A Primer on Weak Memory Models The memory model is what defines the semantics of memory accesses in multithreaded programs. ...
In the remainder, I will briefly discuss one other verification problem, that of checking robustness. ...
doi:10.1145/2676724.2693181
dblp:conf/cpp/Vafeiadis15
fatcat:r4i6yj74uja6jko2raolnvjxza
Concurrency with Weak Memory Models (Dagstuhl Seminar 16471)
2017
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This report documents the program and the outcomes of Dagstuhl Seminar 16471 "Concurrency with Weak Memory Models: Semantics, Languages, Compilation, Verification, Static Analysis, and Synthesis". ...
to design formal methods and develop tools ensuring the correctness of concurrent programs on modern multi-processor architectures. ...
In this talk, we discuss the verification of concurrent programs running under weak memory models by sound and automatic static analysis based on abstract interpretation. ...
doi:10.4230/dagrep.6.11.108
dblp:journals/dagstuhl-reports/AlglaveCU16
fatcat:uktg6fydmjgh5fqi53kleny4ka
Verifying Weak Probabilistic Noninterference
2017
International Journal of Advanced Computer Science and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, the problem of verifying weak probabilistic noninterference by leveraging formal methods, in particular algorithmic verification, is discussed. ...
Then, a verification algorithm is proposed to check weak probabilistic noninterference. ...
To solve this problem, one can change the algorithm in such a way that it works on abstract models of the program, such as binary decision diagrams. ...
doi:10.14569/ijacsa.2017.081026
fatcat:mef4uuk6frbvji4d2fegyinfmy
Dartagnan: Bounded Model Checking for Weak Memory Models (Competition Contribution)
[chapter]
2020
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Dartagnan is a bounded model checker for concurrent programs under weak memory models. ...
For SV-COMP'20, we take as input sequential consistency (i.e. the standard interleaving memory model) extended by support for atomic blocks. ...
We also thank Natalia Gavrilenko for her contributions to the development of the bounded model checking engine of the tool [4, 5] . ...
doi:10.1007/978-3-030-45237-7_24
fatcat:yfhp3cmwz5bhxofqztijrnjzxq
Specifying Weak Memory Consistency with Temporal Logic
2016
International Workshop on Verification and Evaluation of Computer and Communication Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
However, some of them cannot be directly used for verification by model checking. In this paper, we present a new way for specifying weak memory consistency models that is based on temporal logic. ...
Using Linear Temporal Logic (LTL) to define weak memory systems, we can easily check properties of one and the same multithreaded program against several consistency models. ...
for the verification. ...
dblp:conf/vecos/Senftleben016
fatcat:vytuylq3rzdgfaa4fj6zgxc4bu
Shared Memory Consistency Protocol Verification Against Weak Memory Models: Refinement via Model-Checking
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Thus, the correctness problem -that all the executions generated by the multiprocessor for any given concurrent program are also allowed by the memory model -is a major challenge. ...
The use of parallel model-checking, based on a version of the parallel Murϕ model checker we have recently developed for the MPI library, has been essential to finish the search in a matter of a few hours ...
Thus, in addition to the specification problem, formal verification of shared memory consistency protocols against weak shared memory models remains largely unsolved [2, 5] . ...
doi:10.1007/3-540-45657-0_10
fatcat:fiwbf3nwzjdtnoir7ncym5pco4
Stateless software model checking parameterized with memory consistency models
2020
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The complexity of dealing with the arbitrary interleavings of such a program makes it one of the hardest problems of software verification. ...
Formal verification of multithreaded software running on multi-core hardware has for long been challenging for anything other than the simplest of programs. ...
One such example is the verification of flawed memory architectures, where the design does not follow a predefined template for weak memory -such as the ARM Cortex A9 processor that includes a fault where ...
doi:10.5281/zenodo.5905769
fatcat:i2xdtgzyojay5bhdjmwngsplii
A Time-Optimal On-the-Fly Parallel Algorithm for Model Checking of Weak LTL Properties
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. ...
We propose an algorithm that has the required properties for a very rich subset of LTL properties, namely those expressible by weak Büchi automata. ...
In this paper we propose a parallel on-the-fly linear algorithm for LTL model-checking of weak LTL properties. ...
doi:10.1007/978-3-642-10373-5_21
fatcat:nb5cavpfurgp7jqjotqwtiioju
Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
memory models. ...
We introduce MEMORAX, a tool for the verification of control state reachability (i.e., safety properties) of concurrent programs manipulating finite range and integer variables and running on top of weak ...
Computer science researchers can use the open source code of MEMORAX to compare with other approaches for the verification of programs running on top of weak memory models, to improve and optimise the ...
doi:10.1007/978-3-642-36742-7_37
fatcat:pxa7x56eqbbt7ihjujtmaovlya
Memory-Model-Aware Testing
2015
ACM Transactions on Embedded Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The problem is that every memory model calls for new verification algorithms. ...
Weak memory models, however, lead to unforeseen program behavior, and there is a current need for memory model-aware program analysis techniques. ...
The Testing Problem A core problem of these verification methods is the socalled testing problem under weak memory models. ...
doi:10.1145/2753761
fatcat:5w5utlawnvc6tlo7ppai4gi7aq
Memory Model-Aware Testing - A Unified Complexity Analysis
2014
2014 14th International Conference on Application of Concurrency to System Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The problem is that every memory model calls for new verification algorithms. ...
Weak memory models, however, lead to unforeseen program behavior, and there is a current need for memory model-aware program analysis techniques. ...
The Testing Problem A core problem of these verification methods is the socalled testing problem under weak memory models. ...
doi:10.1109/acsd.2014.27
dblp:conf/acsd/FurbachMSS14
fatcat:zojttc7m65h6bjx7nk4zlws6bq
On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties
2012
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
One of the most important open problems of parallel LTL model checking is to design an onthe-fly scalable parallel algorithm with linear time complexity. ...
In this paper we give a partial solution to the problem: we propose an algorithm that has the required properties for a very rich subset of LTL properties, namely those expressible by weak Büchi automata ...
Acknowledgement The third author has been partially supported by Red Hat, Inc. ...
doi:10.1016/j.scico.2011.03.001
fatcat:5gyybcbttfdbnepbl53q2umlgu
Verification of a lazy cache coherence protocol against a weak memory model
2017
2017 Formal Methods in Computer Aided Design (FMCAD)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we verify a modern lazy cache coherence protocol, TSO-CC, against the memory consistency model it was designed for, TSO. ...
The approach is executed entirely within a model checker, no external tool is required and very little in-depth knowledge of formal verification methods is required of the verifier. ...
This poses a problem for the verification of such protocols. ...
doi:10.23919/fmcad.2017.8102242
dblp:conf/fmcad/BanksEHSJN17
fatcat:jpn7cha4lja6lbxr5jhd2uhyn4
« Previous
Showing results 1 — 15 out of 57,691 results