default search action
Logical Methods in Computer Science, Volume 9
Volume 9, Number 1, 2013
- Robbert Krebbers, Bas Spitters
:
Type classes for efficient exact real arithmetic in Coq. - René David, Christophe Raffalli, Guillaume Theyssier, Katarzyna Grygiel, Jakub Kozik
Some properties of random lambda terms. - François Laroussinie, Antoine Meyer
Counting CTL. - Aaron Stump, Hans Zantema, Garrin Kimmell, Roba El Haj Omar:
A Rewriting View of Simple Typing. - Jérôme Leroux:
Vector Addition System Reversible Reachability Problem. - Frédéric Herbreteau, B. Srivathsan:
Coarse abstractions make Zeno behaviours difficult to detect. - Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert:
On Subgame Perfection in Quantitative Reachability Games. - Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
On the Complexity of Equivalence and Minimisation for Q-weighted Automata. - Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue
Generalizing determinization from automata to coalgebras. - Petr Jancar
Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof). - Martin Grohe
L-Recursion and a new Logic for Logarithmic Space. - Alexander Kartzow:
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic. - Seth Fogarty, Orna Kupferman, Thomas Wilke, Moshe Y. Vardi:
Unifying Büchi Complementation Constructions. - Daisuke Kimura, Makoto Tatsuta:
Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types. - Hubie Chen, Moritz Müller:
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction. - Sebastian Müller:
Polylogarithmic Cuts in Models of V^0.
Volume 9, Number 2, 2013
- Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher:
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories. - Kojiro Higuchi, Arno Pauly:
The degree structure of Weihrauch-reducibility. - Stéphane Le Roux:
Infinite sequential Nash equilibrium. - Michael Benedikt
Two Variable vs. Linear Temporal Logic in Model Checking and Games. - Victor L. Selivanov:
Total Representations. - John Fearnley, Sven Schewe
Time and Space Results for Parity Games with Bounded Treewidth. - Lei Song, Lijun Zhang, Jens Chr. Godskesen:
Bisimulations Meet PCTL Equivalences for Probabilistic Automata. - Sebastian Preugschat, Thomas Wilke:
Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata. - George Metcalfe, Christoph Röthlisberger:
Admissibility in Finitely Generated Quasivarieties. - Martin Huschenbett, Alexander Kartzow, Jiamou Liu
Tree-Automatic Well-Founded Trees. - David de Frutos-Escrig
Unifying the Linear Time-Branching Time Spectrum of Process Semantics. - Roy Mennicke:
Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems. - Vladimir V. Podolskii
Lower Bound on Weights of Large Degree Threshold Functions. - Samy Abbes
Markov two-components processes.
Volume 9, Number 3, 2013
- Pablo Barceló, Diego Figueira
Graph Logics with Rational Relations. - Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa
Well-Pointed Coalgebras. - Thomas Colcombet:
Regular Cost Functions, Part I: Logic and Algebra over Words. - Gerald Lüttgen, Walter Vogler:
Modal Interface Automata. - Klaus Weihrauch:
Computably regular topological spaces. - Neil Ghani, Patricia Johann, Clément Fumex:
Indexed Induction and Coinduction, Fibrationally. - Yuval Filmus:
Universal codes of the natural numbers. - Lukasz Mikulski
Algebraic Structure of Combined Traces. - Takakazu Mori, Yoshiki Tsujii, Mariko Yasugi:
Computability of Probability Distributions and Characteristic Functions. - Tom Hirschowitz
Cartesian closed 2-categories and permutation equivalence in higher-order rewriting. - Johannes Borgström, Andrew D. Gordon, Michael Greenberg
Measure Transformer Semantics for Bayesian Machine Learning. - Alexey Gotsman, Hongseok Yang:
Linearizability with Ownership Transfer. - Wojciech Czerwinski, Piotr Hofman
Reachability Problem for Weak Multi-Pushdown Automata. - Joost Winter, Marcello M. Bonsangue
Coalgebraic Characterizations of Context-Free Languages. - Jakob Nordström
Pebble Games, Proof Complexity, and Time-Space Trade-offs. - Roberto Bruni, Hernán C. Melgratti, Ugo Montanari, Pawel Sobocinski
Connector algebras for C/E and P/T nets' interactions. - Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann:
On Characterising Distributability. - Victor Khomenko, Roland Meyer, Reiner Hüchting:
A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets. - John Case, Sanjay Jain, Samuel Seah, Frank Stephan
Automatic functions, linear time and learning. - Peter Schuster
Induction in Algebra: a First Case Study. - Rémi Bonnet, Rohit Chadha, P. Madhusudan, Mahesh Viswanathan:
Reachability under Contextual Locking. - Nathan J. Bowler, Sergey Goncharov
Exploring the Boundaries of Monad Tensorability on Set. - Bart Jacobs:
Bases as Coalgebras. - Joël Ouaknine
A Static Analysis Framework for Livelock Freedom in CSP. - Luc Segoufin, Balder ten Cate:
Unary negation. - Andrea Cerone
Modelling Probabilistic Wireless Networks. - Bjørn Kjos-Hanssen:
Recovering randomness from an asymptotic Hamming distance. - Stefan Milius, Lawrence S. Moss, Daniel Schwencke:
Abstract GSOS Rules and a Modular Treatment of Recursive Definitions. - Daniel Leivant:
Alternating Turing machines for inductive languages.
Volume 9, Number 4, 2013
- Frédéric Lang, Radu Mateescu:
Partial Model Checking using Networks of Labelled Transition Systems and Boole an Equation Systems. - Christoph Berkholz:
Lower Bounds for Existential Pebble Games and k-Consistency Tests. - Alexis Bernadet, Stéphane Lengrand:
Non-idempotent intersection types and strong normalisation. - Lars Birkedal, Ales Bizjak, Jan Schwinghammer:
Step-Indexed Relational Reasoning for Countable Nondeterminism. - Oliver Friedmann, Markus Latte, Martin Lange:
Satisfiability Games for Branching-Time Logics. - Christophe Fouqueré, Myriam Quatrini:
Incarnation in Ludics and maximal cliques of paths. - Zi Chao Wang:
Implicit Resolution. - Marta Bílková
Relation lifting, with an application to the many-valued cover modality. - Martin Avanzini, Georg Moser:
Polynomial Path Orders. - Parosh Aziz Abdulla, Richard Mayr:
Priced Timed Petri Nets. - Antti Valmari:
All Linear-Time Congruences for Familiar Operators. - Anuj Dawar
Definability of linear equation systems over groups and rings. - Sandie Balaguer, Thomas Chatain:
Avoiding Shared Clocks in Networks of Timed Automata. - Robert Rettinger, Klaus Weihrauch:
Products of effective topological spaces and a uniformly computable Tychonoff Theorem. - Dimiter Skordev:
Approximation systems for functions in topological and in metric spaces. - Henning Kerstan, Barbara König:
Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems. - Alexander Kurz, Alessandra Palmigiano:
Epistemic Updates on Algebras. - Alexis Bès:
Expansions of MSO by cardinality relations. - Zvonko Iljazovic:
Compact manifolds with computable boundaries. - Alexander Kurz
Nominal Coalgebraic Data Types with Applications to Lambda Calculus. - Alberto Carraro
Ordered Models of the Lambda Calculus. - Martin Lang, Christof Löding:
Modeling and Verification of Infinite Systems with Resources. - Gordon D. Plotkin, Matija Pretnar
Handling Algebraic Effects. - Stefan Hetzl
Herbrand-Confluence. - Christine Gaßner:
Strong Turing Degrees for Additive BSS RAM's. - Antti Kuusisto, Jeremy Meyers, Jonni Virtema
Undecidable First-Order Theories of Affine Geometries.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-31 21:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: