bibliographer - readme

Decidability of DPDA Language Equivalence via First-Order Grammars Petr Jancar Tue 17 January 2023
Rational and algebraic series in combinatorial enumeration Mireille Bousquet-Mélou Mon 24 February 2020
Holonomic functions and their relation to linearly constrained languages P. Massazza Mon 24 February 2020
Verifying Higher-Order Functions with Tree Automata Thomas Genet Timothée Haudebourg Thomas Jensen Wed 08 May 2019
Advanced Automata-based Algorithms for Program Termination Checking Yu-Fang Chen Matthias Heizmann Ondřej Lengál Yong Li Ming-Hsien Tsai Andrea Turrini Lijun Zhang Wed 24 April 2019
Inductive families Peter Dybjer Thu 21 March 2019
HoCHC: a Refutationally-complete and Semantically-invariant System of Higher-order Logic Modulo Theories C. -H. Luke Ong Dominik Wagner Tue 05 March 2019
Minimum-Time Reachability for Timed Automata Peter Niebert Stavros Tripakis Sergio Yovine Fri 22 February 2019
Verifying Asynchronous Interactions via Communicating Session Automata Julien Lange Nobuko Yoshida Thu 31 January 2019
History of Interactive Theorem Proving John Harrison Josef Urban Freek Wiedijk Mon 22 October 2018
Hammer for Coq: Automation for Dependent Type Theory Łukasz Czajka Cezary Kaliszyk Mon 22 October 2018
A Taxonomy of Problems with Fast Parallel Algorithms Stephen A. Cook Sat 22 September 2018
The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract) W. Czerwinski S. Lasota R. Lazic J. Leroux F. Mazowiecki Thu 20 September 2018
Automata vs Linear-Programming Discounted-Sum Inclusion Suguman Bansal Swarat Chaudhuri Moshe Y. Vardi Thu 26 July 2018
Removing All Silent Transitions from Timed Automata Cătălin Dima Ruggero Lanotte Wed 25 July 2018
Linearity in Higher-order Recursion Schemes Pierre Clairambault Charles Grellois Andrzej S. Murawski Sat 30 June 2018
Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable Helmut Seidl Sebastian Maneth Gregor Kemper Fri 29 June 2018
The calculus of constructions Thierry Coquand Gérard Huet Tue 22 May 2018
A Domain-specific Language for Experimental Game Theory Eric Walkingshaw Martin Erwig Tue 03 April 2018
Polynomial Invariants for Affine Programs Ehud Hrushovski Joel Ouaknine Amaury Pouly James Worrell Mon 02 April 2018
The complexity of logical theories Leonard Berman Mon 30 October 2017
Verifying Higher-Order Functions with Tree Automata: Extended Version Thomas Genet Timothée Haudebourg Thomas Jensen Tue 24 October 2017
Logic, Arithmetic, and Automata Alonzo Church Mon 03 July 2017
Reachability in pushdown register automata A.S. Murawski S.J. Ramsay N. Tzevelekos Tue 27 June 2017
Higher-order parity automata Paul-André Melliès Thu 22 June 2017
A cartesian-closed category for higher-order model checking Martin Hofmann Jérémy Ledent Fri 02 June 2017
Karp-Miller Trees for a Branching Extension of VASS Kumar Neeraj Verma Jean Goubault-Larrecq Thu 01 June 2017
Compiling Untyped Lambda Calculus to Lower-level Code by Game Semantics and Partial Evaluation (Invited Paper) Daniil Berezun Neil D. Jones Sun 21 May 2017
Domains for Higher-Order Games Matthew Hague Roland Meyer Sebastian Muskalla Sat 06 May 2017
Type-Directed Partial Evaluation Olivier Danvy Thu 04 May 2017
Efficient normalization by evaluation Mathieu Boespflug Wed 03 May 2017
The Simple Type Theory of Normalisation by Evaluation René Vestergaard Wed 03 May 2017
Pragmatics of type-directed partial evaluation Olivier Danvy Wed 03 May 2017
A Semantic Account of Type-Directed Partial Evaluation Andrzej Filinski Wed 03 May 2017
Term rewriting for normalization by evaluation Ulrich Berger Matthias Eberl Helmut Schwichtenberg Mon 01 May 2017
Model-checking process equivalences Martin Lange Etienne Lozes Manuel Vargas Guzmán Tue 18 April 2017
Growing a Language Jr. Guy L. Steele Tue 11 April 2017
Notation As a Tool of Thought Kenneth E. Iverson Tue 11 April 2017
Using Circular Programs to Eliminate Multiple Traversals of Data R. S. Bird Sat 08 April 2017
The Complexity of Downward Closure Comparisons Georg Zetzsche Mon 03 April 2017
Sequential games and optimal strategies Martín Escardó Paulo Oliva Tue 28 March 2017
Succinct progress measures for solving parity games Marcin Jurdziński Ranko Lazić Mon 27 February 2017
Regular Separability of One Counter Automata Wojciech Czerwiński Sławomir Lasota Thu 19 January 2017
Markov Chains and Unambiguous Buchi Automata Christel Baier Stefan Kiefer Joachim Klein Sascha Kluppelholz David Muller James Worrell Mon 21 November 2016
Reasoning and Query Answering in Description Logics Magdalena Ortiz Mantas Šimkus Fri 23 September 2016
Optimizing the Expected Mean Payoff in Energy Markov Decision Processes Tomáš Brázdil Antonín Kučera Petr Novotný Sat 09 July 2016
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications Taolue Chen Tingting Han Joost-Pieter Katoen Alexandru Mereacre Sat 09 July 2016
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One Stefan Gøller Christoph Haase Ranko Lazić Patrick Totzke Mon 29 February 2016
Fifty Years of the Spectrum Problem: Survey and New Results Arnaud Durand Neil Jones Johann Makowsky Malika More Mon 02 November 2015
On the Expressiveness of Multiparty Session Types Romain Demangeon Nobuko Yoshida Sat 19 September 2015
The Odds of Staying on Budget Christoph Haase Stefan Kiefer Sat 19 September 2015
The Power of Priority Channel Systems Christoph Haase Sylvain Schmitz Philippe Schnoebelen Sat 19 September 2015
Bisimilarity in Fresh-Register Automata A.S. Murawski S.J. Ramsay N. Tzevelekos Sat 19 September 2015
What's Decidable About Recursive Hybrid Automata Shankara Narayanan Krishna Lakshmi Manasa Ashutosh Trivedi Sat 12 September 2015
Relational Semantics of Linear Logic and Higher-order Model Checking Charles Grellois Paul-André Melliès Wed 09 September 2015
The Ideal View on Rackoff's Coverability Technique Ranko Lazić Sylvain Schmitz Fri 24 July 2015
Over-approximating Descendants by Synchronized Tree Languages Yohan Boichut Jacques Chabin Pierre Réty Mon 22 June 2015
Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars Jonathan Kochems C.H. Luke Ong Mon 22 June 2015
Recognisable languages over monads Mikołaj Bojańczyk Tue 16 June 2015
A model for behavioural properties of higher-order programs Sylvain Salvati Igor Walukiewicz Thu 04 June 2015
Finitary semantics of linear logic and higher-order model-checking Charles Grellois Paul-André Melliès Thu 04 June 2015
From Non-preemptive to Preemptive Scheduling using Synchronization Synthesis Pavol Černý Edmund M. Clarke Thomas A. Henzinger Arjun Radhakrishna Leonid Ryzhyk Roopsha Samanta Thorsten Tarrach Mon 25 May 2015
The mu-calculus and model-checking Julian Bradfield Igor Walukiewicz Fri 22 May 2015
Compositional Higher-Order Model Checking via ømega-Regular Games over Böhm Trees Takeshi Tsukada C.-H. Luke Ong Mon 30 March 2015
Abstract Interpretation from Buchi Automata Martin Hofmann Wei Chen Mon 30 March 2015
Typing weak MSOL properties Sylvain Salvati Igor Walukiewicz Sun 01 February 2015
Minimizing Risk Models in Markov Decision Processes with Policies Depending on Target Values Congbin Wu Yuanlie Lin Fri 30 January 2015
Analysing Neurobiological Models Using Communicating Automata Li Su Rodolfo Gomez Howard Bowman Thu 08 January 2015
ACME: Automata with Counters, Monoids and Equivalence Nathanael Fijalkow Denis Kuperberg Tue 18 November 2014
On The Reachability Problem for Recursive Hybrid Automata with One and Two Players Shankara Narayanan Krishna Lakshmi Manasa Ashutosh Trivedi Wed 17 September 2014
Reachability in Pushdown Register Automata Andrzej S. Murawski Steven J. Ramsay Nikos Tzevelekos Mon 15 September 2014
Time, Clocks, and the Ordering of Events in a Distributed System Leslie Lamport Sat 13 September 2014
Infinite games played on finite graphs Robert McNaughton Mon 18 August 2014
Solvency Markov Decision Processes with Interest Tomáš Brázdil Taolue Chen Vojtěch Forejt Petr Novotný Aistis Simaitis Tue 15 July 2014
Alternating Vector Addition Systems with States Jean-Baptiste Courtois Sylvain Schmitz Tue 01 July 2014
An Algebraic Proof of Rabin's Tree Theorem Achim Blumensath Fri 02 May 2014
Regular Sets of Descendants by Some Rewrite Strategies Pierre Réty Julie Vuotto Fri 02 May 2014
Regular Sets of Descendants by Leftmost Strategy Pierre Réty Julie Vuotto Fri 02 May 2014
Undecidability in binary tag systems and the Post correspondence problem for four pairs of words Turlough Neary Mon 28 April 2014
Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes Koichi Fujima Sohei Ito Naoki Kobayashi Sat 26 April 2014
Complexity of Model-Checking Call-by-Value Programs Takeshi Tsukada Naoki Kobayashi Sat 26 April 2014
Higher-Order Model Checking by Abstraction of Type Derivation Rewriting Naoki Kobayashi Takeshi Tsukada Sat 26 April 2014
Transition Graphs of Rewriting Systems over Unranked Trees Christof Løding Alex Spelten Mon 07 April 2014
Minimal and Optimal Computations of Recursive Programs Gérard Berry Jean-Jacques Lévy Fri 04 April 2014
Practical Coinduction Dexter Kozen Alexandra Silva Fri 28 March 2014
Markov Decision Processes and Regular Events Costas Courcoubetis Mihalis Yannakakis Thu 20 March 2014
Model-Checking Process Equivalences Martin Lange Etienne Lozes Manuel Vargas Guzmán Wed 19 March 2014
Finding Fixpoints on Function Spaces Jonathan Joung Paul Hudak Wed 19 March 2014
Strictness analysis for higher-order functions Geoffrey L. Burn Chris Hankin Samson Abramsky Wed 19 March 2014
Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation John P. Gallagher Mads Rosendahl Wed 12 March 2014
A Constraint-based Approach to Solving Games on Infinite Graphs Tewodros Beyene Swarat Chaudhuri Corneliu Popeea Andrey Rybalchenko Tue 11 March 2014
A Swiss Pocket Knife for Computability Neil D. Jones Sat 08 March 2014
An Even Faster Solver for General Systems of Equations Christian Fecht Helmut Seidl Fri 07 March 2014
Abstract Interpretation as a Programming Language Mads Rosendahl Thu 06 March 2014
Regret Minimization in Games with Incomplete Information Martin Zinkevich Michael Johanson Michael H. Bowling Carmelo Piccione Thu 06 March 2014
On the progress of communication between two finite state machines M.G. Gouda E.G. Manning Y.T. Yu Thu 06 March 2014
Computing with Capsules Jean-Baptiste Jeannin Dexter Kozen Sat 01 March 2014
Rational Graphs Trace Context-Sensitive Languages Christophe Morvan Colin Stirling Mon 24 February 2014
HMC: Verifying Functional Programs Using Abstract Interpreters Ranjit Jhala Rupak Majumdar Andrey Rybalchenko Thu 13 February 2014
Modular strategies for recursive game graphs Rajeev Alur Salvatore La Torre P. Madhusudan Fri 31 January 2014
Infinitary lambda calculus J. R. Kennaway J. W. Klop M. R. Sleep F. J. de Vries Wed 29 January 2014
Reachability Analysis over Term Rewriting Systems Guillaume Feuillade Thomas Genet Valérie Viet Triem Tong Wed 15 January 2014
Resource Interfaces Arindam Chakrabarti Luca Alfaro Thomas A. Henzinger Marielle Stoelinga Mon 13 January 2014
The Complexity of Multi-Mean-Payoff and Multi-Energy Games Yaron Velner Krishnendu Chatterjee Laurent Doyen Thomas A. Henzinger Alexander Rabinovich Jean-Francois Raskin Mon 13 January 2014
Extended multi bottom--up tree transducers Joost Engelfriet Eric Lilin Andreas Maletti Thu 09 January 2014
What will you have, DP or NP Željko Bošković Fri 27 December 2013
Model Checking and Higher-Order Recursion Hardi Hungar Mon 16 December 2013
Reducing Nondeterministic Finite Automata with SAT Solvers Jaco Geldenhuys Brink van der Merwe Lynette van Zijl Thu 12 December 2013
An Investigation of the Therac-25 Accidents Nancy G. Leveson Clark S. Turner Wed 11 December 2013
Higher order indexed monadic systems Didier Caucal Teodor Knapik Tue 10 December 2013
Graph Logics with Rational Relations Pablo Barcelo Diego Figueira Leonid Libkin Wed 13 November 2013
Unidirectional channel systems can be tested Petr Jančar Prateek Karandikar Philippe Schnoebelen Wed 13 November 2013
Intersection Type Matching with Subtyping Boris Dudder Moritz Martens Jakob Rehof Wed 13 November 2013
Bounded phase analysis of message-passing programs Ahmed Bouajjani Michael Emmi Tue 12 November 2013
Minimal Function Graphs Are Not Instrumented Alan Mycroft Mads Rosendahl Fri 08 November 2013
Reduction: a method of proving properties of parallel programs Richard J. Lipton Fri 08 November 2013
Summarizing procedures in concurrent programs Shaz Qadeer Sriram K. Rajamani Jakob Rehof Thu 07 November 2013
Learn with SAT to Minimize Buchi Automata Stephan Barth Martin Hofmann Mon 28 October 2013
On Flatness for 2-Dimensional Vector Addition Systems with States Jérôme Leroux Grégoire Sutre Fri 25 October 2013
Software Model Checking for People Who Love Automata Matthias Heizmann Jochen Hoenicke Andreas Podelski Fri 25 October 2013
Nested timed automata Guoqiang Li Xiaojuan Cai Mizuhito Ogawa Shoji Yuen Fri 18 October 2013
Process Rewrite Systems Richard Mayr Tue 15 October 2013
Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis Kalmer Apinis Helmut Seidl Vesal Vojdani Mon 07 October 2013
Analyzing probabilistic pushdown automata Tomáš Brázdil Javier Esparza Stefan Kiefer Antonín Kučera Wed 25 September 2013
Type inference with subtypes You-Chin Fuh Prateek Mishra Wed 17 July 2013
Coercion and type inference John C. Mitchell Wed 17 July 2013
On understanding types, data abstraction, and polymorphism Luca Cardelli Peter Wegner Wed 17 July 2013
Exploiting reachability and cardinality in higher-order flow analysis Matthew Might Olin Shivers Wed 17 July 2013
Solving Existentially Quantified Horn Clauses Tewodros A. Beyene Corneliu Popeea Andrey Rybalchenko Mon 15 July 2013
Sense and denotation as algorithm and value Yiannis N. Moschovakis Mon 15 July 2013
The IO and OI Hierarchies Revisited Gregory M. Kobele Sylvain Salvati Mon 15 July 2013
The Hardest'' Natural Decidable Theory Sergei Vorobyov Mon 15 July 2013
Proof Systems for Retracts in Simply Typed Lambda Calculus Colin Stirling Fri 12 July 2013
Relating word and tree automata Orna Kupferman Shmuel Safra Moshe Y. Vardi Fri 12 July 2013
Nondeterminism in the Presence of a Diverse or Unknown Future Udi Boker Denis Kuperberg Orna Kupferman Michał Skrzypczak Fri 12 July 2013
Types in lambda calculi and programming languages Henk Barendregt Kees Hemerik Wed 10 July 2013
A practical and flexible flow analysis for higher-order languages J. Michael Ashley R. Kent Dybvig Tue 09 July 2013
Models of LCF Robin Milner Tue 09 July 2013
Fundamental Concepts in Programming Languages Christopher Strachey Tue 09 July 2013
Methods and applications of (max,+) linear algebra Stéphane Gaubert Max Plus Tue 09 July 2013
Closure analysis in constraint form Jens Palsberg Thu 04 July 2013
Pushdown flow analysis of first-class control Dimitrios Vardoulakis Olin Shivers Mon 01 July 2013
Type inclusion constraints and type inference Alexander Aiken Edward L. Wimmers Mon 01 July 2013
Set constraints: Results, applications and future directions Alexander Aiken Mon 01 July 2013
Higher-order minimal function graphs Neil D Jones Mads Rosendahl Sun 30 June 2013
Automatic computation of data set definitions John C. Reynolds Fri 28 June 2013
Subcubic algorithms for recursive state machines Swarat Chaudhuri Thu 27 June 2013
Strict intersection types for the Lambda Calculus Steffen van Bakel Mon 24 June 2013
Solving Parity Games on Integer Vectors Parosh Aziz Abdulla Richard Mayr Arnaud Sangnier Jeremy Sproston Fri 14 June 2013
A Filter Lambda Model and the Completeness of Type Assignment Henk Barendregt Mario Coppo Mariangiola Dezani-Ciancaglini Thu 13 June 2013
Finite combinatory logic with intersection types Jakob Rehof Paweł Urzyczyn Wed 12 June 2013
A Compiled Implementation of Normalization by Evaluation Klaus Aehlig Florian Haftmann Tobias Nipkow Tue 11 June 2013
The Power of Priority Channel Systems Christoph Haase Sylvain Schmitz Philippe Schnoebelen Fri 31 May 2013
A traversal-based algorithm for higher-order model checking Robin P. Neatherway Steven J. Ramsay Chih-Hao Luke Ong Wed 01 May 2013
Intuitionistic propositional logic is polynomial-space complete Richard Statman Fri 05 April 2013
An Early Program Proof by Alan Turing F. L. Morris C. B. Jones Wed 27 March 2013
Considerations on open access publication and on the role and publication of conference proceedings V. Sassone Wed 27 March 2013
Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus Kazushige Terui Wed 27 March 2013
Computable fixpoints in well-structured symbolic model checking Nathalie Bertrand Philippe Schnoebelen Thu 21 March 2013
Solving stochastic Buchi games on infinite arenas with a finite attractor Nathalie Bertrand Philippe Schnoebelen Thu 21 March 2013
A formulae-as-type notion of control Timothy G. Griffin Mon 11 March 2013
The mechanical evaluation of expressions Peter Landin Fri 01 March 2013
High level tree transducers and iterated pushdown tree transducers Joost Engelfriet Heiko Vogler Tue 26 February 2013
An introduction to event structures Glynn Winskel Thu 21 February 2013
Prelogical Relations Furio Honsell Donald Sannella Mon 18 February 2013
Domain theory in logical form Samson Abramsky Mon 18 February 2013
Lambda-definability and Logical Relations Gordon Plotkin Sun 17 February 2013
The Undecidability of łambda-Definability Ralph Loader Fri 15 February 2013
Automated temporal reasoning about reactive systems E. Allen Emerson Thu 31 January 2013
Model Checking Liveness Properties of Higher-Order Functional Programs M. Lester R. Neatherway C. -H. L. Ong S. Ramsay Wed 30 January 2013
Tractable Constraints in Finite Semilattices Jakob Rehof Torben Æ. Mogensen Wed 30 January 2013
A Survey of Functional Reactive Programming Edward Amsden Tue 29 January 2013
Imperative Programming in Sets with Atoms Mikolaj Bojanczyk Szymon Torunczyk Mon 28 January 2013
Accelerating tree-automatic relations Widjaja Lin Anthony Mon 28 January 2013
Approximate Determinization of Quantitative Automata Udi Boker Thomas A. Henzinger Mon 28 January 2013
Proving that programs eventually do something good Byron Cook Alexey Gotsman Andreas Podelski Andrey Rybalchenko Moshe Y. Vardi Mon 28 January 2013
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus Naoki Kobayashi C.-H. Luke Ong Mon 28 January 2013
Environmental bisimulations for higher-order languages Davide Sangiorgi Naoki Kobayashi Eijiro Sumii Mon 28 January 2013
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes Naoki Kobayashi Mon 28 January 2013
Programming languages, natural languages, and mathematics Peter Naur Sun 27 January 2013
Understanding code mobility G.P. Picco Thu 24 January 2013
Is Code Still Moving Around Looking Back at a Decade of Code Mobility Antonio Carzaniga Gian Pietro Picco Giovanni Vigna Thu 24 January 2013
Linear Automaton Transformations A. Nerode Sat 29 December 2012
Solving Stochastic Buchi Games on Infinite Decisive Arenas Nathalie Bertrand Philippe Schnoebelen Thu 20 December 2012
The covering and boundedness problems for vector addition systems Charles Rackoff Tue 18 December 2012
Approximate comparison of distance automata Thomas Colcombet Laure Daviaud Tue 18 December 2012
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems Nathalie Bertrand Giorgio Delzanno Barbara Kønig Arnaud Sangnier Jan Stuckrath Tue 18 December 2012
Verification of Unreliable Ad Hoc Networks Giorgio Delzanno Arnaud Sangnier Gianluigi Zavattaro Sun 16 December 2012
MoVeP 2012 N/A Tue 11 December 2012
Flat counter automata almost everywhere Jérôme Leroux Gregoire Sutre Tue 04 December 2012
Reasoning with time and chance Daniel Lehmann Saharon Shelah Tue 04 December 2012
Well (and better) quasi-ordered transition systems Parosh Aziz Abdulla Sat 01 December 2012
Intersection Types, Lambda-models and Bøhm Trees Mariangiola Dezani-Ciancaglini Elio Giovannetti Ugo de' Liguoro Fri 30 November 2012
Recognizability in the Simply Typed Lambda-Calculus Sylvain Salvati Tue 27 November 2012
Reducing concurrent analysis under a context bound to sequential analysis Akash Lal Thomas Reps Tue 27 November 2012
The regular viewpoint on PA-processes D. Lugiez Ph. Schnoebelen Tue 27 November 2012
Well-structured transition systems everywhere A. Finkel Ph. Schnoebelen Tue 27 November 2012
MALEDIRE DIO - Studio sulla bestemmia Isacco Turina Tue 27 November 2012
Weak Alternating Timed Automata Pawel Parys Igor Walukiewicz Mon 26 November 2012
Alternating tree automata Giora Slutzki Fri 02 November 2012
Parallel program schemata Richard M. Karp Raymond E. Miller Fri 26 October 2012
Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs Bernard Boigelot Patrice Godefroid Tue 23 October 2012
Software model checking using languages of nested trees Rajeev Alur Swarat Chaudhuri P. Madhusudan Wed 17 October 2012
Languages of Nested Trees Rajeev Alur Swarat Chaudhuri P. Madhusudan Wed 17 October 2012
On the Connections between Rewriting and Formal Language Theory Friedrich Otto Mon 15 October 2012
Visibly Pushdown Languages and Term Rewriting Jacques Chabin Pierre Réty Thu 11 October 2012
Abstract regular (tree) model checking Ahmed Bouajjani Peter Habermehl Adam Rogalewicz Tomáš Vojnar Fri 05 October 2012
Reachability Problems on Regular Ground Tree Rewriting Graphs Christof Løding Fri 28 September 2012
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata Giovanna Lavado Giovanni Pighizzini Shinnosuke Seki Tue 25 September 2012
Efficient Implementation of Regular Languages Using r-AFA K. Salomaa X. Wu Sheng Yu Sun 23 September 2012
Foundations of nominal techniques: logic and semantics of variables in abstract syntax Murdoch James Gabbay Sat 22 September 2012
An Elementary Theory of the Category of Sets Bill Lawvere Thu 20 September 2012
The Basic Concepts of Algebraic Logic Paul Halmos Wed 05 September 2012
An old-fashioned recipe for real time Martín Abadi Leslie Lamport Tue 10 July 2012
Reachability in Petri Nets with Inhibitor Arcs Klaus Reinhardt Thu 05 July 2012
Analysis of Timed Recursive State Machines M. Benerecetti S. Minopoli A. Peron Sat 30 June 2012
Bisimulation Equivalence for First-Order Grammars Petr Jancar Fri 22 June 2012
An abstract interpretation framework for termination Patrick Cousot Radhia Cousot Thu 21 June 2012
Fundamental properties of infinite trees Bruno Courcelle Mon 18 June 2012
Message Sequence Charts Blaise Genest Anca Muscholl Doron Peled Sat 02 June 2012
Relating timed and register automata Diego Figueira Piotr Hofman Sławomir Lasota Sat 02 June 2012
Regular model checking Parosh Aziz Abdulla Thu 24 May 2012
Asynchronously Communicating Visibly Pushdown Systems Domagoj Babic Zvonimir Rakamaric Thu 24 May 2012
Partial Order Reductions for Timed Systems Johan Bengtsson Bengt Jonsson Johan Lilius Wang Yi Wed 23 May 2012
Monadic second-order logic on tree-like structures Igor Walukiewicz Sat 19 May 2012
The Monadic Theory of Morphic Infinite Words and Generalizations Olivier Carton Wolfgang Thomas Sat 12 May 2012
Propositions as Sessions Philip Wadler Wed 02 May 2012
The monadic second-order logic of graphs IX: Machines and their behaviours Bruno Courcelle Fri 27 April 2012
A tutorial on (co)algebras and (co)induction Bart Jacobs Jan Rutten Wed 25 April 2012
Stream Differential Equations: concrete formats for coinductive definitions Clemens Kupke Milad Niqui Jan Rutten Thu 19 April 2012
On the Complexity of the Equivalence Problem for Probabilistic Automata Stefan Kiefer Andrzej S. Murawski Joel Ouaknine Bjørn Wachter James Worrell Mon 02 April 2012
Optimal Zielonka-type construction of deterministic asynchronous automata Blaise Genest Hugo Gimbert Anca Muscholl Igor Walukiewicz Mon 19 March 2012
Emptiness and universality problems in timed automata with positive frequency Nathalie Bertrand Patricia Bouyer Thomas Brihaye Amélie Stainer Tue 13 March 2012
Iterated stack automata and complexity classes Joost Engelfriet Tue 06 March 2012
Unsafe grammars and panic automata Teodor Knapik Damian Niwiński Paweł Urzyczyn Igor Walukiewicz Tue 06 March 2012
The IO- and OI-hierarchies Werner Damm Tue 06 March 2012

Library Size: 13G (236 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]