- mu -definable sets of integers R.S. Lubarsky Fri 02 March 2012
- Actions speak louder than words: proving bisimilarity for context-free processes H. Huttel C. Stirling Fri 02 March 2012
- Operational aspects of linear lambda calculus P. Lincoln J. Mitchell Fri 02 March 2012
- Lambek grammars are context free M. Pentus Fri 02 March 2012
- Set constraints are the monadic class L. Bachmair H. Ganzinger U. Waldmann Fri 02 March 2012
- On the parallel complexity of model checking in the modal mu-calculus Shipei Zhang O. Sokolsky S.A. Smolka Fri 02 March 2012
- On the verification problem of nonregular properties for nonregular processes A. Bouajjani R. Echahed P. Habermehl Fri 02 March 2012
- Domain theory in stochastic processes A. Edalat Fri 02 March 2012
- Finitely monotone properties A.P. Stolboushkin Fri 02 March 2012
- Tarskian set constraints D.A. McAllester R. Givan C. Witty D. Kozen Fri 02 March 2012
- Reactive modules R. Alur T.A. Henzinger Fri 02 March 2012
- Efficient model checking via the equational mu-calculus G. Bhat R. Cleaveland Fri 02 March 2012
- Linear logic, monads and the lambda calculus N. Benton P. Wadler Fri 02 March 2012
- Strong normalization of explicit substitutions via cut elimination in proof nets R. Di Cosmo D. Kesner Fri 02 March 2012
- Automata, tableaus and a reduction theorem for fixpoint calculi in arbitrary complete lattices D. Janin Fri 02 March 2012
- Towards a mathematical operational semantics Daniele Turi Gordon Plotkin Fri 02 March 2012
- Two-variable logic with counting is decidable E. Gradel M. Otto E. Rosen Fri 02 March 2012
- Complexity of two-variable logic with counting L. Pacholski W. Szwast L. Tendera Fri 02 March 2012
- On the cubic bottleneck in subtyping and flow analysis N. Heintze D. McAllester Fri 02 March 2012
- A new approach to abstract syntax involving binders M. Gabbay A. Pitts Fri 02 March 2012
Library Size: 13G (12947 entries),
Last Updated: Apr 09, 2026, 18:14:57,
Build Time: N/A
