default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLogical Methods in Computer Science, Volume 13
Volume 13, Number 1, 2017
- Danny Rorabaugh, Claude Tardif, David L. Wehlau:
Logical compactness and constraint satisfaction problems. - Klaus Keimel, Gordon D. Plotkin:
Mixed powerdomains for probability and nondeterminism. - Helle Hvid Hansen
, Clemens Kupke, Jan Rutten:
Stream Differential Equations: Specification Formats and Solution Methods. - Jan Krajícek, Igor C. Oliveira:
Unprovability of circuit upper bounds in Cook's theory PV. - Jan Krajícek:
A feasible interpolation for random resolution. - Cynthia Kop, Aart Middeldorp, Thomas Sternagel:
Complexity of Conditional Term Rewriting. - Nicola Botta, Patrik Jansson, Cezar Ionescu, David R. Christiansen, Edwin C. Brady:
Sequential decision problems, dependent types and generic solutions. - Pablo Arrighi, Gilles Dowek:
Lineal: A linear-algebraic Lambda-calculus. - Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi:
Reasoning about Strategies: on the Satisfiability Problem. - Ximeng Li, Xi Wu, Alberto Lluch-Lafuente, Flemming Nielson, Hanne Riis Nielson:
A Coordination Language for Databases. - David Sabel, Hans Zantema:
Termination of Cycle Rewriting by Transformation and Matrix Interpretation. - Thomas Genet, Yann Salmon:
Reachability Analysis of Innermost Rewriting. - Alberto Lluch-Lafuente, Michele Loreti, Ugo Montanari:
Asynchronous Distributed Execution Of Fixpoint-Based Computational Fields. - Sylvain Salvati, Igor Walukiewicz:
Typing weak MSOL properties. - Nicolai Kraus, Martín Escardó, Thierry Coquand, Thorsten Altenkirch:
Notions of Anonymous Existence in Martin-Löf Type Theory. - Stefan Kiefer, Ines Marusic, James Worrell:
Minimisation of Multiplicity Tree Automata. - Rumyana Neykova, Nobuko Yoshida:
Multiparty Session Actors. - Yasuyuki Tsukamoto:
Existence of strongly proper dyadic subbases.
Volume 13, Number 2, 2017
- Mila Dalla Preda, Maurizio Gabbrielli, Saverio Giallorenzo, Ivan Lanese, Jacopo Mauro:
Dynamic Choreographies: Theory And Implementation. - Claude Sureson:
Subcomputable Schnorr Randomness. - Hans-E. Porst:
Hopf and Lie algebras in semi-additive Varieties.
- Julian Nagele, Bertram Felgenhauer, Harald Zankl:
Certifying Confluence Proofs via Relative Termination and Rule Labeling. - Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl:
Inter-procedural Two-Variable Herbrand Equalities. - Bart Jacobs:
A Recipe for State-and-Effect Triangles. - Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Feasible Interpolation for QBF Resolution Calculi. - David Baelde, Stéphanie Delaune, Lucca Hirschi:
A Reduced Semantics for Deciding Trace Equivalence. - Paula Severi, Luca Padovani, Emilio Tuosto, Mariangiola Dezani-Ciancaglini:
On Sessions and Infinite Data. - Robin Hirsch, Brett McLean:
Disjoint-union partial algebras. - Michael J. Lieberman, Jirí Rosický:
Hanf numbers via accessible images. - Tzu-Chun Chen, Mariangiola Dezani-Ciancaglini, Alceste Scalas, Nobuko Yoshida:
On the Preciseness of Subtyping in Session Types. - Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare:
On-the-Fly Computation of Bisimilarity Distances. - Sebastian Enqvist, Fatemeh Seifan, Yde Venema:
An expressive completeness theorem for coalgebraic modal mu-calculi. - Krishnendu Chatterjee, Zuzana Kretínská, Jan Kretínský:
Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. - Sooraj Bhat, Johannes Borgström, Andrew D. Gordon, Claudio V. Russo:
Deriving Probability Density Functions from Probabilistic Functional Programs.
Volume 13, Number 3, 2017
- Elie M. Adam, Munther A. Dahleh, Asuman E. Ozdaglar:
Towards an Algebra for Cascade Effects. - Furio Honsell, Luigi Liquori, Petar Maksimovic, Ivan Scagnetto:
LLF𝒫: a logical framework for modeling external evidence, side conditions, and proof irrelevance using monads. - Ivan Georgiev:
Characterization theorem for the conditionally computable real functions. - Dirk Hofmann, Lurdes Sousa:
Aspects of algebraic Algebras. - Chiara Bodei, Pierpaolo Degano, Gian-Luigi Ferrari, Letterio Galletta:
Tracing where IoT data are collected and aggregated. - Olivier Laurent:
Focusing in Orthologic. - Bruno Courcelle:
Algebraic and logical descriptions of generalized trees. - Cynthia Kop, Jakob Grue Simonsen:
Complexity Hierarchies and Higher-order Cons-free Term Rewriting. - Andrej Dudenhefner, Moritz Martens, Jakob Rehof:
The Algebraic Intersection Type Unification Problem. - Thierry Coquand, Bassel Mannaa:
The Independence of Markov's Principle in Type Theory. - Yusuke Kawamoto, Konstantinos Chatzikokolakis, Catuscia Palamidessi:
On the Compositionality of Quantitative Information Flow. - Hongliang Lai, Walter Tholen:
A Note on the Topologicity of Quantale-Valued Topological Spaces. - Karim Nour, Mohamad Ziadeh:
A revised completeness result for the simply typed λμ-calculus using realizability semantics. - Marino Gran, Diana Rodelo, Idriss Tchoffo Nguefeu:
Some remarks on connectors and groupoids in Goursat categories.
- Franco Barbanera, Ugo de'Liguoro:
Retractability, games and orchestrators for session contracts. - Oleg V. Kudinov, Victor L. Selivanov:
First Order Theories of Some Lattices of Open Sets. - Bart Jacobs:
Hyper Normalisation and Conditioning for Discrete Probability Distributions. - Nelson Martins-Ferreira, Andrea Montoli, Manuela Sobral:
On some categorical-algebraic conditions in S-protomodular categories. - Shiguang Feng, Markus Lohrey, Karin Quaas:
Path Checking for MTL and TPTL over Data Words. - Natsuki Urabe, Ichiro Hasuo:
Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective. - Florian Steinberg:
Complexity theory for spaces of integrable functions. - Tatsuji Kawai:
Localic completion of uniform spaces. - Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop:
Edit Distance for Pushdown Automata. - Michael Blondin, Alain Finkel, Pierre McKenzie:
Well Behaved Transition Systems. - Francesco Ranzato:
A new characterization of complete Heyting and co-Heyting algebras. - Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer:
Improved Algorithms for Parity and Streett objectives. - Andrés Aristizábal, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation. - Dmitriy Traytel:
Formal Languages, Formally and Coinductively. - Alexander Weinert, Martin Zimmermann:
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs. - Josef Berger, Helmut Schwichtenberg:
A bound for Dickson's lemma. - Pierre-Louis Curien, Samuel Mimram:
Coherent Presentations of Monoidal Categories. - Maria Manuel Clementino, Ignacio López Franco:
Lax orthogonal factorisations in monad-quantale-enriched categories. - Paul Brunet, Damien Pous:
Petri Automata. - Péter Battyányi, Karim Nour:
Strong normalization of lambda-Sym-Prop- and lambda-bar-mu-mu-tilde-star- calculi. - Simon Castellan, Pierre Clairambault, Silvain Rideau, Glynn Winskel:
Games and Strategies as Event Structures.
Volume 13, Number 4, 2017
- Thorsten Altenkirch, Ambrus Kaposi:
Normalisation by Evaluation for Type Theory, in Type Theory. - Dominique Devriese, Marco Patrignani, Frank Piessens, Steven Keuchel:
Modular, Fully-abstract Compilation by Approximate Back-translation. - Mikolaj Bojanczyk, Thomas Colcombet:
Boundedness in languages of infinite words. - Georgios Kourtis, Ian Pratt-Hartmann:
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting. - Diego Figueira, Luc Segoufin:
Bottom-up automata on data trees and vertical XPath. - Anuj Dawar, Eryk Kopczynski:
Bounded degree and planar spectra. - Carsten Lutz, Frank Wolter:
The Data Complexity of Description Logic Ontologies. - Makoto Hamana:
Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories. - Clovis Eberhart, Tom Hirschowitz, Thomas Seiller:
An intensionally fully-abstract sheaf model for π (expanded version). - Stefan Hetzl, Tin Lok Wong:
Some observations on the logical foundations of inductive theorem proving.
- Yuxi Fu:
The Universal Process. - Ludovic Henrio, Justine Rochas:
Multiactive objects and their applications. - Svetlana Selivanova, Victor L. Selivanov:
Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs. - Karine Altisen, Pierre Corbineau, Stéphane Devismes:
A Framework for Certified Self-Stabilization. - David de Frutos-Escrig, Jeroen J. A. Keiren, Tim A. C. Willemse:
Games for Bisimulations and Abstraction. - Horatiu Cirstea, Sergueï Lenglet, Pierre-Etienne Moreau:
Faithful (meta-)encodings of programmable strategies into term rewriting systems. - Petr Jancar:
Branching Bisimilarity of Normed BPA Processes as a Rational Monoid. - Jean Goubault-Larrecq, Kok Min Ng:
A Few Notes on Formal Balls. - Bram Westerbaan, Bas Westerbaan, Rutger Kuyper, Carst Tankink, Remy Viehoff, Henk Barendregt:
Statman's Hierarchy Theorem. - Marc Bagnol:
Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees. - Giuseppe Longo, Maël Montévil:
From Logic to Biology via Physics: a survey. - Simon Castellan, Pierre Clairambault, Peter Dybjer:
Undecidability of Equality in the Free Locally Cartesian Closed Category (Extended version). - Sam Sanders:
Grilliot's trick in Nonstandard Analysis. - Thomas Streicher:
A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus. - Massimo Bartoletti, Tiziana Cimoli, Maurizio Murgia:
Timed Session Types. - Martin C. Cooper, Stanislav Zivný:
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns. - Dimitrios Kouzapas, Anna Philippou:
Privacy by typing in the π-calculus. - Grigore Rosu:
Matching Logic. - Giulio Guerrieri, Luca Paolini, Simona Ronchi Della Rocca:
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus. - Margarita V. Korovina, Oleg V. Kudinov:
The Rice-Shapiro theorem in Computable Topology.
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-02-19 00:47 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:
