The PlusCal algorithm language

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

Volumn 5684 LNCS, Issue , 2009, Pages 36-60

  Lamport, Leslie ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT ALGORITHMS; MODEL CHECKER; PROGRAMMING LANGUAGE; PSEUDO-CODE;

COMPUTER SCIENCE; COMPUTER SOFTWARE; LINGUISTICS; MODEL CHECKING; QUERY LANGUAGES; SEQUENTIAL SWITCHING; SPECIFICATION LANGUAGES; SPECIFICATIONS;

ALGORITHMS;

EID: 70349314894     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03466-4_2     Document Type: Conference Paper

References (20)

1. Wirth, N.: Algorithms + Data Structures = Programs. Prentice-Hall, Englewood Cliffs (1975)
2. Lamport, L.: Specifying Systems. Addison-Wesley, Boston (2003), http://lamport.org
3. Yu, Y., Manolios, P., Lamport, L.: Model checking TLA+ specifications. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol.1703, pp. 54-66. Springer, Heidelberg (1999)
4. Lamport, L.: The PlusCal algorithm language, http://research.microsoft. com/users/lamport/tla/pluscal.html The page can also be found by searching the Web for the 25-letter string obtained by removing the "-" from uid-lamportpluscalhomepage
5. Sedgewick, R.: Algorithms. Addison-Wesley, Reading (1988)
6. Hoare, C.A.R.: Algorithm 64: Quicksort. Communications of the ACM 4, 321 (1961)
7. Lamport, L.: A fast mutual exclusion algorithm. ACM Transactions on Computer Systems 5, 1-11 (1987)
8. Lamport, L.:What good is temporal logic? In:Mason, R.E.A. (ed.) Information Processing 83: Proceedings of the IFIP 9th World Congress, Paris, IFIP, pp. 657-668. North-Holland, Amsterdam (1983)
9. Pratt, V.R.: Semantical considerations on Floyd-Hoare logic. In: 17th Symposium on Foundations of Computer Science, pp. 109-121. IEEE, Los Alamitos (1976)
10. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Mateo (1995)
11. Francez, N.: Fairness. Texts and Monographs in Computer Science. Springer, Heidelberg (1986)
12. Lamport, L.: Checking a multithreaded algorithm with +CAL. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.4167, pp. 151-163. Springer, Heidelberg (2006)
13. Lamport, L.: The temporal logic of actions. ACM Transactions on Programming Languages and Systems 16, 872-923 (1994)
14. Schwartz, J.T., Dewar, R.B., Schonberg, E., Dubinsky, E.: Programming with sets: An Introduction to SETL. Springer, New York (1986)
15. Jackson, D.: Alloy: a lightweight object modelling notation. ACM Transactions on Software Engineering and Methodology 11, 256-290 (2002) (Pubitemid 44159313)
16. Holzmann, G.J.: The Spin Model Checker. Addison-Wesley, Boston (2004)
17. McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)
18. Gurevich, Y.: Can abstract state machines be useful in language theory? Theoretical Computer Science 376, 17-29 (2007)
19. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)
20. Hoare, C.A.R.: Communicating sequential processes. Communications of the ACM 21, 666-677 (1978)