Algorithm-oriented generic libraries
Software—Practice & Experience
Object-oriented programming: a unified foundation
Object-oriented programming: a unified foundation
Cayenne—a language with dependent types
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Dependent types in practical programming
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Canonical derivatives, partial derivatives and finite automaton constructions
Theoretical Computer Science
Design Patterns: Abstraction and Reuse of Object-Oriented Design
ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
On the Construction of Reversible Automata for Reversible Languages
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Star Height of Reversible Languages and Universal Automata
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Design patterns for generic programming in C++
COOTS'01 Proceedings of the 6th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 6
Elements of Automata Theory
Experimenting with formal languages using forlan
Proceedings of the 2008 international workshop on Functional and declarative programming in education
Multiparadigm Programming in Object-Oriented Languages: Current Research
Object-Oriented Technology. ECOOP 2008 Workshop Reader
CLARIN and Free Open Source Finite-State Tools
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
OpenFst: a general and efficient weighted finite-state transducer library
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
A probabilistic model for guessing base forms of new words by analogy
CICLing'08 Proceedings of the 9th international conference on Computational linguistics and intelligent text processing
COMPAS: a computing package for synchronization
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Transitive closures of affine integer tuple relations and their overapproximations
SAS'11 Proceedings of the 18th international conference on Static analysis
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Equivalence checking of static affine programs using widening to handle recurrences
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
This paper reports on a new software platform called VAUCANSON and dedicated to the computation with automata and transducers. Its main feature is the capacity of dealing with automata whose labels may belong to various algebraic structures.The paper successively describes the main features of the VAUCANSON platform, including the fact that the very rich data structure used to implement automata does not weigh too much on the performance, shows how VAUCANSON allows to program algorithms on automata in a way which is very close to the mathematical expression of the algorithm and finally explains the main choices of the programming design that enable to achieve both genericity and efficiency.