L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16:872--923, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Timed Communicating Object Z - Brendan Mahony Information (Correct)
No context found.
L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16:872--923, 1994.
Transparent Fault-Tolerant Java Virtual Machine - Roy Friedman Alon (Correct)
No context found.
L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401, July 1982.
PGRIP: PNNI Global Routing Infrastructure Protection - Sabrina De Capitani (Correct)
No context found.
L. Lamport, R. Shostak, and M. Pease. The Byzantine General Problem. ACM Transaction on Programming Languages and Systems, 4(3):382, 1982.
Global Infrastructure Protection System - Sabrina De Capitani (Correct)
No context found.
L. Lamport, R. Shostak, and M. Pease. The Byzantine General Problem. ACM Transaction on Programming Languages and Systems, 4(3):382, 1982.
Fault-Scalable Byzantine Fault-Tolerant Services - Michael Abd-El-Malek Gregory (Correct)
No context found.
L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401. ACM, July 1982.
Ursa Minor: versatile cluster-based storage - Michael Abd-El-Malek William (Correct)
No context found.
L. Lamport, et al. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401. ACM, July 1982.
Lazy Verification in Fault-Tolerant Distributed Storage.. - Michael Abd-El-Malek.. (Correct)
No context found.
L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401. ACM, July 1982.
BIND: A Fine-grained Attestation Service for - Secure Distributed Systems (Correct)
No context found.
L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):382--401, July 1982.
Formal Verification of Time-Triggered Systems - Pike (2006) (Correct)
No context found.
Lamport, Shostak, and Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4:382--401, July 1982. Available at http://citeseer.nj. nec.com/lamport82byzantine.html.
Abstractions for Fault-Tolerant Distributed System.. - Pike, Maddalon, Miner.. (2004) (Correct)
No context found.
Lamport, Shostak, and Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4:382-- 401, July 1982.
Model Checking Failed Conjectures in Theorem Proving: A.. - Pike, Miner.. (2004) (Correct)
No context found.
Lamport; Shostak; and Pease: The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, vol. 4, July 1982, pp. 382--401. Available at http://citeseer.nj.nec.com/lamport82byzantine.html.
Defending the Sybil Attack in P2P Networks: Taxonomy, .. - Proposal For.. (Correct)
No context found.
L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401, 1982.
SIA: Secure Information Aggregation in Sensor Networks - Przydatek, Song, Perrig (2003) (23 citations) (Correct)
No context found.
L. Lamport, R. Shostak, and M. Pease. The byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):382--401, July 1982.
Ensuring Structure and Behavior Correctness in . . . - Dong (Correct)
No context found.
L. Lamport. The Temporal Logic of Actions. ACM Transactions on Programming Languages and Systems, 16(3):873-- 923, May 1994.
Distributed Computing in Practice: The Condor Experience - Thain, Tannenbaum, Livny (2004) (6 citations) (Correct)
No context found.
L. Lamport, R. Shostak, and M. Pease. The byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382--402, July 1982.
Lazy Verification in Fault-Tolerant Distributed Storage.. - Michael Abd-El-Malek.. (Correct)
No context found.
L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401. ACM, July 1982.
A Better Way to Design - Communication Protocols Friedger (Correct)
No context found.
L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872--923, May 1994.
Low Complexity Byzantine-Resilient Consensus - Correia, Neves, Lung.. (2003) (1 citation) (Correct)
No context found.
L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401, July 1982.
Ursa Minor: versatile cluster-based storage - Abd-El-Malek, II, Cranor.. (2005) (Correct)
No context found.
L. Lamport, et al. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401. ACM, July 1982.
A Protocol Family Approach to Survivable Storage Infrastructures - Jay Wylie Garth (2004) (Correct)
No context found.
L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401. ACM, July 1982.
Replication Predicates for Dependent-Failure Algorithms - Flavio Junqueira And (Correct)
No context found.
L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401, Jul 1982.
Separating Agreement from Execution for Byzantine.. - Yin, Martin.. (2003) (3 citations) (Correct)
No context found.
L. Lamport, R. Shostack, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401, 1982.
Fault-Scalable Byzantine Fault-Tolerant Services - Michael Abd-El-Malek Gregory (Correct)
No context found.
L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401. ACM, July 1982.
Dynamics of Learning Algorithms for the On-Demand.. - Awerbuch.. (2005) (Correct)
No context found.
Lamport, L., Shostak, R. and M. Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, Vol. 4, No. 3, July 1982.
Using SPIN and Eclipse for Optimized High-Level.. - Rothmaier, Kneiphoff.. (2005) (Correct)
No context found.
L. Lamport: The Temporal Logic of Actions, ACM Transactions on Programming Languages and Systems, vol. 16(3), pp. 872-923, 1994.
First 50 documents Next 50
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