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:
parent
d064b7dad2
commit
df326e032b
36 changed files with 966 additions and 1225 deletions
|
|
@ -1,6 +1,6 @@
|
|||
// -*- coding: utf-8 -*-
|
||||
// Copyright (C) 2013, 2014 Laboratoire de Recherche et Developpement
|
||||
// de l'Epita (LRDE).
|
||||
// Copyright (C) 2013, 2014, 2019 Laboratoire de Recherche et
|
||||
// Developpement de l'Epita (LRDE).
|
||||
// Copyright (C) 2004, 2005 Laboratoire d'Informatique de Paris 6 (LIP6),
|
||||
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
|
||||
// et Marie Curie.
|
||||
|
|
@ -79,19 +79,7 @@ namespace spot
|
|||
///
|
||||
/// This algorithm is an adaptation to TBA of the one
|
||||
/// (which deals with accepting states) presented in
|
||||
///
|
||||
/** \verbatim
|
||||
Article{ courcoubetis.92.fmsd,
|
||||
author = {Costas Courcoubetis and Moshe Y. Vardi and Pierre
|
||||
Wolper and Mihalis Yannakakis},
|
||||
title = {Memory-Efficient Algorithm for the Verification of
|
||||
Temporal Properties},
|
||||
journal = {Formal Methods in System Design},
|
||||
pages = {275--288},
|
||||
year = {1992},
|
||||
volume = {1}
|
||||
}
|
||||
\endverbatim */
|
||||
/// \cite courcoubetis.92.fmsd .
|
||||
///
|
||||
/// \bug The name is misleading. Magic-search is the algorithm
|
||||
/// from \c godefroid.93.pstv, not \c courcoubetis.92.fmsd.
|
||||
|
|
@ -106,16 +94,7 @@ namespace spot
|
|||
///
|
||||
/// During the visit of \a a, the returned checker does not store explicitely
|
||||
/// the traversed states but uses the bit-state hashing technic presented in:
|
||||
///
|
||||
/** \verbatim
|
||||
@book{Holzmann91,
|
||||
author = {G.J. Holzmann},
|
||||
title = {Design and Validation of Computer Protocols},
|
||||
publisher = {Prentice-Hall},
|
||||
address = {Englewood Cliffs, New Jersey},
|
||||
year = {1991}
|
||||
}
|
||||
\endverbatim */
|
||||
/// \cite Holzmann.91.book.
|
||||
///
|
||||
/// Consequently, the detection of an acceptence cycle is not ensured.
|
||||
///
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue