default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLogical Methods in Computer Science, Volume 14
Volume 14, Number 1, 2018
- Rolf Hennicker, Michel Bidoit:
Compatibility Properties of Synchronously and Asynchronously Communicating Components. - Steffen van Bakel, Franco Barbanera, Ugo de'Liguoro:
Intersection Types for the lambda-mu Calculus. - Jörg Endrullis
, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva:
Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic. - Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in negotiations.
- Thomas Hanneforth, Andreas Maletti, Daniel Quernheim:
Pushing for weighted tree automata. - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Stefanos Kaxiras, Carl Leonardsson, Alberto Ros, Yunyun Zhu:
Mending Fences with Self-Invalidation and Self-Downgrade. - Weng Kin Ho, Jean Goubault-Larrecq, Achim Jung, Xiaoyong Xi:
The Ho-Zhao Problem. - Krzysztof Bar, Aleks Kissinger, Jamie Vicary:
Globular: an online proof assistant for higher-dimensional rewriting. - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Tuan Phong Ngo:
A Load-Buffer Semantics for Total Store Ordering. - Denisa Diaconescu, George Metcalfe, Laura Schnüriger:
A Real-Valued Modal Logic. - Dariusz Biernacki, Piotr Polesiuk:
Logical relations for coherence of effect subtyping. - Fathiyeh Faghih, Borzoo Bonakdarpour, Sébastien Tixeuil, Sandeep S. Kulkarni:
Automated Synthesis of Distributed Self-Stabilizing Protocols. - Matthew de Brecht:
A generalization of a theorem of Hurewicz for quasi-Polish spaces. - Gaëlle Fontaine, Yde Venema:
Some model theory for the modal μ-calculus: syntactic characterisations of semantic properties. - Dana Angluin, Udi Boker, Dana Fisman:
Families of DFAs as Acceptors of ω-Regular Languages. - Richard Garner, John Power:
An enriched view on the extended finitary monad-Lawvere theory correspondence. - Youssef Arbach, David S. Karcher, Kirstin Peters, Uwe Nestmann:
Dynamic Causality in Event Structures. - Jan Bessai, Tzu-Chun Chen, Andrej Dudenhefner, Boris Düdder, Ugo de'Liguoro, Jakob Rehof:
Mixin Composition Synthesis based on Intersection Types. - Harsh Beohar, Barbara König, Sebastian Küpper, Alexandra Silva, Thorsten Wißmann:
A coalgebraic treatment of conditional transition systems with upgrades. - Alexander Rabinovich:
A Proof of Stavi's Theorem. - Manfred Droste, Werner Kuich:
Weighted omega-Restricted One Counter Automata. - Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder:
Model Theory and Proof Theory of Coalgebraic Predicate Logic. - Dag Normann:
The sequential functionals of type (ι→ι)n→ι form a dcpo for all n ∈ N. - Olivier Carton, Dominique Perrin, Jean-Éric Pin:
A survey on difference hierarchies of regular languages. - Nick Benton, Martin Hofmann, Vivek Nigam:
Proof-Relevant Logical Relations for Name Generation.
Volume 14, Number 2, 2018
- Carsten Rösnick-Neugebauer:
Closed Sets and Operators thereon: Representations, Computability and Complexity. - Matteo Mio, Michal Skrzypczak, Henryk Michalewski:
Monadic Second Order Logic with Measure and Category Quantifiers.
- Alexandr Kazda:
nnn-permutability and linear Datalog implies symmetric Datalog. - Eryk Kopczynski, Tony Tan:
A note on first-order spectra with binary relations. - Harald König, Uwe Wolter:
Van Kampen Colimits and Path Uniqueness. - Zhiwei Zou, Qingguo Li, Weng Kin Ho:
Domains via approximation operators. - Christophe Fouqueré, Myriam Quatrini:
Study of Behaviours via Visitable Paths. - S. Akshay, Paul Gastin, Shankara Narayanan Krishna:
Analyzing Timed Systems Using Tree Automata. - Jirí Adámek, Stefan Milius, Henning Urbat:
A Categorical Approach to Syntactic Monoids. - Dongsheng Zhao, Luoshan Xu:
Uniqueness of directed complete posets based on Scott closed set lattices. - Arno Pauly, Willem L. Fouché, George Davie:
Weihrauch-completeness for layerwise computability. - Murdoch James Gabbay:
The language of Stratified Sets is confluent and strongly normalising. - Manuel Bodirsky, Antoine Mottet:
A Dichotomy for First-Order Reducts of Unary Structures. - Eike Neumann, Martin Pape, Thomas Streicher:
Computability in Basic Quantum Mechanics. - Willem Conradie, Salih Durhan, Guido Sciavicco:
An Integrated First-Order Theory of Points and Intervals over Linear Orders (Part I). - Davide Bresolin, Emilio Muñoz-Velasco, Guido Sciavicco:
On Sub-Propositional Fragments of Modal Logic. - Péter Battyányi, Karim Nour:
An estimation for the lengths of reduction sequences of the λμρθ-calculus. - Valentina Castiglioni, Daniel Gebler, Simone Tini:
SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes. - Panos Rondogiannis, Ioanna Symeonidou:
Extensional Semantics for Higher-Order Logic Programs with Negation.
Volume 14, Number 3, 2018
- Thomas Place, Marc Zeitoun:
The Covering Problem. - Flavien Breuvart, Giulio Manzonetto, Domenico Ruoppolo:
Relational Graph Models at Work. - David Fernández-Duque:
The intuitionistic temporal logic of dynamical systems. - Paul Blain Levy:
A Ghost at ω1. - Marco Forti:
A topological interpretation of three Leibnizian principles within the functional extensions. - Clément Aubert, Marc Bagnol:
Unification and Logarithmic Space. - Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca:
Inhabitation for Non-idempotent Intersection Types. - John Longley:
The recursion hierarchy for PCF is strict. - Dietrich Kuske, Jiamou Liu, Anastasia Moskvina:
Infinite and Bi-infinite Words with Decidable Monadic Theories. - Sergey Goncharov, Lutz Schröder, Christoph Rauch, Julian Jakob:
Unguarded Recursion on Coinductive Resumptions. - Davide Sangiorgi, Xian Xu:
Trees from Functions as Processes. - Ruggero Pagnan:
Ologisms. - Vasco Brattka:
A Galois connection between Turing jumps and limits.
- Brendan Fong, Fabio Zanasi:
Universal Constructions for (Co)Relations: categories, monoidal categories, and props.
- Natsuki Urabe, Ichiro Hasuo:
Coalgebraic Infinite Traces and Kleisli Simulations. - Robert Glück, Robin Kaarsgaard:
A categorical foundation for structured reversible flowchart languages: Soundness and adequacy. - Lorenzo Bettini, Viviana Bono, Mariangiola Dezani-Ciancaglini, Paola Giannini, Betti Venneri:
Java & Lambda: a Featherweight Story. - Benedikt Ahrens, Peter LeFanu Lumsdaine, Vladimir Voevodsky:
Categorical structures for type theory in univalent foundations. - Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Free complete Wasserstein algebras. - Paolo Baldan, Filippo Bonchi, Henning Kerstan, Barbara König:
Coalgebraic Behavioral Metrics. - Ramanathan S. Thinniyam:
Defining Recursive Predicates in Graph Orders. - Stefan Milius:
Proper Functors and Fixed Points for Finite Behaviour. - Viorica Sofronie-Stokkermans:
On Interpolation and Symbol Elimination in Theory Extensions. - Ruggero Lanotte, Massimo Merro, Simone Tini:
Equational Reasonings in Wireless Network Gossip Protocols. - Paolo Baldan, Roberto Bruni, Andrea Corradini, Fabio Gadducci, Hernán C. Melgratti, Ugo Montanari:
Event Structures for Petri nets with Persistence.
Volume 14, Number 4, 2018
- Arnon Avron, Liron Cohen:
Applicable Mathematics in a Minimal Computational Theory of Sets. - Laura Nenzi, Luca Bortolussi, Vincenzo Ciancia, Michele Loreti, Mieke Massink:
Qualitative and Quantitative Monitoring of Spatio-Temporal Properties with SSTL.
- Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere:
Local Redundancy in SAT: Generalizations of Blocked Clauses. - Vasco Brattka, Arno Pauly:
On the algebraic structure of Weihrauch degrees.
- Moses Ganardi, Stefan Göller, Markus Lohrey:
The Complexity of Bisimulation and Simulation on Finite Systems. - Shin-ya Katsumata, Tetsuya Sato, Tarmo Uustalu:
Codensity Lifting of Monads and its Dual. - Bertram Felgenhauer:
Deciding Confluence and Normal Form Properties of Ground Term Rewrite Systems Efficiently. - Davide Rinaldi, Daniel Misselbeck-Wessel:
Extension by Conservation. Sikorski's Theorem. - John Fearnley, Rahul Savani:
The Complexity of All-switches Strategy Improvement. - Nadia Creignou, Reinhard Pichler, Stefan Woltran:
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? - Simon Docherty, David J. Pym:
Intuitionistic Layered Graph Logic: Semantics and Proof Theory. - Kshitij Bansal, Clark W. Barrett, Andrew Reynolds, Cesare Tinelli:
Reasoning with Finite Sets and Cardinality Constraints in SMT. - Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. - Dimitris Mostrous, Vasco T. Vasconcelos:
Affine Sessions. - Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare:
A Complete Quantitative Deduction System for the Bisimilarity Distance on Markov Chains. - Thomas Place:
Separating regular languages with two quantifier alternations. - Ana Sokolova, Harald Woracek:
Termination in Convex Sets of Distributions. - Revantha Ramanayake:
Inducing syntactic cut-elimination for indexed nested sequents. - Mikkel Hansen, Kim Guldstrand Larsen, Radu Mardare, Mathias Ruggaard Pedersen:
Reasoning About Bounds in Weighted Transition Systems. - Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell:
Model Checking Flat Freeze LTL on One-Counter Automata. - Daniel de Carvalho:
Taylor expansion in linear logic is invertible. - Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis:
One-way definability of two-way word transducers. - Ian Orton, Andrew M. Pitts:
Axioms for Modelling Cubical Type Theory in a Topos. - Hans de Nivelle:
Subsumption Algorithms for Three-Valued Geometric Resolution.
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 2025-03-22 00:12 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:
