- PSL Model Checking and Run-Time Verification Via Testers A. Pnueli A. Zaks Fri 02 March 2012
- Termination of Integer Linear Programs Mark Braverman Fri 02 March 2012
- Termination Analysis with Calling Context Graphs Panagiotis Manolios Daron Vroon Fri 02 March 2012
- Minimizing Generalized Büchi Automata Sudeep Juvekar Nir Piterman Fri 02 March 2012
- Faulty EPCs in the SAP Reference Model J. Mendling M. Moser G. Neumann H. M. W. Verbeek B. F. van Dongen W. M. P. van der Aalst Fri 02 March 2012
- A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes Nicolás Wolovick Sven Johr Fri 02 March 2012
- Algorithms for Omega-Regular Games with Imperfect Information Krishnendu Chatterjee Laurent Doyen Thomas A. Henzinger Jean-François Raskin Fri 02 March 2012
- Grey-Box Checking Edith Elkind Blaise Genest Doron Peled Hongyang Qu Fri 02 March 2012
- Treewidth: Characterizations, Applications, and Computations Hans L. Bodlaender Fri 02 March 2012
- An algebraic formulation of the Chomsky hierarchy Mitchell Wand Fri 02 March 2012
- A hierarchy of regular sequence sets Klaus Wagner Fri 02 March 2012
- Piecewise testable events Imre Simon Fri 02 March 2012
- On the parsing of LL-regular grammars Anton Nijholt Fri 02 March 2012
- Using determinancy of games to eliminate quantifiers J. Richard Buchi Fri 02 March 2012
- Self-modifying nets, a natural extension of Petri nets Rüdiger Valk Fri 02 March 2012
- A generalization of Ginsburg and Rosetextquotesingles characterization of G-S-M mappings C. Choffrut Fri 02 March 2012
- The theory and practice of transforming call-by-need into call-by-value Alan Mycroft Fri 02 March 2012
- Introduction to general net theory C. A. Petri Fri 02 March 2012
- A note on sweeping automata Piotr Berman Fri 02 March 2012
- The complexity of the inequivalence problem for regular expressions with intersection Martin Fürer Fri 02 March 2012
Library Size: 13G (12967 entries),
Last Updated: Apr 15, 2026, 08:32:59,
Build Time: N/A
