BibTeX record conf/caap/WidomP88

download as .bib file

@inproceedings{DBLP:conf/caap/WidomP88,
  author       = {Jennifer Widom and
                  Prakash Panangaden},
  editor       = {Max Dauchet and
                  Maurice Nivat},
  title        = {Expressiveness Bounds for Completness in Trace-Based Network Proof
                  Systems},
  booktitle    = {{CAAP} '88, 13th Colloquium on Trees in Algebra and Programming, Nancy,
                  France, March 21-24, 1988, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {299},
  pages        = {200--214},
  publisher    = {Springer},
  year         = {1988},
  url          = {https://doi.org/10.1007/BFb0026105},
  doi          = {10.1007/BFB0026105},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/caap/WidomP88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.