- Reachability analysis of communicating pushdown systems Alexander Heußner Jérôme Leroux Anca Muscholl Grégoire Sutre Thu 03 May 2012
- Regular sets of infinite message sequence charts Dietrich Kuske Thu 03 May 2012
- A theory of regular MSC languages Jesper G. Henriksen Madhavan Mukund K. Narayan Kumar Milind Sohoni P. S. Thiagarajan Thu 03 May 2012
- Staying Alive as Cheaply as Possible Patricia Bouyer Ed Brinksma Kim Larsen Wed 02 May 2012
- The synchronous languages 12 years later Albert Benveniste Paul Caspi Stephen A. Edwards Nicolas Halbwachs Paul Le Guernic Robert de Simone Wed 02 May 2012
- As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata Kim Guldstrand Larsen Gerd Behrmann Ed Brinksma Ansgar Fehnker Thomas Hune Paul Pettersson Judi Romijn Wed 02 May 2012
- Minimal Cost Reachability/Coverability in Priced Timed Petri Nets Parosh Aziz Abdulla Richard Mayr Wed 02 May 2012
- Propositions as Sessions Philip Wadler Wed 02 May 2012
- Efficient emptiness check for timed Buchi automata Frédéric Herbreteau B. Srivathsan Igor Walukiewicz Tue 01 May 2012
- Robert W Floyd, In Memoriam Donald E. Knuth Tue 01 May 2012
- Minimizing Variants of Visibly Pushdown Automata Patrick Chervet Igor Walukiewicz Mon 30 April 2012
- On infinite transition graphs having a decidable monadic theory Didier Caucal Fri 27 April 2012
- An automata-theoretic characterization of the OI-hierarchy Werner Damm Andreas Goerdt Fri 27 April 2012
- Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects Bruno Courcelle Fri 27 April 2012
- Second-Order Simple Grammars Colin Stirling Fri 27 April 2012
- On Infinite Terms Having a Decidable Monadic Theory Didier Caucal Fri 27 April 2012
- Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games Thierry Cachat Fri 27 April 2012
- The monadic second-order logic of graphs IX: Machines and their behaviours Bruno Courcelle Fri 27 April 2012
- The categorical abstract machine G. Cousineau P.-L. Curien M. Mauny Thu 26 April 2012
- An introduction to decidability of higher-order matching Colin Stirling Thu 26 April 2012
Library Size: 13G (12972 entries),
Last Updated: Apr 16, 2026, 22:09:35,
Build Time: N/A
