Filters








5,452 Hits in 7.3 sec

Book announcements

1991 Discrete Applied Mathematics  
Unification versus focused binding (Unification relative to equational theories. Unification relative to taxonomic theories. Higher-order unification).  ...  Correctness of a program. Hoare's logic. An equivalence property for correct- ness. Equivalent programs. Approximation of one program by another. Extension to non-deterministic operations.  ... 
doi:10.1016/0166-218x(91)90051-w fatcat:oqpbdxzpljcihecb5tgyinpmva

Quantifiability: Concurrent Correctness from First Principles [article]

Victor Cook, Christina Peterson, Zachary Painter, Damian Dechev
2019 arXiv   pre-print
worst case verification complexity of generating sequential histories motivate a new approach to concurrent correctness.  ...  Desiderata for a new correctness condition are that it be independent of sequential histories, compositional, flexible as to timing, modular as to semantics and free of inherent locking or waiting.  ...  A discussion of these concurrent correctness conditions found in Section V-A. Here follows a brief synopsis. A concurrent history H defines the events in a system of concurrent processes and objects.  ... 
arXiv:1905.06421v3 fatcat:577jyhhhgbewxf437mjplb7mj4

A Concurrency-Optimal Binary Search Tree [chapter]

Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi
2017 Lecture Notes in Computer Science  
for efficient concurrent data structures.  ...  To ensure this property, we use a novel read-write locking scheme that protects tree edges in addition to nodes.  ...  In PPoPP, pages 1-10, 2015. [11] Vincent Gramoli, Petr Kuznetsov, and Srivatsan Ravi. From sequential to concurrent: correctness and relative efficiency (brief announcement).  ... 
doi:10.1007/978-3-319-64203-1_42 fatcat:ywsglklzyngo5acewlmrzltdli

A concurrent ML library in concurrent Haskell

Avik Chaudhuri
2009 SIGPLAN notices  
Then, we extend this implementation to encode all of Concurrent ML's concurrency primitives (and more!) in Concurrent Haskell.  ...  In Concurrent ML, synchronization abstractions can be defined and passed as values, much like functions in ML.  ...  Acknowledgments Thanks to Cormac Flanagan for suggesting this project for his Spring 2007 Concurrent Programming course at UC Santa Cruz.  ... 
doi:10.1145/1631687.1596589 fatcat:2q2d5qk7qjbtlla7uzywatll7q

A concurrent ML library in concurrent Haskell

Avik Chaudhuri
2009 Proceedings of the 14th ACM SIGPLAN international conference on Functional programming - ICFP '09  
Then, we extend this implementation to encode all of Concurrent ML's concurrency primitives (and more!) in Concurrent Haskell.  ...  In Concurrent ML, synchronization abstractions can be defined and passed as values, much like functions in ML.  ...  Acknowledgments Thanks to Cormac Flanagan for suggesting this project for his Spring 2007 Concurrent Programming course at UC Santa Cruz.  ... 
doi:10.1145/1596550.1596589 dblp:conf/icfp/Chaudhuri09 fatcat:m4u6hsn7ivcfhm72qi3tv6kgsa

The Invention of Concurrent Programming [chapter]

Per Brinch Hansen
2001 The Origin of Concurrent Programming  
Brinch Hansen, The invention of concurrent programming. In The Origin of Concurrent Programming: From Semaphores to Remote Procedure Calls, P. Brinch Hansen, Ed.,  ...  Tom Kilburn and David Howarth pioneered the use of interrupts to simulate concurrent execution of several programs on the Atlas computer (Kilburn 1961) .  ...  I thank the Association for Computing Machinery, the Institute of Electrical and Electronics Engineers, and Springer-Verlag for permission to include parts of my earlier essays:  ... 
doi:10.1007/978-1-4757-3472-0_1 fatcat:ngxptj4ch5dqpnte5jnrtruqty

Computable concurrent processes

Yiannis N. Moschovakis
1995 Theoretical Computer Science  
We study relative computability for processes and process transformations, in general, and in particular the non-deterministic and concurrent processes which can be specified in terms of various fair merge  ...  The POPL announcement contained some additional material on the semantics of concurrent languages, whose proofs have been written up in I-13].  ...  After a brief review of these notions in Section 1 and a briefer comparison of the player model with other modelings of concurrency, we will define process computability and state rigorously our results  ... 
doi:10.1016/0304-3975(94)00117-2 fatcat:id6dinjhlrcb3l6fksls272jna

A methodology for implementing highly concurrent data structures

M. Herlihy
1990 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming - PPOPP '90  
A con.curren.t object is a data structure shared by concurrent processes. Conventional techniques for implementing concurrent objects typically rely on criticaI sections:  ...  Acknowledgments I am grateful to Bill Weihl for pointing out a bug in an earlier version of this paper.  ...  with) correctness criteria such as sequential consistency [23] and strict serializability [29] .  ... 
doi:10.1145/99163.99185 dblp:conf/ppopp/Herlihy90 fatcat:rqcq4cz4cnc77asdslk5i655ny

