Experience Using Multiprocessor Systems—A Status Report
ACM Computing Surveys (CSUR)
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Further comments on Dijkstra's concurrent programming control problem
Communications of the ACM
Additional comments on a problem in concurrent programming control
Communications of the ACM
Additional comments on a problem in concurrent programming control
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Tight bounds for shared memory symmetric mutual exclusion problems
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Algorithms for scalable synchronization on shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
The interaction of architecture and operating system design
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
Stochastic Automata Network of Modeling Parallel Systems
IEEE Transactions on Software Engineering
Improving fast mutual exclusion
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Fast mutual exclusion for uniprocessors
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
An introduction to assertional reasoning for concurrent systems
ACM Computing Surveys (CSUR)
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Fast, scalable synchronization with minimal hardware support
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Adaptive solutions to the mutual exclusion problem
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Implementing multiple locks using Lamport's mutual exclusion algorithm
ACM Letters on Programming Languages and Systems (LOPLAS)
An old-fashioned recipe for real time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Spin-block synchronization algorithm in the shared memory multiprocessor system
ACM SIGOPS Operating Systems Review
Time bounds for mutual exclusion and related problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Time-adaptive algorithms for synchronization
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Contention—free complexity of shared memory algorithms
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Efficient Discrete-Event Simulation of Colored Petri Nets
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
Self-stabilizing topology maintenance protocols for high-speed networks
IEEE/ACM Transactions on Networking (TON)
An efficient recovery-based spin lock protocol for preemptive shared-memory multiprocessors
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Real-time object sharing with minimal system support
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Verification of Real-Time Systems using Linear Relation Analysis
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
Thin locks: featherweight synchronization for Java
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Empirical studies of competitve spinning for a shared-memory multiprocessor
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Analysis of timing-based mutual exclusion with random times
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
A simple local-spin group mutual exclusion algorithm
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Long-lived renaming made adaptive
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fast, wait-free (2k-1)-renaming
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
IEEE Transactions on Parallel and Distributed Systems
An efficient meta-lock for implementing ubiquitous synchronization
Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Concurrent reading and writing with replicated data objects
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
An Efficient State Space Generation for the Analysis of Real-Time Systems
IEEE Transactions on Software Engineering
Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Adaptive and efficient mutual exclusion (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Fast deterministic consensus in a noisy environment
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Abstraction from counters: an application on real-time systems
DATE '00 Proceedings of the conference on Design, automation and test in Europe
Scalable parallel algorithms for interactive visualization of curved surfaces
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Lamport on mutual exclusion: 27 years of planting seeds
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A note on group mutual exclusion
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A Simple Local-Spin Group Mutual Exclusion Algorithm
IEEE Transactions on Parallel and Distributed Systems
Efficient and User-Friendly Verification
IEEE Transactions on Computers
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
Nonatomic mutual exclusion with local spinning
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Lock reservation: Java locks can mostly do without atomic operations
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Fast deterministic consensus in a noisy environment
Journal of Algorithms
Evaluating and Designing Software Mutual Exclusion Algorithms on Shared-Memory Multiprocessors
IEEE Parallel & Distributed Technology: Systems & Technology
Characterizing the Performance of Algorithms for Lock-Free Objects
IEEE Transactions on Computers
The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
Fundamenta Informaticae
The BDD space complexity of different forms of concurrency
Fundamenta Informaticae - Application of concurrency to system design
Concurrent Embedded Real-Time Software Verification
COMPSAC '00 24th International Computer Software and Applications Conference
Fair and Efficient Mutual Exclusion Algorithms (Extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
Fast and Scalable Mutual Exclusion
Proceedings of the 13th International Symposium on Distributed Computing
Computing with Infinitely Many Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Polynominal and Adaptive Long-Lived (2k-1)-Renaming
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Adaptive Mutual Exclusion with Local Spinning
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A Time Complexity Bound for Adaptive Mutual Exclusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Bounded Model Checking for Timed Systems
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Modular State Level Analysis of Distributed Systems Techniques and Tool Support
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Scheduling System Verification
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
UPPAAL - Now, Next, and Future
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Improvements in BDD-Based Reachability Analysis of Timed Automata
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Modeling and verification of parallel processes
Adaptive and efficient mutual exclusion
Distributed Computing
Long-Lived Adaptive Collect with Applications
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Efficient simulation of SWN models
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
On using network attached disks as shared memory
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A decidable notion of timed non-interference
Fundamenta Informaticae - Concurrency specification and programming
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Thin locks: featherweight Synchronization for Java
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Exact High Level WCET Analysis of Synchronous Programs by Symbolic State Space Exploration
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Automatic verification for a class of distributed systems
Distributed Computing
Long lived adaptive splitter and applications
Distributed Computing
An adaptive collect algorithm with applications
Distributed Computing
A new fast-path mechanism for mutual exclusion
Distributed Computing
Distributed Computing
Distributed Computing
Adaptive solutions to the mutual exclusion problem
Distributed Computing
Distributed Computing
Wait-free computing: an introductory lecture
Future Generation Computer Systems - Special issue: Parallel computing technologies
Forward symbolic model checking for real time systems
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Single-scanner multi-writer snapshot implementations are fast!
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Light-weight leases for storage-centric coordination
International Journal of Parallel Programming
The notion of a timed register and its application to indulgent synchronization
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Improvements for the Symbolic Verification of Timed Automata
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
The Weakest Failure Detector for Message Passing Set-Agreement
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
Theoretical Computer Science
Communications of the ACM - Security in the Browser
Transition-Based Directed Model Checking
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Adaptive mutual exclusion with local spinning
Distributed Computing
The Causal Graph Revisited for Directed Model Checking
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
The PlusCal Algorithm Language
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
A casual teaching tool for large size computer laboratories and small size seminar classes
Proceedings of the 37th annual ACM SIGUCCS fall conference: communication and collaboration
Refining Real-Time System Specifications through Bounded Model- and Satisfiability-Checking
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Decision problems for lower/upper bound parametric timed automata
Formal Methods in System Design
TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
A Metric Encoding for Bounded Model Checking
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Bounded Semantics of CTL and SAT-Based Verification
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
SPHIN: A model checker for reconfigurable hybrid systems based on SPIN
Electronic Notes in Theoretical Computer Science (ENTCS)
Wait-free computing: an introductory lecture
Future Generation Computer Systems - Special issue: Parallel computing technologies
Branching processes of high-level Petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Model checking temporal metric specifications with Trio2Promela
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Contention-sensitive data structures and algorithms
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Proceedings of the 19th international conference on Parallel architectures and compilation techniques
A study of shared-memory mutual exclusion protocols using CADP
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
Predicate abstraction and refinement for verifying multi-threaded programs
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Context-enhanced directed model checking
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Verification of timed-arc Petri nets
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
A high-level language for modeling algorithms and their properties
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Partial-coherence abstractions for relaxed memory models
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Getting rid of store-buffers in TSO analysis
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Looking for efficient implementations of concurrent objects
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Model checking timed automata with priorities using DBM subtraction
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Read/Write based fast-path transformation for FCFS mutual exclusion
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
A methodology for creating fast wait-free data structures
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Symbolic model checking of finite precision timed automata
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
An efficient long-lived adaptive collect algorithm
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Properties as processes: their specification and verification
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Secure message transmission with small public discussion
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Can memory be used adaptively by uniform algorithms?
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Adaptive algorithms using bounded memory are inherently non-uniform
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
On the implementation of concurrent objects
Dependable and Historic Computing
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
The renaming problem in shared memory systems: An introduction
Computer Science Review
A Decidable Notion of Timed Non-Interference
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
The BDD Space Complexity of Different Forms of Concurrency
Fundamenta Informaticae - Application of Concurrency to System Design
Fundamenta Informaticae
Decision problems for lower/upper bound parametric timed automata
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Complementary methodologies for developing hybrid systems with event-b
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Symbolic model-checking of stateful timed CSP using BDD and digitization
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Checking and enforcing robustness against TSO
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Science of Computer Programming
Bounded satisfiability checking of metric temporal logic specifications
ACM Transactions on Software Engineering and Methodology (TOSEM) - In memoriam, fault detection and localization, formal methods, modeling and design
Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
Journal of Parallel and Distributed Computing
A practical wait-free simulation for lock-free data structures
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
Computing with infinitely many processes
Information and Computation
| Hi-index | 0.02 |
A new solution to the mutual exclusion problem is presented that, in the absence of contention, requires only seven memory accesses. It assumes atomic reads and atomic writes to shared registers.