10 citations
3 papers
cs.FL2009★ 10 cited
Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability
Christel Baier, Nathalie Bertrand, Marcus Größer
Probabilistic omega-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite i…
cs.PL2008
Coinductive big-step operational semantics
Xavier Leroy, Hervé Grall
Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to de…
cs.PL2007
A Language-Based Approach for Improving the Robustness of Network Application Protocol Implementations
Burgy Laurent, Laurent Réveillère, Julia Lawall +1
The secure and robust functioning of a network relies on the defect-free implementation of network applications. As network protocols have become increasingly complex, however, han…