- Angluin-style Learning of NFA Benedikt Bollig Peter Habermehl Carsten Kern Martin Leucker Tue 21 March 2017
- A Notation for Comonads Dominic Orchard Alan Mycroft Fri 17 March 2017
- Enumerating the Rationals Jeremy Gibbons David Lester Richard Bird Wed 15 March 2017
- Metamorphisms: Streaming representation-changers Jeremy Gibbons Tue 14 March 2017
- The Most Unreliable Technique in the World to compute pi Jerzy Karczmarczuk Tue 14 March 2017
- Unbounded spigot algorithms for the digits of pi (2006) Jeremy Gibbons Tue 14 March 2017
- Extreme Interleavings Mordechai Ben-Ari Alan Burns Sun 12 March 2017
- Deciding parity games in quasipolynomial time C. S. Calude S. Jain B. Khoussainov W. Li F. Stephan Sat 11 March 2017
- An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space John Fearnley Sanjay Jain Sven Schewe Frank Stephan Dominik Wojtczak Sat 11 March 2017
- Penrose: Putting Compositionality to Work for Petri Net Reachability Paweł Sobociński Owen Stephens Fri 10 March 2017
- Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire Erik Meijer Maarten Fokkinga Ross Paterson Thu 09 March 2017
- Automated Assumption Generation for Compositional Verification Anubhav Gupta Kenneth L. McMillan Zhaohui Fu Wed 08 March 2017
- Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers Daniel Neider Wed 08 March 2017
- A Sufficient Condition to Polynomially Compute a Minimum Separating DFA Manuel Vázquez de Parga Pedro García Damián López Wed 08 March 2017
- Learning Minimal Separating DFA's for Compositional Verification Yu-Fang Chen Azadeh Farzan Edmund M. Clarke Yih-Kuen Tsay Bow-Yaw Wang Wed 08 March 2017
- Report on LiCS 2016 Paweł Sobociński Tue 07 March 2017
- The NP-completeness Column: Finding Needles in Haystacks David S. Johnson Wed 01 March 2017
- GPU Accelerated Strong and Branching Bisimilarity Checking Anton Wijs Wed 01 March 2017
- Nested Words for Order-2 Pushdown Systems C. Aiswarya Paul Gastin Prakash Saivasan Tue 28 February 2017
- Verification of Parameterized Communicating Automata via Split-Width Marie Fortin Paul Gastin Tue 28 February 2017
Library Size: 13G (12984 entries),
Last Updated: Apr 23, 2026, 21:48:37,
Build Time: N/A
