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.
Filters
Predicate Abstraction for Relaxed Memory Models
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
We present a novel approach for predicate abstraction of programs running on relaxed memory models. Our approach consists of two steps. ...
This is the first time some of these programs have been verified for a model as relaxed as PSO. 1. verify under SC: find a set of predicates V , sufficient to verify P under sequential consistency, i.e ...
Predicate Abstraction for Relaxed Memory Models In this section we describe how predicate abstraction is used to verify concurrent programs running on relaxed memory models. ...
doi:10.1007/978-3-642-38856-9_7
fatcat:sobmwtekfvem5gfxo2nmhvu4cy
Optimization of a General Model Checking Framework for Various Memory Consistency Models
2014
Proceedings of the 8th International Conference on Partitioned Global Address Space Programming Models - PGAS '14
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.
While relaxed memory consistency models contribute optimizations of compilers on multicore CPUs and shared memory distributed programming languages, their relaxedness makes it difficult to write programs ...
To address this problem, the authors proposed a general model checking framework and implemented a prototype tool McSPIN, which can take a memory consistent model as an input, as well as a program and ...
[24] proposed a predicate abstraction approach for model checking under relaxed memory consistency models. ...
doi:10.1145/2676870.2676878
dblp:conf/pgas/AbeM14
fatcat:54pks2otenfv7oolduqpq53sqa
Automatic Fence Insertion in Integer Programs via Predicate Abstraction
[chapter]
2012
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 2015; you can also visit the original URL.
The file type is application/pdf.
We propose an automatic fence insertion and verification framework for concurrent programs running under relaxed memory. ...
abstraction refinement loop of the model obtained from the combination of the two abstraction techniques. ...
The proposed technique can be generalized to memory models such as the partial store order memory model or the power memory model. ...
doi:10.1007/978-3-642-33125-1_13
fatcat:y2yofqnybrcgpgujbna532z2kq
Synthesis of Memory Fences via Refinement Propagation
[chapter]
2014
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.
We address the problem of fence inference in infinite-state concurrent programs running on relaxed memory models such as TSO and PSO. ...
(ii) synthesis with refinement propagation: to synthesize fences for a program P , we combine abstraction refinements used for successful synthesis of programs coarser than P into a new candidate abstraction ...
Introduction Modern architectures use relaxed memory models in which memory operations may be reordered and executed non-atomically [2] . ...
doi:10.1007/978-3-319-10936-7_15
fatcat:mu4y3whi2bbzhaltvsam7gthm4
Reducing State Explosion for Software Model Checking with Relaxed Memory Consistency Models
[article]
2016
arXiv
pre-print
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.
, a model checker for memory consistency models that we are developing. ...
Software model checking suffers from the so-called state explosion problem, and relaxed memory consistency models even worsen this situation. ...
This research partly used computational resources under Collaborative Research Program for Young Scientists provided by Academic Center for Computing and Media Studies, Kyoto University. ...
arXiv:1608.05893v1
fatcat:vsdp5dxi2bggtcor3pout57xrq
Page 839 of Psychological Abstracts Vol. 88, Issue 3
[page]
2001
Psychological Abstracts
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
—Evaluated categorical and featural proposals of memory organization for explaining the living/nonliving things dissociation observed in semantic memory. ...
the visual analysis of static element features, converging upon those predicates relevant for the solution.
6581. ...
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
[chapter]
2006
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 2018; you can also visit the original URL.
The file type is application/pdf.
Next, we define a relaxed memory model that conservatively approximates several common shared-memory multiprocessors. ...
Next, we define a relaxed memory model that conservatively approximates several common shared-memory multiprocessors. ...
Encoding Relaxed Memory Models Relaxed memory models impose fewer ordering restrictions on the instruction streams than sequential consistency; therefore R T,I,SeqCons ⊂ R T,I,L for all relaxed models ...
doi:10.1007/11817963_45
fatcat:xnpjjwed6jcxvcbkka7k4jol64
Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators
2005
The Journal of Artificial Intelligence Research
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.
Other Versions
Despite recent progress in AI planning, many benchmarks remain challenging for current planners. ...
Our system, Macro-FF, extends Hoffmann's state-of-the-art planner FF 2.3 with support for two kinds of macro-operators, and with engineering enhancements. ...
We thank Jörg Hoffmann for making the source code of FF available, and for kindly answering many technical questions related to FF. ...
doi:10.1613/jair.1696
fatcat:cjqaezl67vajnicunmyianyjp4
A Separation Logic for Fictional Sequential Consistency
[chapter]
2015
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 2016; you can also visit the original URL.
The file type is application/pdf.
The logic supports reasoning about libraries that directly exploit the relaxed memory model to achieve maximum efficiency. ...
In this paper we propose a new proof system, iCAP-TSO, that captures this fiction formally, for a language with a TSO memory model. ...
This research was supported in part by the ModuRes Sapere Aude Advanced Grant from The Danish Council for Independent Research for the Natural Sciences (FNU). ...
doi:10.1007/978-3-662-46669-8_30
fatcat:ivkfjgpyznat3f2hjomreeps7a
Verification of Snapshot Isolation in Transactional Memory Java Programs
[chapter]
2012
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.
This paper presents an automatic verification technique for transactional memory Java programs executing under snapshot isolation level. ...
We corroborate known results, certifying some of the examples for safe execution under snapshot isolation by proving the absence of write-skew anomalies. ...
Acknowledgments We are grateful to the anonymous reviewers for several insightful comments that significantly improved the paper. ...
doi:10.1007/978-3-642-31057-7_28
fatcat:4akqrmjg2bduzhgagz6yjqnbwy
Relaxed Operational Semantics of Concurrent Programming Languages
2012
Electronic Proceedings in Theoretical 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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2012 pre-print arXiv:1208.5915v1 fatcat:4nayrfzexjasxbecwt2vcymjnq
We propose a novel, operational framework to formally describe the semantics of concurrent programs running within the context of a relaxed memory model. ...
The memory model also involves a "write grain," accounting for architectures where a thread may read a write that is not yet globally visible. ...
Our model is flexible enough to account for a wide variety of weak behaviors, and in particular the odd ones occurring in a memory model that does not preserve the atomicity of writes. ...
doi:10.4204/eptcs.89.3
fatcat:iuj6c5kny5b6rewwvi36g7jkra
Compositional Verification of Compiler Optimisations on Relaxed Memory
[chapter]
2018
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 2018; you can also visit the original URL.
The file type is application/pdf.
Axiomatic relaxed models, such as C++11, present particular challenges for determining validity, because such models allow subtle effects of a block transformation to be observed by the rest of the program ...
Using this property, we realise the theory in the first push-button tool that can verify real-world optimisations under an axiomatic memory model. ...
Thanks to Jeremy Jacob, Viktor Vafeiadis, and John Wickerson for comments and suggestions. ...
doi:10.1007/978-3-319-89884-1_36
fatcat:j3foslo3cnburajmywybnzsv24
Dynamic synthesis for relaxed memory models
2012
SIGPLAN notices
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 2016; you can also visit the original URL.
The file type is application/pdf.
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. ...
In this paper, we present the first scalable framework for handling real-world concurrent algorithms running on relaxed architectures. ...
Their work does not deal with relaxed memory models.
Conclusion We introduced dynamic synthesis for concurrent programs running on relaxed memory models. ...
doi:10.1145/2345156.2254115
fatcat:ggcf7l77d5ewvdpuewermkjtum
Dynamic synthesis for relaxed memory models
2012
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation - PLDI '12
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 2016; you can also visit the original URL.
The file type is application/pdf.
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. ...
In this paper, we present the first scalable framework for handling real-world concurrent algorithms running on relaxed architectures. ...
Their work does not deal with relaxed memory models.
Conclusion We introduced dynamic synthesis for concurrent programs running on relaxed memory models. ...
doi:10.1145/2254064.2254115
dblp:conf/pldi/LiuNPVY12
fatcat:oh4yvmseqzgyfh4lu3s5tzypmm
Inferring Fences in a Concurrent Program Using SC proof of Correctness
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
These processors, for performance reasons, implement relaxed memory models. As a result of this relaxation a program, proved correct on the SC memory model, might execute incorrectly. ...
Most proof systems for concurrent programs assume the underlying memory model to be sequentially consistent (SC), an assumption which does not hold for modern multicore processors. ...
implies the correctness under relaxed memory model. ...
arXiv:1304.2936v1
fatcat:7y5bfalzxjdn3plxbemykw5nk4
« Previous
Showing results 1 — 15 out of 14,048 results