On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability (bibtex)
by Igor Konnov, Helmut Veith, Josef Widder
Reference:
On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: ReachabilityIgor Konnov, Helmut Veith, Josef WidderChapter in CONCUR 2014 --- Concurrency Theory (Paolo Baldan, Daniele Gorla, eds.), volume 8704 of Lecture Notes in Computer Science, pages 125-140, 2014.
Bibtex Entry:
@incollection{KVW14,
author={Konnov, Igor and Veith, Helmut and Widder, Josef},
title={On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability},
year={2014},
isbn={978-3-662-44583-9},
booktitle={CONCUR 2014 --- Concurrency Theory},
volume={8704},
series={Lecture Notes in Computer Science},
editor={Baldan, Paolo and Gorla, Daniele},
pages={125-140},
ee={http://dx.doi.org/10.1007/978-3-662-44584-6_10},
url={http://forsyte.at/wp-content/uploads/concur14-reachability.pdf},
}
Powered by bibtexbrowser