[biblio01_01] [1] Lamport on mutual exclusion: 27 years of planting seeds. In Twentieth Annual ACM Symposium on Principles of Distributed Computing, pages 3–12, 2001.
[biblio01_02] [2] Foundations of Multithreaded, Parallel, and Distributed Programming. Addison-Wesley, Reading, MA, <year>2000</year>.
[biblio01_03] [3] and Verification of Sequential and Concurrent Programs. Springer-Verlag, Berlin, <year>1991</year>.
[biblio01_05] [5] High Integrity Software: The SPARK Approach to Safety and Security. Addison-Wesley, Harlow, <year>2003</year>.
[biblio01_06] [6] Implemementing semaphores by binary semaphores. ACM SIGPLAN Notices, (2):39–45, 1983.
[biblio01_07] [7] Ada for Software Engineers. John Wiley, Chichester, <year>1998</year>. Out of print. The book can be freely downloaded for use in education and research from my website http://stwww.weizmann.ac.il/g-cs/benari/books/.
[biblio01_08] [8] Interactive execution of distributed algorithms. ACM Journal on Educational Resources in Computing, (2), 2001.
[biblio01_09] [9] Mathematical Logic for Computer Science (Second Revised Edition). Springer-Verlag, London, <year>2001</year>.
[biblio01_11] [11] and Cloture votes: n/ 4-resilient distributed consensus in t + 1 rounds. Mathematical Systems Theory, (1):3–19, 1993.
[biblio01_12] [12] and Verifying temporal properties of reactive systems: A STeP tutorial. Formal Methods in System Design, (3):227–270, 2000.
[biblio01_13] [13] The Search for Simplicity: Essays in Parallel Programming. IEEE Computer Society Press, Los Alamitos, CA, <year>1996</year>.
[biblio01_14] [14] Per BrinchHansen, editor. Classic Operating Systems: From Batch Processing to Distributed Systems. Springer-Verlag, New York, <year>2001</year>.
[biblio01_16] [16] and Concurrent urban legends. Concurrency and Computation: Practice and Experience, :1133–1172, 2005.
[biblio01_17] [17] and Guide for the use of the Ada Ravenscar Profile in high integrity systems. Technical Report YCS-2003-348, University of York, 2003. http://www.cs.york.ac.uk/ftpdir/reports/YCS-2003-348.pdf.
[biblio01_18] [18] and Concurrency in Ada (Second Edition). Cambridge University Press, Cambridge, <year>1998</year>.
[biblio01_19] [19] and Real Time Systems and Programming Languages: Ada 95, Real-Time Java and Real-Time C/POSIX (3rd Edition). Addison-Wesley, Reading, MA, <year>2001</year>.
[biblio01_20] [20] and After you, Alfonse: A mutual exclusion toolkit. ACM SIGCSE Bulletin, (1):170–174, 1996.
[biblio01_21] [21] and On mutual exclusion in computer networks. Communications of the ACM, (2):146–148, 1983.
[biblio01_22] [22] and Distributed snapshots: Determining global states of distributed systems. ACM Transactions on Computer Systems, (1):63–75, 1985.
[biblio01_23] [23] and Parallel Program Design: A Foundation. Addison-Wesley, Reading, MA, <year>1988</year>.
[biblio01_25] [25] and Termination detection for diffusing computations. Information Processing Letters, (1):1–4, 1980.
[biblio01_26] [26] and Variants of the software solution to mutual exclusion. Information Processing Letters, (4/5):206–208, 1980.
[biblio01_27] [27] and PVM: Parallel Virtual Machine: A User’s Guide and Tutorial for Networked Parallel Computing. MIT Press, Cambridge, MA, <year>1994</year>. http://www.netlib.org/pvm3/index.html.
[biblio01_28] [28] and How to Write Parallel Programs—A First Course. MIT Press, Cambridge, MA, <year>1990</year>.
[biblio01_29] [29] and Using MPI: Portable Parallel Programming with the Message-Passing Interface (Second Edition). MIT Press, Cambridge, MA, <year>1999</year>.
[biblio01_30] [30] and The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge, MA, <year>1989</year>.
[biblio01_31] [31] Concurrent Programming: The Java Programming Language. Oxford University Press, Oxford, <year>1998</year>.
[biblio01_32] [32] Communicating Sequential Processes. Prentice Hall International, Hemel Hempstead, UK, 1985–2004. http://www.usingcsp.com/cspbook.pdf.
[biblio01_33] [33] The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, Reading, MA, <year>2004</year>.
[biblio01_34] [34] Detecting termination of distributed computations by external agents. In IEEE 9th International Conference on Distributed Computer Systems, pages 79–84, 1989.
[biblio01_35] [35] What really happened on Mars Rover Pathfinder. The Risks Digest, (49), 1997. http://catless.ncl.ac.uk/Risks/19.49.html.
[biblio01_36] [36] A new solution of Dijkstra’s concurrent programming problem. Communications of the ACM, (8):453–455, 1974.
[biblio01_37] [37] clocks, and the ordering of events in a distributed system. Communications of the ACM, (7):558–565, 1978.
[biblio01_38] [38] The mutual exclusion problem: Part I—a theory of interprocess communication. Journal of the ACM, (2):313–326, 1986.
[biblio01_39] [39] The mutual exclusion problem: Part II—statement and solutions. Journal of the ACM, (2):327–348, 1986.
[biblio01_40] [40] A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, (1):1–11, 1987.
[biblio01_41] [41] Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley, Reading, MA, <year>2002</year>. http://research.microsoft.com/users/lamport/tla/tla.html.
[biblio01_42] [42] and The Byzantine Generals problem. ACM Transactions on Programming Languages and Systems, (3):382–401, 1982.
[biblio01_43] [43] Paul Pettersson, and Wang Yi. UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer, (1–2):134–152, 1998. http://www.uppaal.com/documentation.shtml.
[biblio01_45] [45] Ariane 5 flight 501 failure: Report by the inquiry board. http://ravel.esrin.esa.it/docs/esa-x-1819eng.pdf, 1996.
[biblio01_46] [46] Reduction: A method of proving properties of parallel programs. Communications of the ACM, (12):717–721, 1975.
[biblio01_49] [49] and Concurrency: State Models & Java Programs. John Wiley, Chichester, <year>1999</year>.
[biblio01_50] [50] and The Temporal Logic of Reactive and Concurrent Systems. Volume I: Specification. Springer-Verlag, New York, <year>1992</year>.
[biblio01_51] [51] and The Temporal Verification of Reactive Systems. Volume II: Safety. Springer-Verlag, New York, <year>1995</year>.
[biblio01_52] [52] and A taxonomy of distributed termination algorithms. The Journal of Systems and Software, :207–221, 1998.
[biblio01_53] [53] Global quiescence detection based on credit distribution and recovery. Information Processing Letters, (4):195–200, 1989.
[biblio01_54] [54] and A dag-based algorithm for distributed mutual exclusion. In IEEE 11th International Conference on Distributed Computing Systems, pages 354–360, 1991.
[biblio01_55] [55] Theory and Practice of Concurrency. Prentice Hall, Hemel Hempstead, UK, <year>1998</year>.
[biblio01_56] [56] Towards Effective Model Checking. PhD thesis, University of Twente, <year>2001</year>. http://wwwhome.cs.utwente.nl/~ruys/.
[biblio01_58] [58] Concurrent and Real-time Systems: The CSP Approach. John Wiley, Chichester, <year>2000</year>.
[biblio01_59] [59] and Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers, :1175–1185, 1990.
[biblio01_61] [61] Four-slot fully asynchronous communication mechanism. IEE Proceedings, (1):17–30, 1990.
[biblio01_62] [62] and The Space Shuttle primary computer system. Communications of the ACM, (9):874–900, 1984.
[biblio01_63] [63] Operating Systems: Internals and Design Principles. Prentice Hall, Upper Saddle River, NJ, <year>2000</year>.
[biblio01_64] [64] and A distributed mutual exclusion algorithm. ACM Transactions on Computer Systems, (4):344–349, 1985.
[biblio01_65] [65] and Virtual trees for the Byzantine Generals algorithm. ACM SIGCSE Bulletin, (1):392–396, 2004.
[biblio01_66] [66] Computers in spaceflight: The NASA experience. http://www.hq.nasa.gov/office/pao/History/computers/Compspace.html, 1988.
[biblio01_67] [67] and Further comments on “a correct and unrestrictive implementation of general semaphores”. ACM SIGOPS Operating Systems Review, (3):5–10, 2000.
18.118.12.50