BibTeX Export for Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk)

Copy to Clipboard Download

@InProceedings{schnoebelen:LIPIcs.MFCS.2017.85,
  author =	{Schnoebelen, Philippe},
  title =	{{Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems}},
  booktitle =	{42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
  pages =	{85:1--85:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-046-0},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{83},
  editor =	{Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.85},
  URN =		{urn:nbn:de:0030-drops-81393},
  doi =		{10.4230/LIPIcs.MFCS.2017.85},
  annote =	{Keywords: Well-structured systems and verification, Order theory}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode