Search results for "lock-freedom"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
181	Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaard	Progress guarantee for parallel programs via bounded lock-freedom.	PLDI	2009	DBLP DOI BibTeX RDF	bounded lock-freedom, lock-freedom, progress guarantees, model checking, parallel computation
85	Naoki Kobayashi 0001, Davide Sangiorgi	A Hybrid Type System for Lock-Freedom of Mobile Processes.	CAV	2008	DBLP DOI BibTeX RDF
50	Anders Gidenstam, Marina Papatriantafilou	LFthreads: A Lock-Free Thread Library.	OPODIS	2007	DBLP DOI BibTeX RDF	synchronization, multiprocessors, shared memory, multithreading, multicores, lock-free
49	Maurice Herlihy, Victor Luchangco, Mark Moir	Obstruction-Free Synchronization: Double-Ended Queues as an Example.	ICDCS	2003	DBLP DOI BibTeX RDF
35	Daniel Cederman, Philippas Tsigas	Supporting lock-free composition of concurrent data objects.	Conf. Computing Frontiers	2010	DBLP DOI BibTeX RDF	data structures, composition, lock-free
35	Daniel Cederman, Philippas Tsigas	Supporting lock-free composition of concurrent data objects.	PPoPP	2010	DBLP DOI BibTeX RDF	data structures, composition, lock-free
34	Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin	Separating lock-freedom from wait-freedom at every level of the consensus hierarchy.	J. Parallel Distributed Comput.	2022	DBLP DOI BibTeX RDF
34	Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin	Separating Lock-Freedom from Wait-Freedom.	PODC	2018	DBLP DOI BibTeX RDF
34	Oksana Denysyuk, Philipp Woelfel	Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability.	DISC	2015	DBLP DOI BibTeX RDF
33	Filip Pizlo, Daniel Frampton, Erez Petrank, Bjarne Steensgaard	Stopless: a real-time garbage collector for multiprocessors.	ISMM	2007	DBLP DOI BibTeX RDF	real-time, concurrency, garbage collection, lock-free
31	Brijesh Dongol	Formalising Progress Properties of Non-blocking Programs.	ICFEM	2006	DBLP DOI BibTeX RDF
31	Matthias Majuntke, Dan Dobre, Marco Serafini, Neeraj Suri	Abortable Fork-Linearizable Storage.	OPODIS	2009	DBLP DOI BibTeX RDF	Fork-linearizability, abortable objects, lock-freedom, shared memory, online collaboration
31	William N. Scherer III, Doug Lea, Michael L. Scott	Scalable synchronous queues.	PPoPP	2006	DBLP DOI BibTeX RDF	contention freedom, dual data structures, dual queue, dual stack, lock freedom, synchronous queue, nonblocking synchronization
23	Alexey Gotsman, Byron Cook, Matthew J. Parkinson, Viktor Vafeiadis	Proving that non-blocking algorithms don't block.	POPL	2009	DBLP DOI BibTeX RDF	formal verification, concurrent programming, termination, liveness
23	Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit	Obstruction-Free Algorithms Can Be Practically Wait-Free.	DISC	2005	DBLP DOI BibTeX RDF
23	Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III	Software transactional memory for dynamic-sized data structures.	PODC	2003	DBLP DOI BibTeX RDF	Java
23	Rob van Glabbeek, Peter Höfner, Ross Horne	Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom.	CoRR	2021	DBLP BibTeX RDF
23	Rob van Glabbeek, Peter Höfner, Ross Horne	Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom.	LICS	2021	DBLP DOI BibTeX RDF
23	Nhat Minh Lê	Kahn Process Networks as Concurrent Data Structures: Lock Freedom, Parallelism, Relaxation in Shared Memory. (Les réseaux de processus de Kahn : progrès non bloquant, parallélisme, relâchement en mémoire partagée).		2016	RDF
23	Xiao Jia 0001, Wei Li, Viktor Vafeiadis	Proving Lock-Freedom Easily and Automatically.	CPP	2015	DBLP DOI BibTeX RDF
23	Marco Carbone, Ornela Dardha, Fabrizio Montesi	Progress as Compositional Lock-Freedom.	COORDINATION	2014	DBLP DOI BibTeX RDF
23	Luca Padovani	Deadlock and lock freedom in the linear π-calculus.	CSL-LICS	2014	DBLP DOI BibTeX RDF
23	Luca Padovani	From Lock Freedom to Progress Using Session Types.	PLACES	2013	DBLP DOI BibTeX RDF
23	Jan Hoffmann 0002, Michael Marmar, Zhong Shao	Quantitative Reasoning for Proving Lock-Freedom.	LICS	2013	DBLP DOI BibTeX RDF
23	Naoki Kobayashi 0001, Davide Sangiorgi	A hybrid type system for lock-freedom of mobile processes.	ACM Trans. Program. Lang. Syst.	2010	DBLP DOI BibTeX RDF
23	Bogdan Tofan, Simon Bäumler, Gerhard Schellhorn, Wolfgang Reif	Temporal Logic Verification of Lock-Freedom.	MPC	2010	DBLP DOI BibTeX RDF
23	Robert Colvin, Brijesh Dongol	A general technique for proving lock-freedom.	Sci. Comput. Program.	2009	DBLP DOI BibTeX RDF
23	Robert Colvin, Brijesh Dongol	Verifying Lock-Freedom Using Well-Founded Orders.	ICTAC	2007	DBLP DOI BibTeX RDF
23	Keir Fraser	Practical lock-freedom.		2004	RDF
23	Howard Bowman	Time and Action Lock Freedom Properties for Timed Automata.	FORTE	2001	DBLP BibTeX RDF
18	Shivali Agarwal, Rajkishore Barik, Dan Bonachea, Vivek Sarkar, R. K. Shyamasundar, Katherine A. Yelick	Deadlock-free scheduling of X10 computations with bounded resources.	SPAA	2007	DBLP DOI BibTeX RDF	deadlock-free scheduling, X10, active messages
18	Virendra J. Marathe, William N. Scherer III, Michael L. Scott	Adaptive Software Transactional Memory.	DISC	2005	DBLP DOI BibTeX RDF
13	Antonio Brogi, Razvan Popescu	Workflow-based semantics for peer-to-peer specifications.	Frontiers Comput. Sci. China	2008	DBLP DOI BibTeX RDF	BPEL processes, YAWL workflows, P2P systems
13	Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh	Permissiveness in Transactional Memories.	DISC	2008	DBLP DOI BibTeX RDF
13	Antonio Brogi, Razvan Popescu	Workflow Semantics of Peer and Service Behaviour.	TASE	2008	DBLP DOI BibTeX RDF	service-oriented modelling language, YAWL workflows, Peer-to-peer systems, BPEL
13	Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit	Using elimination to implement scalable and lock-free FIFO queues.	SPAA	2005	DBLP DOI BibTeX RDF	scalability, multiprocessors, lock-free, linearizability, nonblocking synchronization, FIFO queues, elimination