use a bibtex file to collect all references in Doxygen

* doc/tl/tl.bib: Move ...
* doc/spot.bib: ... here, and augment it with all references that
appeared verbatim in Doxygen comments.
* doc/Makefile.am, doc/tl/Makefile.am
doc/tl/tl.tex: Adjust for the move.
* doc/Doxyfile.in: Point to spot.bib.
* spot/gen/automata.hh, spot/gen/formulas.hh, spot/misc/game.hh,
spot/misc/minato.hh spot/taalgos/emptinessta.hh,
spot/taalgos/minimize.hh, spot/taalgos/tgba2ta.hh, spot/tl/formula.hh,
spot/tl/remove_x.hh, spot/tl/simplify.hh, spot/tl/snf.hh,
spot/twaalgos/cobuchi.hh, spot/twaalgos/cycles.hh,
spot/twaalgos/dualize.hh, spot/twaalgos/gtec/gtec.hh,
spot/twaalgos/gv04.hh, spot/twaalgos/ltl2taa.hh,
spot/twaalgos/ltl2tgba_fm.hh, spot/twaalgos/magic.hh,
spot/twaalgos/minimize.hh, spot/twaalgos/parity.hh,
spot/twaalgos/powerset.hh, spot/twaalgos/randomgraph.hh,
spot/twaalgos/se05.hh, spot/twaalgos/simulation.hh,
spot/twaalgos/strength.hh, spot/twaalgos/stutter.hh,
spot/twaalgos/tau03.hh, spot/twaalgos/totgba.hh,
spot/twaalgos/toweak.hh: Use \cite instead of a verbatim bibtex entry.
This commit is contained in:
Alexandre Duret-Lutz 2019-06-14 15:53:52 +02:00
parent d064b7dad2
commit df326e032b
36 changed files with 966 additions and 1225 deletions

View file

@ -1,5 +1,5 @@
## -*- coding: utf-8 -*-
## Copyright (C) 2011, 2012, 2013, 2015 Laboratoire de Recherche et
## Copyright (C) 2011, 2012, 2013, 2015, 2019 Laboratoire de Recherche et
## Développement de l'Epita (LRDE).
##
## This file is part of Spot, a model checking library.
@ -24,12 +24,12 @@ all: $(srcdir)/tl.pdf
# recent version of latexmk; but version 4.13a, installed on some
# of our hosts, does not support it. Add -pvc- because some people
# turn pvc on in their config file.
LATEXMK = BIBINPUTS='$(srcdir)' latexmk -pdf -ps- -dvi- -pvc- \
LATEXMK = BIBINPUTS='$(srcdir)/..' latexmk -pdf -ps- -dvi- -pvc- \
-e '$$bibtex_use=2' \
-e '$$pdflatex="pdflatex %O \"\\def\\SpotVersion{$(VERSION)}\\input{%S}\""'
dist_pdf_DATA = $(srcdir)/tl.pdf
EXTRA_DIST = tl.tex tl.bib spotltl.sty
EXTRA_DIST = tl.tex spotltl.sty
# latexmk produces its output in the current directory, and may not
# update its timestamp when no rebuild was necessary. This can cause
@ -38,7 +38,7 @@ EXTRA_DIST = tl.tex tl.bib spotltl.sty
# people that do not change the documentation). Hence the "touch"
# below. In case of a VPATH build, we always copy the file, so the
# timestamp is updated anyway.
$(srcdir)/tl.pdf: $(srcdir)/tl.tex $(srcdir)/tl.bib
$(srcdir)/tl.pdf: $(srcdir)/tl.tex $(srcdir)/../spot.bib
$(LATEXMK) $(srcdir)/tl.tex
if test '$(srcdir)' = '.'; then touch $@; else cp tl.pdf $@; fi

View file

