Filters








9 Hits in 6.4 sec

Relaxing safely: verified on-the-fly garbage collection for x86-TSO

Peter Gammie, Antony L. Hosking, Kai Engelhardt
2015 SIGPLAN notices  
We report on a machine-checked verification of safety for a stateof-the-art, on-the-fly, concurrent, mark-sweep garbage collector that is designed for multi-core architectures with weak memory consistency  ...  The proof explicitly incorporates the relaxed memory semantics of x86 multiprocessors. To our knowledge, this is the first fully machine-checked proof of safety for such a garbage collector.  ...  We thank our NICTA colleagues, the anonymous PLDI paper and artifact reviewers, and Shaz Qadeer for their valuable feedback.  ... 
doi:10.1145/2813885.2738006 fatcat:urrb4da5djh63kltjamw2z47ty

Relaxing safely: verified on-the-fly garbage collection for x86-TSO

Peter Gammie, Antony L. Hosking, Kai Engelhardt
2015 Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2015  
We report on a machine-checked verification of safety for a stateof-the-art, on-the-fly, concurrent, mark-sweep garbage collector that is designed for multi-core architectures with weak memory consistency  ...  The proof explicitly incorporates the relaxed memory semantics of x86 multiprocessors. To our knowledge, this is the first fully machine-checked proof of safety for such a garbage collector.  ...  We thank our NICTA colleagues, the anonymous PLDI paper and artifact reviewers, and Shaz Qadeer for their valuable feedback.  ... 
doi:10.1145/2737924.2738006 dblp:conf/pldi/GammieHE15 fatcat:q2z6nochuvg2te6wgauo2zkoge

Transactional Sapphire

Tomoharu Ugawa, Carl G. Ritson, Richard E. Jones
2018 ACM Transactions on Programming Languages and Systems  
We describe our experience of implementing the Sapphire algorithm as the irst on-the-ly, parallel, replication copying, garbage collector for the Jikes RVM Java virtual machine.  ...  Constructing a high-performance garbage collector is hard. Constructing a fully concurrent 'on-the-ly', compacting collector is much more so.  ...  We are also grateful for the support of the EPSRC through grants EP⁄H026975⁄1 (http:⁄⁄gow.epsrc.ac.uk⁄NGBOViewGrant.aspx?  ... 
doi:10.1145/3226225 fatcat:4owlkf4n35f3xlwebvt47ye3le

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

Michael Philippsen, Pascal Felber, Michael L. Scott, J. Eliot B. Moss, Marc Herbstritt
2015 Dagstuhl Reports  
The current seminar built on the previous seminars by notably (1) broadening the scope to concurrency beyond transactional memory and shared-memory multicores abstractions, (2) focusing on the new challenges  ...  and potential uses of emerging hardware support for synchronization extensions, and (3) considering the increasing complexity resulting from the explosion in heterogeneity.  ...  The proof explicitly accounts for both of these features, incorporating the x86-TSO model for relaxed memory semantics on x86 multiprocessors.  ... 
doi:10.4230/dagrep.5.1.1 dblp:journals/dagstuhl-reports/PhilippsenFSM15 fatcat:owcmta65hzb5vmglwq3dwzbehy

The Java memory model

Jeremy Manson, William Pugh, Sarita V. Adve
2005 Proceedings of the 32nd ACM SIGPLAN-SIGACT sysposium on Principles of programming languages - POPL '05  
We also provide formal and informal techniques for verifying that the model provides this balance.  ...  The work described in this dissertation has been incorporated into the version 5.0 of the Java programming language. The Java Memory Model  ...  The package java.lang.ref describes weak references, which interact with garbage collection and finalization.  ... 
doi:10.1145/1040305.1040336 dblp:conf/popl/MansonPA05 fatcat:tv3nlt27jzhhxaiwch2m7if2vm

Dagstuhl Reports, Volume 11, Issue 10, October 2021, Complete Issue [article]

2022
Myreen. x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors. Commun. ACM 53(7), 2010.  ...  As far as the concurrency semantics is concerned, Intel-x86 is widely believed to follow the x86-TSO model of Sewell et al. [1] .  ...  In this talk, we report on a project that has been ongoing for over 5 years on building a formally verified secure compilation chain for unsafe C components based on a variant of the CompCert compiler  ... 
doi:10.4230/dagrep.11.10 fatcat:mqui2qttdrdt7p6y3nbkkodoci

OASIcs, Volume 43, ICCSW'14, Complete Volume [article]

Rumyana Neykova, Nicholas Ng
2014
The author also thanks three anonymous reviewers for comments that improved this paper.  ...  We would like to thank the anonymous reviewers for their helpful and constructive comments. I C C S W ' 1 4  ...  Example: x86-TSO A (comparatively) simple example of weak memory is the model describing Intel and AMD's x86 and x86-64 processors, known as x86-TSO (Total Store Order) [9] .  ... 
doi:10.4230/oasics.iccsw.2014 fatcat:toysxgo6gfhprel6qgpx32lqma

Quality of Experience: From Assessment to Application (Dagstuhl Seminar 15022) Understanding Complexity in Multiobjective Optimization (Dagstuhl Seminar 15031) Model-driven Algorithms and Architectures for Self-Aware Computing Systems (Dagstuhl Seminar 15041) Artificial and Computational Intelligence in Games: Integration (Dagstuhl Seminar 15051)

Michael Philippsen, Pascal Felber, Michael Scott, J Eliot, Katrien De Moor, Markus Fiedler, Peter Reichl, Martín Varela, Salvatore Greco, Kathrin Klamroth, Joshua Knowles, Günter Rudolph (+13 others)
2015 unpublished
The example problems mentioned in this report may serve as a first benchmark for such approaches.  ...  The research field of artificial and computational intelligence in games focuses on the wide variety of advanced computational techniques used to create, enhance, and improve the experiences of humans  ...  On verifying concurrent garbage collection for x86-TSO Notes (collected by members of the audience) Proved essentially that garbage collector on multi-/many-core architecture doesn't collect non-garbage  ... 
fatcat:ckaercgotnenhidbwsz7zufttq

Practical systematic concurrency testing for concurrent and distributed software

Paul Thomson, Alastair Donaldson, Cristian Cadar, Engineering And Physical Sciences Research Council
2018
go beyond the current theoretical limits; (3) The feasibility of applying SCT in practice is unclear, particularly for distributed systems.  ...  The program under test is repeatedly executed such that a particular schedule is explored on each execution. Numerous techniques have been proposed to make SCT scalable.  ...  The keys are weak references so that the objects can still be garbage collected.  ... 
doi:10.25560/55908 fatcat:7cewm4nb5rbdtbwwzdnrhmfm2i