Tsvetomir P. Petrov, Anna Pogosyants, Stephen J. Garland, Victor Luchangco, Nancy A. Lynch  Home/Search
Context Related
| mit.edu:8001/~garland/publ...forte96.ps mit.edu:8001/~garland/publ...forte96.ps mit.edu/~garland/publicati...forte96.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/spd/pub/ (more) From: mit.edu:8001/~garland/pub...index (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A formal representation and machine-checked proof are given for the Bounded Concurrent Timestamp (BCTS) algorithm of Dolev and Shavit. The proof uses invariant assertions and a forward simulation mapping to a corresponding Unbounded Concurrent Timestamp (UCTS) algorithm, following a strategy developed by Gawlick, Lynch, and Shavit. The proof was produced interactively, using the Larch Prover. Keywords Verification, validation and testing; tools and tool support; Larch; input/output automata;... (Update)
Context of citations to this paper: More
.... [34] For example, we have proved the correctness of the Dolev Shavit Bounded Concurrent Timestamp protocol [7] using the Larch Prover (LP) [32]. Of course, many other researchers have also used theorem provers to prove invariants and simulation relations, using other state...
.... using the Larch Prover (LP) 38] A number of case studies have been performed, involving timing based systems as well (e.g. [25, 37]) Current work [14] aims at a formal language for I O automata which allows to develop tools like static type checkers, simulators and code...
Cited by: More
A Simple, Memory-Efficient Bounded Concurrent.. - Shikaripura, Kshemkalyani (Correct)
A Verification Environment for I/O Automata - Müller (1998) (Correct)
A Verification Environment for I/O Automata - Part II: Theorem.. - Müller (1999) (Correct)
Active bibliography (related documents): More All
0.2: Verifiable Code Generation from Abstract I/O Automata Models for.. - Tauber (2001) (Correct)
0.2: Concurrent Timestamping Made Simple - Gawlick (1992) (Correct)
0.1: Bounded Concurrent Time-Stamping - Dolev, Shavit (1997) (Correct)
Similar documents based on text: More All
0.5: Code Compaction and Parallelization for VLIW/DSP Chip.. - Tsvetomir Petrov.. (Correct)
0.3: Classified Larch Bibliography - Garland (1996) (Correct)
0.2: Correctness of Vehicle Control Systems: A Case Study - Weinberg (1996) (Correct)
Related documents from co-citation: More All
3: Temporal Verification of Reactive Systems : Safety (context) - Manna, Pnueli - 1995
3: Forward and backward simulations -- Part II: Timing-based systems - Lynch, Vaandrager
3: Distributed Algorithms (context) - Lynch - 1996
BibTeX entry: (Update)
Tsvetomir P. Petrov, Anna Pogosyants, Stephen J. Garland, Victor Luchangco, and Nancy A. Lynch. Computer-assisted verification of an algorithm for concurrent timestamps. Formal Description Techniques IX: Theory, Applications, and Tools (FORTE/PSTV'96), pages 29--44, Chapman & Hall, 1996. http://citeseer.ist.psu.edu/petrov96computerassisted.html More
@inproceedings{ tsvetomir96computerassisted,
author = "Petrov, Tsvetomir~P. and Pogosyants, A. and and Garland, Stephen~J. and Luchangco, Victor and Lynch, Nancy~A.",
title = "Computer-assisted verification of an algorithm for concurrent timestamps",
booktitle = "Formal Description Techniques {XI}: Theory, Application, and Tools",
month = "October 8--11",
publisher = "Chapman and Hall",
address = "Kaiserslautern, Germany",
editor = "Gotzhein, Reinhard and Bredereke, Jan",
pages = "29--44",
year = "1996",
url = "citeseer.ist.psu.edu/petrov96computerassisted.html" }
Citations (may not include all citations):718 Distributed Algorithms (context) - Lynch - 1996
334 A Computational Logic Handbook (context) - Boyer, Moore - 1988
293 Hierarchical correctness proofs for distributed algorithms - Lynch, Tuttle - 1987
107 A new solution of Dijkstra's concurrent programming problem (context) - Lamport - 1974
99 Atomic snapshots of shared memory - Afek, Attiya et al. - 1993
75 On interprocess communication - Lamport - 1986
23 A guide to LP (context) - Garland, Guttag - 1991
23 Concurrent timestamping made simple - Gawlick - 1992
23 Concurrent timestamping made simple - Gawlick, Lynch et al. - 1992
18 Using simulation techniques to prove timing properties - Luchangco - 1994
17 Verifying timing properties of concurrent algorithms - Luchangco, Soylemez et al. - 1994
6 Computer-assisted simulation proofs - Sogaard-Andersen, Garland et al. - 1993
4 Bounded concurrent timestamps are constructible (context) - Dolev, Shavit - 1989
1 Larch: Languages and Tools for Formal Specification (context) - on, Practice et al. - 1993
1 Incorporating specialized theories in a general purpose theo.. (context) - Pogosyants - 1994
1 Bounded time stamps (context) - Israeli, Li - 1987
1 Concurrent timestamping (context) - Thesis, EECS - 1989
Documents on the same site (http://www.sds.lcs.mit.edu/spd/pub/): More
A Guide to LP, The Larch Prover - Garland, Guttag (1991) (Correct)
A Parallel Completion Procedure for Term Rewriting Systems - Yelick, Garland (1992) (Correct)
Static Detection of Dynamic Memory Errors - Evans (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC