![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Logical Methods in Computer Science, Volume 10
Volume 10, Number 1, 2014
- Manuel A. Martins
, Alexandre Madeira
, Luís Soares Barbosa
:
The role of logical interpretations in program development. - Achim Blumensath, Bruno Courcelle:
Monadic second-order definable graph orderings. - René David, Karim Nour:
About the range property for H. - Denis Kuperberg:
Linear Temporal Logic for Regular Cost Functions. - Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michaël Rusinowitch:
Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining. - Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick, Martin Ziegler:
Computational Complexity of Smooth Differential Equations. - Stefan Göller, Markus Lohrey:
The First-Order Theory of Ground Tree Rewrite Graphs. - Michal Skrzypczak:
Separation Property for wB- and wS-regular Languages. - Stefano Berardi, Ugo de'Liguoro:
Knowledge Spaces and the Completeness of Learning Strategies. - Udi Boker, Thomas A. Henzinger:
Exact and Approximate Determinization of Discounted-Sum Automata. - Pierre Hyvernat:
The Size-Change Termination Principle for Constructor Based Languages. - Swen Jacobs
, Roderick Bloem
:
Parameterized Synthesis. - Tomás Brázdil, Václav Brozek, Krishnendu Chatterjee
, Vojtech Forejt, Antonín Kucera
:
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. - Alexander Rabinovich:
A Proof of Kamp's theorem. - Nerio Borges, Blai Bonet:
Universal First-Order Logic is Superfluous for NL, P, NP and coNP. - Marco Bernardo
, Rocco De Nicola
, Michele Loreti
:
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes. - Rasmus Ejlers Møgelberg, Sam Staton:
Linear usage of state. - Michael Lampis:
Model Checking Lower Bounds for Simple Graphs. - Harald Zankl, Martin Korp:
Modular Complexity Analysis for Term Rewriting.
Volume 10, Number 2, 2014
- Samuel Mimram
:
Towards 3-Dimensional Rewriting Theory. - Pierre Hyvernat:
A Linear Category of Polynomial Functors (extensional part). - Vince Bárány, Georg Gottlob
, Martin Otto:
Querying the Guarded Fragment. - Jörg Endrullis
, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky:
Discriminating Lambda-Terms Using Clocked Boehm Trees. - Ozan Kahramanogullari:
Interaction and Depth against Nondeterminism in Proof Search. - Patrick Bahr
:
Partial Order Infinitary Term Rewriting. - Jörg Endrullis
, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom
:
Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples. - Konrad Burnik
, Zvonko Iljazovic:
Computability of 1-manifolds. - Douglas Suth Bridges:
Locating Ax, where A is a subspace of B(H). - Everardo Bárcenas
, Jesús Lavalle:
Global Numerical Constraints on Trees. - Myrto Arapinis, Stéphanie Delaune, Steve Kremer:
Dynamic Tags for Security Protocols. - Ulrike Brandt, Hermann K.-G. Walter:
Unsolvability Cores in Classification Problems. - Chunlai Zhou:
Probability Logic for Harsanyi Type Spaces. - Nathanaël Fijalkow
, Martin Zimmermann
:
Parity and Streett Games with Costs. - Adrian Francalanza
, Edsko de Vries, Matthew Hennessy:
Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency. - Samuel R. Buss, Leszek Aleksander Kolodziejczyk:
Small Stone in Pool. - Sumit Nain, Yoad Lustig, Moshe Y. Vardi:
Synthesis from Probabilistic Components.
Volume 10, Number 3, 2014
- Hajime Ishihara:
Classical propositional logic and decidability of variables in intuitionistic propositional logic. - Achim Blumensath, Martin Otto, Mark Weyer:
Decidability Results for the Boundedness Problem. - Johannes Ebbing, Juha Kontinen
, Julian-Steffen Müller, Heribert Vollmer
:
A Fragment of Dependence Logic Capturing Polynomial Time. - Mikolaj Bojanczyk, Bartek Klin
, Slawomir Lasota
:
Automata theory in nominal sets. - Eric Allender
, Harry Buhrman, Luke Friedman, Bruno Loff
:
Reductions to the set of random strings: The resource-bounded case. - A. C. Cem Say
, Abuzer Yakaryilmaz
:
Finite state verifiers with constant randomness. - Klaus Weihrauch, Nazanin Roshandel Tavana
:
Representations of measurable sets in computable measure theory. - Marius Bozga, Radu Iosif, Filip Konecný:
Deciding Conditional Termination. - Jan Foniok:
On Ramsey properties of classes with forbidden trees. - Thomas Given-Wilson
, Daniele Gorla
, Barry Jay:
A Concurrent Pattern Calculus. - Benoît Delahaye
, Uli Fahrenberg, Kim G. Larsen
, Axel Legay:
Refinement and Difference for Probabilistic Automata. - Olivier Finkel:
Ambiguity of omega-Languages of Turing Machines. - Klaus Weihrauch, Tahereh Jafarikhah:
Computable Jordan Decomposition of Linear Continuous Functionals on $C[0;1]$. - Danel Ahman
, James Chapman
, Tarmo Uustalu
:
When is a container a comonad? - Mingzhong Cai, Rodney G. Downey, Rachel Epstein, Steffen Lempp, Joseph S. Miller
:
Random strings and tt-degrees of Turing complete C.E. sets. - Gianluigi Bellin:
Categorical Proof Theory of Co-Intuitionistic Linear Logic. - Dennis Guck, Hassan Hatefi, Holger Hermanns
, Joost-Pieter Katoen
, Mark Timmer:
Analysis of Timed and Long-Run Objectives for Markov Automata. - Ingo Battenfeld, Klaus Keimel, Thomas Streicher:
Observationally-induced algebras in Domain Theory. - Jirí Adámek, Mahdieh Haddadi, Stefan Milius:
Corecursive Algebras, Corecursive Monads and Bloom Monads. - Willem L. Fouché
, Safari Mukeru, George Davie:
Fourier spectra of measures associated with algorithmically random Brownian motion. - Matija Pretnar
:
Inferring Algebraic Effects. - Friedrich Neurauter, Aart Middeldorp
:
Polynomial Interpretations over the Natural, Rational and Real Numbers Revisited. - Karol Pak
:
Improving legibility of natural deduction proofs is not trivial. - Thomas Place, Lorijn van Rooijen, Marc Zeitoun
:
Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages.
Volume 10, Number 4, 2014
- Tomer Kotek, Johann A. Makowsky:
Connection Matrices and the Definability of Graph Parameters. - Tom Hirschowitz
:
Full abstraction for fair testing in CCS (expanded version). - Yuguo He:
On the strictness of the quantifier structure hierarchy in first-order logic. - Christoph Haase
, Sylvain Schmitz
, Philippe Schnoebelen:
The Power of Priority Channel Systems. - Frank S. de Boer, Mohammad Mahdi Jaghoori, Cosimo Laneve
, Gianluigi Zavattaro:
Decidability Problems for Actor Systems. - Nathalie Bertrand
, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier
, Marcus Größer, Marcin Jurdzinski
:
Stochastic Timed Automata. - Peter Hertling, Christoph Spandl:
Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time. - Ali Assaf, Alejandro Díaz-Caro
, Simon Perdrix, Christine Tasson
, Benoît Valiron
:
Call-by-value, call-by-name and the vectorial behaviour of the algebraic λ-calculus. - Andrej Bauer, Matija Pretnar
:
An Effect System for Algebraic Effects and Handlers. - Ulrich Schöpp:
On the Relation of Interaction Semantics to Continuations and Defunctionalization. - Andrea Turrini, Holger Hermanns
:
Cost Preserving Bisimulations for Probabilistic Automata. - Bjørn Kjos-Hanssen, Paul Kim Long V. Nguyen, Jason M. Rute:
Algorithmic randomness for Doob's martingale convergence theorem in continuous time. - Ming-Hsien Tsai, Seth Fogarty, Moshe Y. Vardi, Yih-Kuen Tsay
:
State of Büchi Complementation. - Hubie Chen:
Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction. - Sam Buss
, Douglas Cenzer, Jeffrey B. Remmel:
Sub-computable Boundedness Randomness. - Alexander P. Kreuzer:
Bounded variation and the strength of Helly's selection theorem. - François Laroussinie, Nicolas Markey
:
Quantified CTL: Expressiveness and Complexity. - Daniel Leivant:
Global semantic typing for inductive and coinductive computing. - Benedikt Bollig, Peter Habermehl, Martin Leucker
, Benjamin Monmege
:
A Robust Class of Data Languages and an Application to Learning. - Dimitrios Kouzapas, Nobuko Yoshida
:
Globally Governed Session Semantics. - Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg:
Stochastic Parity Games on Lossy Channel Systems.
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.