Automatic discovery of mutual exclusion algorithms: (Preliminary version)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2848, Issue , 2003, Pages 136-150

  Bar David, Yoah ^a   Taubenfeld, Gadi ^b  

^a Interdisciplinary Center ^*  (Israel)

^b INTERDISCIPLINARY CENTER   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

AUTOMATIC DISCOVERY; BRUTE-FORCE APPROACH; MECHANICAL VERIFICATION; MUTUAL EXCLUSION ALGORITHMS; MUTUAL EXCLUSIONS; SYNCHRONIZATION ALGORITHM;

ALGORITHMS;

EID: 34548032051     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39989-6_10     Document Type: Article

References (20)

1. P. Attie and E. Emerson. Synthesis of concurrent systems with many similar processes. ACM Tran. on Programming Languages and Systems 20(1):51-115, 1998.
2. R. Alur and G. Taubenfeld. Contention-free complexity of shared memory algorithms. Information and Computation 126(1):62-73,1996.
3. th annual allerton conf. on communication, control and computing, 833-842, 1980.
4. J.N. Burns and N.A. Lynch. Bounds on shared-memory for mutual exclusion. Information and Computation, 107(2):171-184, December 1993.
5. E.M. Clarke, O. Grumberg and D. Peled. Model Checking. The MIT Press, 2000.
6. E.M. Clarke, J.M. Wing, et al. Formal Methods: State of the art and future directions. ACM Computing Surveys, 28(4):626-643, December 1996.
7. E. Emerson and E.M. Clarke. Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming 2:241-266, 1982.
8. E.W. Dijkstra. Solutions of a problem in concurrent programming control. Communications of the ACM, 8(9):569, 1965.
9. J.L.W. Kessels. Arbitration without common modifiable variables. Acta Informatica, 17(2):135-141, June 1982.
10. D.E. Knuth. The art of computer programming. Addison-Wesley, 2nd ed., 1973.
11. th IEEE Symp. on logic in computer science, 2001.
12. L. Lamport. The mutual exclusion problem: Part II - Statement and Solutions. Journal of the ACM, 33:327-348, 1986.
13. Z. Manna and R. Waldinger. A deductive approach to program synthesis. ACM Transactions on Programming Languages and Systems 2(1):90-121, 1980.
14. Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Tran. on Programming Lang, and Systems 6(1):68-93, 1984.
15. G.L. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12(3):115-116, 1981
16. th ACM Symp. on Theory of Computing, 91-97, 1977.
17. st FOCS, 746-757, 1990.
18. th IEEE Computer Security Foundation Workshop, July 2000.
19. M. Raynal. Algorithms for mutual exclusion. The MIT Press, 1986. Translation of: Algorithmique du parallelisme, 1984.
20. R.E. Tarjan, Data Structures and Network Algorithms. Society for industrial and Applied Mathematics, 1983.