- On well quasi-orders on languages Flavio D'Alessandro Stefano Varricchio Sat 01 December 2012
- Intersection Types, Lambda-models and Bøhm Trees Mariangiola Dezani-Ciancaglini Elio Giovannetti Ugo de' Liguoro Fri 30 November 2012
- On the Myhill-Nerode Theorem for Trees Dexter Kozen Fri 30 November 2012
- Safety Verification of Communicating One-Counter Machines Alexander Heußner Tristan Le Gall Gregoire Sutre Fri 30 November 2012
- Timed automata and recognizability Philippe Herrmann Wed 28 November 2012
- Alternating Timed Automata over Bounded Time Mark Jenkins Joel Ouaknine Alexander Rabinovich James Worrell Wed 28 November 2012
- Recognizability in the Simply Typed Lambda-Calculus Sylvain Salvati Tue 27 November 2012
- Higher-Order Matching and Tree Automata Hubert Comon Yan Jurski Tue 27 November 2012
- On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems Mohamed Faouzi Atig Ahmed Bouajjani Tue 27 November 2012
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads Mohamed Faouzi Atig Ahmed Bouajjani Shaz Qadeer Tue 27 November 2012
- Reachability analysis of multithreaded software with asynchronous communication Ahmed Bouajjani Javier Esparza Stefan Schwoon Jan Strejček Tue 27 November 2012
- Regular symbolic analysis of dynamic networks of pushdown systems Ahmed Bouajjani Markus Muller-Olm Tayssir Touili Tue 27 November 2012
- Reachability under contextual locking Rohit Chadha P. Madhusudan Mahesh Viswanathan Tue 27 November 2012
- Decidability and Decomposition in Process Algebras Søren Christensen Tue 27 November 2012
- Partially-commutative context-free processes: Expressibility and tractability Wojciech Czerwiński Sibylle Frøschle Sławomir Lasota Tue 27 November 2012
- Partially-Commutative Context-Free Processes Wojciech Czerwiński Sibylle Frøschle Sławomir Lasota Tue 27 November 2012
- Partially-commutative context-free languages Wojciech Czerwiński Sławomir Lasota Tue 27 November 2012
- Reasoning about threads with bounded lock chains Vineet Kahlon Tue 27 November 2012
- Reasoning about threads communicating via locks Vineet Kahlon Franjo Ivanăić Aarti Gupta Tue 27 November 2012
- Reachability is decidable for weakly extended process rewrite systems Mojmír Křetínský Vojtěch Řehák Jan Strejček Tue 27 November 2012
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 15:38:46,
Build Time: N/A
