On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability (bibtex)
by Igor V. Konnov, Helmut Veith, Josef Widder
Reference:
On the completeness of bounded model checking for threshold-based distributed algorithms: ReachabilityIgor V. Konnov, Helmut Veith, Josef WidderInf. Comput., volume 252, pages 95-109, 2017.
Bibtex Entry:
@article{KVW16:IandC,
  author    = {Igor V. Konnov and
               Helmut Veith and
               Josef Widder},
  title     = {On the completeness of bounded model checking for threshold-based
               distributed algorithms: Reachability},
  journal   = {Inf. Comput.},
  volume    = {252},
  pages     = {95--109},
  year      = {2017},
  url       = {http://dx.doi.org/10.1016/j.ic.2016.03.006},
  doi       = {10.1016/j.ic.2016.03.006},
  timestamp = {Thu, 29 Dec 2016 15:24:23 +0100},
  biburl    = {http://dblp.dagstuhl.de/rec/bib/journals/iandc/KonnovVW17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
Powered by bibtexbrowser