@ -1,241 +0,0 @@
@InProceedings{ babiak.12.tacas,
author = {Tom{\'a}{\v{s}} Babiak and Mojm{\'i}r
K{\v{r}}et{\'i}nsk{\'y} and Vojt{\v{e}}ch {\v{R}}eh{\'a}k
and Jan Strej{\v c}ek},
title = {{LTL} to {B\"u}chi Automata Translation: Fast and More
Deterministic},
year = 2012,
booktitle = {Proceedings of the 18th International Conference on Tools
and Algorithms for the Construction and Analysis of Systems
(TACAS'12)},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {7214},
pages = {95--109}
}
@InProceedings{ beer.01.cav,
author = {Ilan Beer and Shoham Ben-David and Cindy Eisner and Dana
Fisman and Anna Gringauze and Yoav Rodeh},
title = {The Temporal Logic {S}ugar},
booktitle = {Proceedings of the 13th international conferance on
Computer Aided Verification (CAV'01)},
series = {Lecture Notes in Computer Science},
editor = {Berry, G{\'e}rard and Comon, Hubert and Finkel, Alain},
publisher = {Springer},
isbn = {978-3-540-42345-4},
pages = {363--367},
volume = {2102},
year = {2001},
month = jul
}
@Article{ bruggeman.96.tcs,
author = {Anne Br{\"u}ggemann-Klein},
title = {Regular Expressions into Finite Automata},
journal = {Theoretical Computer Science},
year = {1996},
volume = {120},
pages = {87--98}
}
@InProceedings{ cerna.03.mfcs,
author = {Ivana {\v{C}}ern{\'a} and Radek Pel{\'a}nek},
title = {Relating Hierarchy of Temporal Properties to Model
Checking},
booktitle = {Proceedings of the 28th International Symposium on
Mathematical Foundations of Computer Science (MFCS'03)},
pages = {318--327},
year = {2003},
editor = {Branislav Rovan and Peter Vojt{\'a}{\v{a}}},
volume = {2747},
series = {Lecture Notes in Computer Science},
address = {Bratislava, Slovak Republic},
month = aug,
publisher = {Springer-Verlag}
}
@InProceedings{ chang.92.icalp,
author = {Edward Y. Chang and Zohar Manna and Amir Pnueli},
title = {Characterization of Temporal Property Classes},
booktitle = {Proceedings of the 19th International Colloquium on
Automata, Languages and Programming (ICALP'92)},
year = {1992},
pages = {474--486},
publisher = {Springer-Verlag},
address = {London, UK}
}
@Article{ cimatti.08.tcad,
author = {Alessandro Cimatti and Marco Roveri and Stefano Tonetta},
journal = {IEEE Transactions on Computer Aided Design of Integrated
Circuits and Systems},
number = 10,
pages = {1737--1750},
title = {Symbolic Compilation of {PSL}},
volume = 27,
year = 2008,
date = {2009-03-20},
note = {\url{https://es.fbk.eu/people/tonetta/tests/tcad07/}}
}
@InProceedings{ dax.09.atva,
author = {Christian Dax and Felix Klaedtke and Stefan Leue},
title = {Specification Languages for Stutter-Invariant Regular
Properties},
booktitle = {Proceedings of the 7th International Symposium on
Automated Technology for Verification and Analysis
(ATVA'09)},
pages = {244--254},
year = {2009},
volume = {5799},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag}
}
@InProceedings{ duret.11.vecos,
author = {Alexandre Duret-Lutz},
title = {{LTL} Translation Improvements in {Spot}},
booktitle = {Proceedings of the 5th International Workshop on
Verification and Evaluation of Computer and Communication
Systems (VECoS'11)},
year = {2011},
series = {Electronic Workshops in Computing},
address = {Tunis, Tunisia},
month = sep,
publisher = {British Computer Society},
abstract = {Spot is a library of model-checking algorithms. This paper
focuses on the module translating LTL formul{\ae} into
automata. We discuss improvements that have been
implemented in the last four years, we show how Spot's
translation competes on various benchmarks, and we give
some insight into its implementation.},
url = {http://ewic.bcs.org/category/15853}
}
@Book{ eisner.06.psl,
author = {Cindy Eisner and Dana Fisman},
title = {A Practical Introduction to {PSL}},
publisher = {Springer},
year = {2006},
series = {Series on Integrated Circuits and Systems}
}
@InCollection{ eisner.08.hvc,
author = {Cindy Eisner and Dana Fisman},
title = {Structural Contradictions},
booktitle = {Proceedings of the 4th International Haifa Verification
Conference (HVC'2008)},
series = {Lecture Notes in Computer Science},
editor = {Hana Chockler and Alan Hu},
publisher = {Springer},
isbn = {978-3-642-01701-8},
pages = {164--178},
volume = {5394},
year = {2009},
month = oct
}
@InProceedings{ etessami.00.concur,
author = {Kousha Etessami and Gerard J. Holzmann},
title = {Optimizing {B\"u}chi Automata},
booktitle = {Proceedings of the 11th International Conference on
Concurrency Theory (Concur'00)},
pages = {153--167},
year = {2000},
editor = {C. Palamidessi},
volume = {1877},
series = {Lecture Notes in Computer Science},
address = {Pennsylvania, USA},
publisher = {Springer-Verlag},
note = {Beware of a typo in the version from the proceedings: $f
\U g$ is purely eventual if both operands are purely
eventual. The revision of the paper available at
\url{http://www.bell-labs.com/project/TMP/} is fixed. We
fixed the bug in Spot in 2005, thanks to LBTT. See also
\url{http://arxiv.org/abs/1011.4214v2} for a discussion
about this problem.}
}
@InProceedings{ jacobs.16.synt,
author = {Swen Jacobs and Felix Klein and Sebastian Schirmer},
title = {A High-Level {LTL} Synthesis Format: {TLSF} v1.1},
booktitle = {Proceedings Fifth Workshop on Synthesis (SYNT@CAV'16)},
pages = {112--132},
year = {2016},
series = {Electronic Proceedings in Theoretical Computer Science},
volume = {229},
doi = {10.4204/EPTCS.229.10}
}
@InProceedings{ manna.87.podc,
author = {Zohar Manna and Amir Pnueli},
title = {A hierarchy of temporal properties},
booktitle = {Proceedings of the sixth annual ACM Symposium on
Principles of distributed computing (PODC'90)},
year = {1990},
location = {Quebec City, Canada},
pages = {377--410},
publisher = {ACM},
address = {New York, NY, USA}
}
@Book{ psl.04.lrm,
title = {Property Specification Language Reference Manual v1.1},
publisher = {Accellera},
year = {2004},
month = jun,
note = {\url{http://www.eda.org/vfv/}}
}
@InProceedings{ schneider.01.lpar,
author = {Klaus Schneider},
title = {Improving Automata Generation for Linear Temporal Logic by
Considering the Automaton Hierarchy},
booktitle = {Proceedings of the 8th International Conference on Logic
for Programming, Artificial Intelligence and Reasoning},
pages = {39--54},
year = {2001},
volume = {2250},
series = {Lecture Notes in Artificial Intelligence},
address = {Havana, Cuba},
publisher = {Springer-Verlag}
}
@InProceedings{ somenzi.00.cav,
author = {Fabio Somenzi and Roderick Bloem},
title = {Efficient {B\"u}chi Automata for {LTL} Formul{\ae}},
booktitle = {Proceedings of the 12th International Conference on
Computer Aided Verification (CAV'00)},
pages = {247--263},
year = {2000},
volume = {1855},
series = {Lecture Notes in Computer Science},
address = {Chicago, Illinois, USA},
publisher = {Springer-Verlag}
}
@Book{ systemverilog.04.lrm,
title = {SystemVerilog 3.1a Language Reference Manual:
Accelleras Extensions to Ver- ilog},
publisher = {Accellera},
year = {2004},
month = may,
note = {\url{http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.366.6206}}
}
@TechReport{ tauriainen.03.a83,
author = {Heikki Tauriainen},
title = {On Translating Linear Temporal Logic into Alternating and
Nondeterministic Automata},
institution = {Helsinki University of Technology, Laboratory for
Theoretical Computer Science},
address = {Espoo, Finland},
month = dec,
number = {A83},
pages = {132},
type = {Research Report},
year = {2003},
note = {Reprint of Licentiate's thesis}
}

View file

@ -722,7 +722,7 @@ operands are Boolean formulas.
to define a subset of PSL that expresses exactly the
stutter-invariant $\omega$-regular languages.
\item The $\FIRSTMATCH$ operator does not exist in PSL. It comes
from SystemVerilog Assertions (SVA)~\cite{systemverilog.04.lrm}.
from SystemVerilog Assertions (SVA)~\cite{systemverilog.18.std}.
One intuition behind $\FIRSTMATCH\code(f\code)$ is that the
DFA for $\FIRSTMATCH\code(f\code)$ can be obtained from the DFA
for $f$ by removing all transitions leaving accepting states.
@ -1805,7 +1805,7 @@ implication can be done in two ways:
we implement are described in Appendix~\ref{ann:syntimpl}.
\item[Language Containment Checks] were initially proposed
by~\citet{tauriainen.03.a83}. This detection is enabled by the
by~\citet{tauriainen.03.tr}. This detection is enabled by the
``\verb|tl_simplifier_options::containment_checks|'' option.
\end{description}
@ -1888,7 +1888,7 @@ are counted as one.
\endgroup
Many of the above rules were collected from the
literature~\cite{somenzi.00.cav,tauriainen.03.a83,babiak.12.tacas} and
literature~\cite{somenzi.00.cav,tauriainen.03.tr,babiak.12.tacas} and
sometimes generalized to support operators such as $\M$ and $\W$.
\appendix
@ -2043,7 +2043,7 @@ $f_1\AND f_2$ & \bor{f_1}{g}{f_2}{g} & & &
\phantomsection % fix hyperlinks
\addcontentsline{toc}{chapter}{\bibname}
\bibliographystyle{plainnat}
\bibliography{tl}
\bibliography{spot}
\end{document}
%%% Local Variables: