Fix verbatim blocks of Doxygen comments.
* src/ltlast/formula.hh, src/ltlvisit/contain.hh, src/ltlvisit/randomltl.hh, src/ltlvisit/reduce.hh, src/ltlvisit/remove_x.hh, src/ltlvisit/simplify.hh, src/ltlvisit/snf.hh, src/misc/minato.hh, src/misc/optionmap.hh, src/saba/sabacomplementtgba.hh, src/taalgos/emptinessta.hh, src/taalgos/minimize.hh, src/taalgos/tgba2ta.hh, src/tgba/tgbakvcomplement.hh, src/tgbaalgos/cycles.hh, src/tgbaalgos/eltl2tgba_lacim.hh, src/tgbaalgos/gtec/gtec.hh, src/tgbaalgos/gv04.hh, src/tgbaalgos/ltl2taa.hh, src/tgbaalgos/ltl2tgba_fm.hh, src/tgbaalgos/ltl2tgba_lacim.hh, src/tgbaalgos/magic.hh, src/tgbaalgos/minimize.hh, src/tgbaalgos/randomgraph.hh, src/tgbaalgos/se05.hh, src/tgbaalgos/simulation.hh, src/tgbaalgos/tau03.hh, src/tgbaalgos/tau03opt.hh: Surround verbatim blocks with /** ... */ instead of using /// on each line. Otherwise Doxygen will output the leading "///" tokens -- apparently this is a feature. * src/sanity/style.test: Strip multi-line comments before checking code style.
This commit is contained in:
parent
1ec9cebe58
commit
1cd9b204ed
29 changed files with 758 additions and 745 deletions
|
|
@ -33,23 +33,23 @@ namespace spot
|
|||
/// \brief Build a spot::tgba_explicit* from an LTL formula.
|
||||
///
|
||||
/// This is based on the following paper.
|
||||
/// \verbatim
|
||||
/// @InProceedings{couvreur.99.fm,
|
||||
/// author = {Jean-Michel Couvreur},
|
||||
/// title = {On-the-fly Verification of Temporal Logic},
|
||||
/// pages = {253--271},
|
||||
/// editor = {Jeannette M. Wing and Jim Woodcock and Jim Davies},
|
||||
/// booktitle = {Proceedings of the World Congress on Formal Methods in the
|
||||
/// Development of Computing Systems (FM'99)},
|
||||
/// publisher = {Springer-Verlag},
|
||||
/// series = {Lecture Notes in Computer Science},
|
||||
/// volume = {1708},
|
||||
/// year = {1999},
|
||||
/// address = {Toulouse, France},
|
||||
/// month = {September},
|
||||
/// isbn = {3-540-66587-0}
|
||||
/// }
|
||||
/// \endverbatim
|
||||
/** \verbatim
|
||||
@InProceedings{couvreur.99.fm,
|
||||
author = {Jean-Michel Couvreur},
|
||||
title = {On-the-fly Verification of Temporal Logic},
|
||||
pages = {253--271},
|
||||
editor = {Jeannette M. Wing and Jim Woodcock and Jim Davies},
|
||||
booktitle = {Proceedings of the World Congress on Formal Methods in the
|
||||
Development of Computing Systems (FM'99)},
|
||||
publisher = {Springer-Verlag},
|
||||
series = {Lecture Notes in Computer Science},
|
||||
volume = {1708},
|
||||
year = {1999},
|
||||
address = {Toulouse, France},
|
||||
month = {September},
|
||||
isbn = {3-540-66587-0}
|
||||
}
|
||||
\endverbatim */
|
||||
///
|
||||
/// \param f The formula to translate into an automaton.
|
||||
///
|
||||
|
|
@ -70,23 +70,23 @@ namespace spot
|
|||
/// from the same state with the same label (i.e., condition + acceptance
|
||||
/// conditions) will be merged. This correspond to an optimization
|
||||
/// described in the following paper.
|
||||
/// \verbatim
|
||||
/// @InProceedings{ sebastiani.03.charme,
|
||||
/// author = {Roberto Sebastiani and Stefano Tonetta},
|
||||
/// title = {"More Deterministic" vs. "Smaller" B{\"u}chi Automata for
|
||||
/// Efficient LTL Model Checking},
|
||||
/// booktitle = {Proceedings for the 12th Advanced Research Working
|
||||
/// Conference on Correct Hardware Design and Verification
|
||||
/// Methods (CHARME'03)},
|
||||
/// pages = {126--140},
|
||||
/// year = {2003},
|
||||
/// editor = {G. Goos and J. Hartmanis and J. van Leeuwen},
|
||||
/// volume = {2860},
|
||||
/// series = {Lectures Notes in Computer Science},
|
||||
/// month = {October},
|
||||
/// publisher = {Springer-Verlag}
|
||||
/// }
|
||||
/// \endverbatim
|
||||
/** \verbatim
|
||||
@InProceedings{ sebastiani.03.charme,
|
||||
author = {Roberto Sebastiani and Stefano Tonetta},
|
||||
title = {"More Deterministic" vs. "Smaller" B{\"u}chi Automata for
|
||||
Efficient LTL Model Checking},
|
||||
booktitle = {Proceedings for the 12th Advanced Research Working
|
||||
Conference on Correct Hardware Design and Verification
|
||||
Methods (CHARME'03)},
|
||||
pages = {126--140},
|
||||
year = {2003},
|
||||
editor = {G. Goos and J. Hartmanis and J. van Leeuwen},
|
||||
volume = {2860},
|
||||
series = {Lectures Notes in Computer Science},
|
||||
month = {October},
|
||||
publisher = {Springer-Verlag}
|
||||
}
|
||||
\endverbatim */
|
||||
///
|
||||
/// \param fair_loop_approx When set, a really simple characterization of
|
||||
/// unstable state is used to suppress all acceptance conditions from
|
||||
|
|
@ -103,22 +103,22 @@ namespace spot
|
|||
/// for the type of reduction you want, see
|
||||
/// spot::ltl::ltl_simplifier. This idea is taken from the
|
||||
/// following paper.
|
||||
/// \verbatim
|
||||
/// @InProceedings{ thirioux.02.fmics,
|
||||
/// author = {Xavier Thirioux},
|
||||
/// title = {Simple and Efficient Translation from {LTL} Formulas to
|
||||
/// {B\"u}chi Automata},
|
||||
/// booktitle = {Proceedings of the 7th International ERCIM Workshop in
|
||||
/// Formal Methods for Industrial Critical Systems (FMICS'02)},
|
||||
/// series = {Electronic Notes in Theoretical Computer Science},
|
||||
/// volume = {66(2)},
|
||||
/// publisher = {Elsevier},
|
||||
/// editor = {Rance Cleaveland and Hubert Garavel},
|
||||
/// year = {2002},
|
||||
/// month = jul,
|
||||
/// address = {M{\'a}laga, Spain}
|
||||
/// }
|
||||
/// \endverbatim
|
||||
/** \verbatim
|
||||
@InProceedings{ thirioux.02.fmics,
|
||||
author = {Xavier Thirioux},
|
||||
title = {Simple and Efficient Translation from {LTL} Formulas to
|
||||
{B\"u}chi Automata},
|
||||
booktitle = {Proceedings of the 7th International ERCIM Workshop in
|
||||
Formal Methods for Industrial Critical Systems (FMICS'02)},
|
||||
series = {Electronic Notes in Theoretical Computer Science},
|
||||
volume = {66(2)},
|
||||
publisher = {Elsevier},
|
||||
editor = {Rance Cleaveland and Hubert Garavel},
|
||||
year = {2002},
|
||||
month = jul,
|
||||
address = {M{\'a}laga, Spain}
|
||||
}
|
||||
\endverbatim */
|
||||
///
|
||||
/// \return A spot::tgba_explicit that recognizes the language of \a f.
|
||||
tgba_explicit_formula*
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue