Filters








11,728 Hits in 6.1 sec

Robustness Against Transactional Causal Consistency

Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea, Michael Wagner
2019 International Conference on Concurrency Theory  
in transactional programs over a sequentially consistent shared memory.  ...  over a sequentially consistent memory.  ...  Causal memory (CM) semantics. Informally, the semantics of a program under causal memory is defined as follows.  ... 
doi:10.4230/lipics.concur.2019.30 dblp:conf/concur/BeillahiBE19 fatcat:qec6givr4rb25jyoqxnqlm7mta

Verification of Causality Requirements in Java Memory Model Is Undecidable [chapter]

Matko Botinčan, Paola Glavan, Davor Runje
2010 Lecture Notes in Computer Science  
The purpose of the Java memory model is to formalize the behavior of the shared memory in multithreaded Java programs.  ...  In this paper, we consider the problem of verifying whether an execution of a multithreaded Java program satisfies these causality requirements and show that this problem is undecidable.  ...  practical aspect of the sequential consistency memory model verification [SG05] .  ... 
doi:10.1007/978-3-642-14403-5_7 fatcat:irrbue64cbdx5chbgv3hwnv3j4

What's Decidable About Causally Consistent Shared Memory?

Ori Lahav, Udi Boker
2022 ACM Transactions on Programming Languages and Systems  
causally consistent shared memories is still unclear.  ...  Based on a key observation, which we call the "shared-memory causality principle," the two novel semantics may also be of independent use in the investigation of weakly consistent models and their verification  ...  ACKNOWLEDGMENTS We thank the anonymous reviewers for their helpful feedback, and Jean Pichon-Pharabod and Christopher Pulte for their comments on a previous version of this paper.  ... 
doi:10.1145/3505273 fatcat:qpeidszpz5gyfi7w7iapyqryoy

Mental animation in the visuospatial sketchpad: Evidence from dual-task studies

Valerie K. Sims, Mary Hegarty
1997 Memory & Cognition  
Experiment 1 also showed that a visuospatial working memory load interferes more with mental animation than does a verbal memory load.  ...  Both experiments showed that mental animation interferes more with memory for a concurrent visuospatial load than with memory for a verbal load.  ...  This result is consistent with the interpretation that mental animation and dot memory share the resources of the visuospatial sketchpad-if a trial involves more mental animation steps, it renders the  ... 
doi:10.3758/bf03211288 pmid:9184484 fatcat:rqsj5gpa4vg53mlaoukntoeqxe

Verification of the Java Causality Requirements [chapter]

Sergey Polyakov, Assaf Schuster
2006 Lecture Notes in Computer Science  
The Java Memory Model (JMM) formalizes the behavior of shared memory accesses in a multithreaded Java program.  ...  It is now expected to be the prototype for the multithreaded C++ memory model [7] . This article studies the problem of post-mortem verification of the JMM causality requirements.  ...  In weak memory models, causal acyclicity is necessary to guarantee that programs which are data-race free on sequentially consistent platforms will maintain sequentially consistent behavior on weaker platforms  ... 
doi:10.1007/11678779_16 fatcat:brxi2ox4hzhczmetgnhnt7voaa

Parameterized Verification under Release Acquire is PSPACE-complete

Shankaranarayanan Krishna, Adwait Godbole, Roland Meyer, Soham Chakraborty
2022 Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing  
We study the safety verification problem for parameterized systems under the release-acquire (RA) semantics.  ...  We also provide a matching lower bound showing that safety verification is PSPACE-hard.  ...  An Execution under RA. Consider the program in Figure 1 . The initial shared memory m init consists of two messages, one per variable.  ... 
doi:10.1145/3519270.3538445 fatcat:kze6hib64zfmznwmx3edngrcrm

Semantics, Specification, and Bounded Verification of Concurrent Libraries in Replicated Systems [chapter]

Kartik Nagar, Prasita Mukherjee, Suresh Jagannathan
2020 Lecture Notes in Computer Science  
criteria such as linearizability that has a useful interpretation in a shared-memory context to a distributed one where the cost of imposing a (logical) global ordering on all actions is prohibitive.  ...  But, identifying a suitable notion of correctness to check their validity under a weakly consistent execution model has not been well-studied, in large part because it is problematic to naïvely transplant  ...  This material is based upon work supported by the National Science Foundation under Grant No. CCF-SHF 1717741.  ... 
doi:10.1007/978-3-030-53288-8_13 fatcat:3wx2jru3wvaynhdsufpy7gl5my

Predicting Concurrency Failures in the Generalized Execution Traces of x86 Executables [chapter]

Chao Wang, Malay Ganai
2012 Lecture Notes in Computer Science  
In this tutorial, we first provide a brief overview of the latest development in SMT based symbolic predictive analysis techniques and their applications to runtime verification.  ...  Our platform supports efficient monitoring and easy customization of a wide range of execution trace generalization techniques.  ...  Central to the analysis is Φ SC , which specifies, in a valid interleaving, which shared memory read should be mapped to which shared memory write and under what condition.  ... 
doi:10.1007/978-3-642-29860-8_2 fatcat:kaqq5byfqzfkngfws5lm7yyur4

Semantics, Specification, and Bounded Verification of Concurrent Libraries in Replicated Systems [article]

Kartik Nagar, Prasita Mukherjee, Suresh Jagannathan
2020 arXiv   pre-print
criteria such as linearizability that has a useful interpretation in a shared-memory context to a distributed one where the cost of imposing a (logical) global ordering on all actions is prohibitive.  ...  But, identifying a suitable notion of correctness to check their validity under a weakly consistent execution model has not been well-studied, in large part because it is problematic to naively transplant  ...  provided by a replicated system is significantly weaker than the sequential consistency guarantees offered by shared-memory.  ... 
arXiv:2004.10158v1 fatcat:mon343fb6fff5gubcqvoy2qyvy

Robustness Against Transactional Causal Consistency

Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea
2019 Logical Methods in Computer Science  
in transactional programs over a sequentially consistent shared memory.  ...  over a sequentially consistent memory.  ...  However, they only read from the original shared variables (line (9.29)).  ... 
doi:10.23638/lmcs-17(1:12)2021 fatcat:luxermwtrrb37jsxkbauenyvaa

Robustness Against Transactional Causal Consistency [article]

Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea
2021 arXiv   pre-print
in transactional programs over a sequentially consistent shared memory.  ...  over a sequentially consistent memory.  ...  program running over a sequentially consistent shared memory.  ... 
arXiv:1906.12095v5 fatcat:4y5o72jpzjfjbfl6ikq5n2zijm

Mechanized Theory of Event Structures: A Case of Parallel Register Machine

Vladimir Gladstein, Dmitrii Mikhailovskii, Evgenii Moiseenko, Anton Trunov
2021 Proceedings of the Institute for System Programming of RAS  
parallel register machine with shared memory.  ...  Event structures represent the causal dependency and conflict between the individual atomic actions of the system directly.  ...  Under this semantics, memory access instructions do not operate on shared memory but rather produce a label denoting the side-effect of the operation (see fig. 4 ).  ... 
doi:10.15514/ispras-2021-33(3)-11 fatcat:l26vlarbcjdura5xtmxwpvkfwe

Enhancing Memory Access for Less Skilled Readers

Emily R. Smith, Edward J. O'Brien
2016 Scientific Studies of Reading  
Was Ken looking for a hobby?  ...  The second is that an idea unit can be connected to many other idea units if they share causal relations.  ...  Whether particular memory traces are activated is a function of the extent to which a memory trace shares features in common with the incoming text (e.g., Albrecht & Myers, 1995; O'Brien & Albrecht, 1992  ... 
doi:10.1080/10888438.2016.1214590 fatcat:flqcjzsmbfcxzonrfwctqwobqe

Individual differences in mental animation during mechanical reasoning

Mary Hegarty, Valerie K. Sims
1994 Memory & Cognition  
The data of the two groups of subjects were equally consistent with a piecemeal model of mental animation, in which components are animated one by one in order of the causal chain of events in the system  ...  In three experiments we tested the effects of spatial visualization ability on performance of a motion-verification task, in which subjects were shown a diagram of a mechanical system and were a~ked to  ...  Statementsabout kinematic events either described the motion of a pulley or the motion of a rope over or under a pulley.  ... 
doi:10.3758/bf03200867 pmid:7934947 fatcat:4nvqfarc5fdadprc2l2mjwwy7y

Precisely Deciding Control State Reachability in Concurrent Traces with Limited Observability [chapter]

Chao Wang, Kevin Hoang
2014 Lecture Notes in Computer Science  
implemented via shared memory accesses.  ...  We propose a new algorithm for precisely deciding a control state reachability (CSR) problem in runtime verification of concurrent programs, where the trace provides only limited observability of the execution  ...  shared memory accesses.  ... 
doi:10.1007/978-3-642-54013-4_21 fatcat:62rhkvexe5eo7ab342ifncv3cu
« Previous Showing results 1 — 15 out of 11,728 results