Difference between revisions of "Publications/regisgianas.03.poosc"

From LRDE

Line 6: Line 6:
 
| booktitle = Proceedings of the Parallel/High-performance Object-Oriented Scientific Computing (POOSC; in conjunction with ECOOP)
 
| booktitle = Proceedings of the Parallel/High-performance Object-Oriented Scientific Computing (POOSC; in conjunction with ECOOP)
 
| number = FZJ-ZAM-IB-2003-09
 
| number = FZJ-ZAM-IB-2003-09
| pages = 71 to 82
+
| pages = 71–82
 
| editors = Jörg Striegnitz, Kei Davis
 
| editors = Jörg Striegnitz, Kei Davis
 
| series = John von Neumann Institute for Computing (NIC)
 
| series = John von Neumann Institute for Computing (NIC)

Revision as of 17:52, 4 January 2018

Abstract

Vaucanson is a C++ generic library for weighted finite state machine manipulation. For the sake of generality, FSM are defined using algebraic structures such as alphabet (for the letters), free monoid (for the words), semiring (for the weights) and series (mapping from words to weights). As usual, what is at stake is to maintain efficiency while providing a high-level layer for the writing of generic algorithms. Yet, one of the particularities of FSM manipulation is the need of a fine grained specialization power on an object which is both an algebraic concept and an intensive computing machine.

Documents

Bibtex (lrde.bib)

@InProceedings{	  regisgianas.03.poosc,
  author	= {Yann R\'egis-Gianas and Rapha\"el Poss},
  title		= {On orthogonal specialization in {C++}: dealing with
		  efficiency and algebraic abstraction in {V}aucanson},
  booktitle	= {Proceedings of the Parallel/High-performance
		  Object-Oriented Scientific Computing (POOSC; in conjunction
		  with ECOOP)},
  year		= 2003,
  number	= {FZJ-ZAM-IB-2003-09},
  pages		= {71--82},
  editor	= {J\"org Striegnitz and Kei Davis},
  series	= {John von Neumann Institute for Computing (NIC)},
  address	= {Darmstadt, Germany},
  month		= jul,
  abstract	= {Vaucanson is a C++ generic library for weighted finite
		  state machine manipulation. For the sake of generality, FSM
		  are defined using algebraic structures such as alphabet
		  (for the letters), free monoid (for the words), semiring
		  (for the weights) and series (mapping from words to
		  weights). As usual, what is at stake is to maintain
		  efficiency while providing a high-level layer for the
		  writing of generic algorithms. Yet, one of the
		  particularities of FSM manipulation is the need of a fine
		  grained specialization power on an object which is both an
		  algebraic concept and an intensive computing machine.}
}