default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLogical Methods in Computer Science, Volume 11
Volume 11, Number 1, 2015
- Keiko Nakata, Tarmo Uustalu
:
A Hoare logic for the coinductive trace-based big-step semantics of While. - Afshin Amighi, Christian Haack, Marieke Huisman, Clément Hurlin:
Permission-Based Separation Logic for Multithreaded Java Programs. - Thorsten Altenkirch, James Chapman, Tarmo Uustalu:
Monads need not be endofunctors. - Anupam Das:
On the relative proof complexity of deep inference via atomic flows. - Martin Berger, Laurence Tratt:
Program Logics for Homogeneous Generative Run-Time Meta-Programming. - Ulrich Berger, Andrew Lawrence, Fredrik Nordvall Forsberg, Monika Seisenberger:
Extracting verified decision procedures: DPLL and Resolution. - Manfred Schmidt-Schauß, David Sabel, Elena Machkasova:
Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq. - Dag Normann:
The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems. - Eryk Kopczynski:
Complexity of Problems of Commutative Grammars. - Kosta Dosen, Zoran Petric:
Weak Cat-Operads. - Robert Kenny:
Effective zero-dimensionality for computable metric spaces. - Matthew S. Bauer:
The Computational Complexity of Propositional Cirquent Calculus. - Neil Ghani, Lorenzo Malatesta, Fredrik Nordvall Forsberg:
Positive Inductive-Recursive Definitions. - Filippo Bonchi, Fabio Zanasi:
Bialgebraic Semantics for Logic Programming. - Ralf Wimmer, Nils Jansen, Andreas Vorpahl, Erika Ábrahám, Joost-Pieter Katoen, Bernd Becker:
High-level Counterexamples for Probabilistic Automata. - Jan Leike, Matthias Heizmann:
Ranking Templates for Linear Loops. - Hideki Tsuiki, Yasuyuki Tsukamoyo:
Domain Representations Induced by Dyadic Subbases. - Andrea Cerone, Matthew Hennessy, Massimo Merro:
Modelling MAC-Layer Communications in Wireless Systems. - Jakub Gajarský, Petr Hlinený:
Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences. - Soham Chakraborty, Thomas A. Henzinger, Ali Sezgin, Viktor Vafeiadis:
Aspect-oriented linearizability proofs.
Volume 11, Number 2, 2015
- Giovanni Bernardi, Matthew Hennessy:
Mutually Testing Processes. - Petr Jancar, Prateek Karandikar, Philippe Schnoebelen:
On Reachability for Unidirectional Channel Systems Extended with Regular Tests. - Luca Bortolussi, Guido Sanguinetti:
Learning and Designing Stochastic Processes from Logical Constraints. - Alessandro Facchini, Yoichi Hirai, Maarten Marx, Evgeny Sherkhonov:
Containment for Conditional Tree Patterns. - Robert W. J. Furber, Bart Jacobs:
From Kleisli Categories to Commutative C*-algebras: Probabilistic Gelfand Duality. - Pierre Clairambault:
Bounding linear head reduction and visible interaction through skeletons. - Sylvain Salvati, Igor Walukiewicz:
Using models to model-check recursive schemes. - Ján Pich:
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic. - Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels:
Pure Nash Equilibria in Concurrent Deterministic Games. - Peter Selinger:
Generators and relations for n-qubit Clifford operators. - Andrew M. Marshall, Catherine Meadows, Paliath Narendran:
On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry. - Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Youssouf Oualhadj:
Deciding the value 1 problem for probabilistic leaktight automata. - Vincent Danos, Russ Harmer, Ricardo Honorato-Zimmer:
Thermodynamic graph-rewriting. - Tomasz Brengos:
Weak bisimulation for coalgebras over order enriched monads. - Bojan Basic:
On absorption in semigroups and n-ary semigroups. - Klaus Dräger, Vojtech Forejt, Marta Z. Kwiatkowska, David Parker, Mateusz Ujma:
Permissive Controller Synthesis for Probabilistic Systems.
Volume 11, Number 3, 2015
- Giorgi Japaridze:
On the system CL12 of computability logic. - Marcello M. Bonsangue, Helle Hvid Hansen, Alexander Kurz, Jurriaan Rot:
Presenting Distributive Laws. - Ionut Tutu, José Luiz Fiadeiro:
Service-Oriented Logic Programming. - Sven Linker, Martin Hilscher:
Proof Theory of a Multi-Lane Spatial Logic. - Thomas Place, Luc Segoufin:
Deciding definability in FO2(<h, <v) on trees. - Andrea Schalk, Hugh P. Steele:
Constructing Fully Complete Models of Multiplicative Linear Logic. - Ryuta Arisaka, Anupam Das, Lutz Straßburger:
On Nested Sequents for Constructive Modal Logics. - Sadegh Esmaeil Zadeh Soudjani, Alessandro Abate:
Quantitative Approximation of the Probability Distribution of a Markov Process by Formal Abstractions. - Hubie Chen, Florent R. Madelaine, Barnaby Martin:
Quantified Constraints and Containment Problems. - Thomas Colcombet, Clemens Ley, Gabriele Puppis:
Logics with rigidly guarded data tests. - George Chatzieleftheriou, Borzoo Bonakdarpour, Panagiotis Katsaros, Scott A. Smolka:
Abstract Model Repair. - Bernd Finkbeiner, Leander Tentrup:
Detecting Unrealizability of Distributed Fault-tolerant Systems. - Irini-Eleftheria Mens, Oded Maler:
Learning Regular Languages over Large Ordered Alphabets. - Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Quantitative Languages Defined by Functional Automata. - Souha Ben Rayana, Lacramioara Astefanoaei, Saddek Bensalem, Marius Bozga, Jacques Combaz:
Compositional Verification for Timed Systems Based on Automatic Invariant Generation. - C. T. Chong, Gordon Hoi, Frank Stephan, Daniel Turetsky:
Partial functions and domination. - Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek:
On the Axiomatizability of Impossible Futures. - Adriana Balan, Alexander Kurz, Jirí Velebil:
Positive fragments of coalgebraic logics. - Frédéric Vogels, Bart Jacobs, Frank Piessens:
Featherweight VeriFast. - Karin Quaas:
Verification for Timed Automata extended with Discrete Data Structure. - Klaus Keimel:
Weak upper topologies and duality for cones. - Noam Zeilberger, Alain Giorgetti:
A correspondence between rooted planar maps and normal planar lambda terms. - Leonardo Manuel Cabrer, George Metcalfe:
Exact Unification and Admissibility. - Bart Jacobs:
New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic. - Mayer Goldberg:
Ellipses and Lambda Definability.
Volume 11, Number 4, 2015
- Pablo Barceló, Gaëlle Fontaine, Anthony Widjaja Lin:
Expressive Path Queries on Graph with Data. - Nicolas Bedon:
Logic and Branching Automata. - Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
The computability path ordering. - Marco Bozzano, Alessandro Cimatti, Marco Gario, Stefano Tonetta:
Formal Design of Asynchronous Fault Detection and Identification Components using Temporal Epistemic Logic. - Michele Boreale, Francesca Pampaloni:
Quantitative information flow under generic leakage functions and adaptive adversaries. - Stéphane Le Roux, Arno Pauly:
Closed choice: Cardinality vs convex dimension. - Angelo Montanari, Gabriele Puppis, Pietro Sala:
A decidable weakening of Compass Logic based on cone-shaped cardinal directions. - Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak:
Faster Existential FO Model Checking on Posets. - Jesús Domínguez, Maribel Fernández:
From nominal to higher-order rewriting and back again. - Pascal Michel:
Problems in number theory from busy beaver competition. - Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska:
FO Model Checking of Interval Graphs. - Simon J. Gay, Nils Gesbert, António Ravara, Vasco Thudichum Vasconcelos:
Modular Session Types for Objects. - Luca Padovani:
Type Reconstruction for the Linear π-Calculus with Composite Regular Types. - Nadime Francis, Luc Segoufin, Cristina Sirangelo:
Datalog Rewritings of Regular Path Queries using Views. - Frank Drewes, Jérôme Leroux:
Structurally Cyclic Petri Nets. - Diego Latella, Mieke Massink, Erik P. de Vink:
Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically. - Frederik Harwath, Lucas Heimberg, Nicole Schweikardt:
Preservation and decomposition theorems for bounded degree structures. - Jakub Bulin, Dejan Delic, Marcel Jackson, Todd Niven:
A finer reduction of constraint problems to digraphs. - Chen Chen, Limin Jia, Hao Xu, Cheng Luo, Wenchao Zhou, Boon Thau Loo:
A Program Logic for Verifying Secure Routing Protocols. - Eike Neumann:
Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees. - Ferruccio Damiani, Mirko Viroli:
Type-based Self-stabilisation for Computational Fields. - Valentin Blot:
Typed realizability for first-order classical analysis.
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-10-31 20:04 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:
