| Specifying and verifying systems with TLA+ |
| Full text |
Pdf
(289 KB)
|
| Source
|
ACM SIGOPS European Workshop
archive
Proceedings of the 10th workshop on ACM SIGOPS European workshop
table of contents
Saint-Emilion, France
Pages: 45 - 48
Year of Publication: 2002
|
|
Authors
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 23, Citation Count: 0
|
|
|
ABSTRACT
TLA+ is a high-level specification language that has been used to specify and check the correctness of several hardware protocols. We expect that it can also be used to specify and check concurrent algorithms and protocols for software systems.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Alpha Architecture Committee. Alpha Architecture Reference Manual. Digital Press, Boston, third edition, 1998.
|
| |
2
|
E. Gafni and L. Lamport. Disk paxos. Technical Report 163, Compaq Systems Research Center, July 2000. To appear in Distributed Computing. Currently available on the web at http://gatekeeper.dec.com/pub/DEC/SRC/research-reports/abstracts/src-rr% -163. html.
|
 |
3
|
Kourosh Gharachorloo , Madhu Sharma , Simon Steely , Stephen Van Doren, Architecture and design of AlphaServer GS320, Proceedings of the ninth international conference on Architectural support for programming languages and operating systems, p.13-24, November 2000, Cambridge, Massachusetts, United States
|
| |
4
|
L. Lamport. TLA---temporal logic of actions. A web page, a link to which can be found at URL http://lamport.org. The page can also be found by searching the Web for the 21-letter string formed by concatenating uid and lamporttlahomepage.
|
 |
5
|
|
| |
6
|
L. Lamport. How to write a proof. American Mathematical Monthly, 102(7):600--608, August-September 1995.
|
| |
7
|
L. Lamport. Specifying Systems. Addison-Wesley, Boston, 2002.
|
| |
8
|
L. Lamport, M. Sharma, M. Tuttle, and Y. Yu. The wildfire verification challenge problem. At URL http://www.research.compaq.com/SRC/tla/wildfire-challenge.html on the World Wide Web. It can also be found by searching the Web for the 24-letter string wild fire challenge problem.
|
| |
9
|
|
| |
10
|
S. Tasiran, Y. Yu, B. Batson, and S. Kreider. Using formal specifications to monitor and guide simulation: Verifying the cache coherence engine of the Alpha 21364 microprocessor. In In Proceedings of the 3rd IEEE Workshop on Microprocessor Test and Verification, Common Challenges and Solutions. IEEE Computer Society, 2002. To appear as an HP technical report.
|
| |
11
|
|
|