OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems Sang-Min Choia , Jiho Parka , Quan Nguyena , Kiyoung Jangb , Hyunjoon Cheonb , Yo-Sub Hanb , Byung-Ik Ahna a

First Page		Document Content
Date: 2018-10-24 09:53:18 Cryptocurrencies Computing Concurrent computing Fault-tolerant computer systems Distributed computing Distributed algorithms Theory of computation Cryptography Byzantine fault tolerance Blockchain Consensus Proof-of-stake		OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems Sang-Min Choia , Jiho Parka , Quan Nguyena , Kiyoung Jangb , Hyunjoon Cheonb , Yo-Sub Hanb , Byung-Ik Ahna a Add to Reading List Source URL: fantom.foundation Download Document from Source Website File Size: 854,72 KB Share Document on Facebook

	Under consideration for publication in Formal Aspects of Computing Maximally Concurrent Programs 1 DocID: 1xUtw - View Document
	Automated Verification of Concurrent Stochastic Games Marta Kwiatkowska1 , Gethin Norman2 , David Parker3 , and Gabriel Santos1 1 Department of Computing Science, University of Oxford, UK DocID: 1xTlL - View Document
	Fully Concurrent Garbage Collection of Actors on Many-Core Machines Sylvan Clebsch and Sophia Drossopoulou Department of Computing, Imperial College, London {sc5511, scd}@doc.ic.ac.uk DocID: 1tNeJ - View Document
	BritishLanthorn: Ubiquitous Homogeneous Cooperative Symmetries Ike Antkare International Institute of Technology United Slates of Earth DocID: 1ru6U - View Document
	Practical Optional Types for Clojure Ambrose Bonnaire-Sergeant† , Rowan Davies, Sam Tobin-Hochstadt† Indiana University†; Omnia Team, Commonwealth Bank of Australia {abonnair,samth}@indiana.edu, Rowan.Davies@cba. DocID: 1ru0R - View Document