A methodology for implementing highly concurrent data structures

M. Herlihy
1990 SIGPLAN notices  
A con.curren.t object is a data structure shared by concurrent processes. Conventional techniques for implementing concurrent objects typically rely on criticaI sections:  ...  Acknowledgments I am grateful to Bill Weihl for pointing out a bug in an earlier version of this paper.  ...  with) correctness criteria such as sequential consistency [23] and strict serializability [29] .  ... 
doi:10.1145/99164.99185 fatcat:uaah2x4lxzaufok7lx5tymxui4

Reliable and Efficient Concurrent Synchronization for Embedded Real-Time Software

Damian Dechev, Bjarne Stroustrup
2009 2009 Third IEEE International Conference on Space Mission Challenges for Information Technology  
To achieve fast and safe concurrent interactions in mission critical code, we survey the practical state-of-the-art nonblocking programming techniques.  ...  The high degree of autonomy and increased complexity of future robotic spacecraft pose significant challenges in assuring their reliability and efficiency.  ...  Such a sequential history is just one of the several legal sequential histories that can be derived from the concurrent execution of the above operations.  ... 
doi:10.1109/smc-it.2009.45 fatcat:qhatqaxjurg2zldjzzmxewoc5i

A Scalable Concurrent Algorithm for Dynamic Connectivity [article]

Alexander Fedorov, Nikita Koval, Dan Alistarh
2021 arXiv   pre-print
In the sequential case, the problem has been well-studied from both theoretical and practical perspectives. However, much less is known about efficient concurrent solutions to this problem.  ...  In brief, we wish to maintain the connected components of the graph under dynamic edge insertions and deletions.  ...  for efficient navigation in the tree, a field for announcing spanning edge removals, and a lock.  ... 
arXiv:2105.08098v1 fatcat:g3oyrdob5rbmfei3lyuk3aia5q

Scalable nonblocking concurrent objects for mission critical code

Damian Dechev, Bjarne Stroustrup
2009 Proceeding of the 24th ACM SIGPLAN conference companion on Object oriented programming systems languages and applications - OOPSLA '09  
The complex task of engineering reliable and efficient concurrent synchronization is left to the programmer's ingenuity.  ...  Providing fast and safe concurrent synchronization is of critical importance to such autonomous embedded software systems.  ...  Reinholtz, Nicloas Rouquette, and David Wagner from the Jet Propulsion Laboratory's Mission Data System team and Peter Pirkelbauer and Jaakko Järvi from Texas A&M University for their collaboration and  ... 
doi:10.1145/1639950.1639954 dblp:conf/oopsla/DechevS09 fatcat:zcnd4xm44bhtbhyv6i7vn5dk4a

Constant-Time Snapshots with Applications to Concurrent Data Structures [article]

Yuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun
2020 arXiv   pre-print
Our fast, flexible snapshots yield simple, efficient implementations of atomic multi-point queries on concurrent data structures built from CAS objects.  ...  To evaluate the performance of our approach, we apply it to two search trees, one balanced and one not.  ...  We evaluate their running time and correctness by considering the mapping from the concurrent snapshot to the intermediate state, and from the intermediate state to the abstract one.  ... 
arXiv:2007.02372v3 fatcat:slcsbgtlxnc4vih53w42hdshsy

Update Consistency for Wait-Free Concurrent Objects

Matthieu Perrin, Achour Mostefaoui, Claude Jard
2015 2015 IEEE International Parallel and Distributed Processing Symposium  
However, it fails to fully specify the semantics of the operations on shared objects and requires additional non-intuitive and error-prone distributed specification techniques.  ...  In large scale systems such as the Internet, replicating data is an essential feature in order to provide availability and fault-tolerance.  ...  ACKNOWLEDGMENT This work has been partially supported by a French government support granted to the CominLabs excellence laboratory (Project DeSceNt: Plug-based Decentralized Social Network) and managed  ... 
doi:10.1109/ipdps.2015.39 dblp:conf/ipps/PerrinMJ15 fatcat:xjjsfmiw4ffzzepos26mvz6hci

Update Consistency for Wait-free Concurrent Objects [article]

Matthieu Perrin, Achour Mostefaoui, Claude Jard
2015 arXiv   pre-print
However, it fails to fully specify the semantics of the operations on shared objects and requires additional non-intuitive and error-prone distributed specification techniques.  ...  In large scale systems such as the Internet, replicating data is an essential feature in order to provide availability and fault-tolerance.  ...  ACKNOWLEDGMENT This work has been partially supported by a French government support granted to the CominLabs excellence laboratory (Project DeSceNt: Plug-based Decentralized Social Network) and managed  ... 
arXiv:1501.02165v1 fatcat:qycyl34pozeefgp7cjfnbo6sva
« Previous Showing results 1 — 15 out of 5,452 results