default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLogical Methods in Computer Science, Volume 17
Volume 17, Number 1, January 2021
- Mario Bravetti:
Axiomatizing Maximal Progress and Discrete Time. - Siddharth Bhaskar, Alex Kruckman:
Tameness in least fixed-point logic and McColm's conjecture. - Daniel Carranza, Jonathan Chang, Chris Kapulkin, Ryan Sandford:
2-adjoint equivalences in homotopy type theory. - Bin Wang, Jun Shen, Shutao Zhang, Zhizheng Zhang:
On the Strong Equivalences for LPMLN Programs. - Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk:
Definable decompositions for graphs of bounded linear cliquewidth. - Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber:
Modal Logics for Nominal Transition Systems. - Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca:
Solvability = Typability + Inhabitation. - Maurice Laveaux, Jan Friso Groote, Tim A. C. Willemse:
Correct and Efficient Antichain Algorithms for Refinement Checking. - Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, Franck van Breugel:
Computing Probabilistic Bisimilarity Distances for Probabilistic Automata. - Milad Aghajohari, Guy Avni, Thomas A. Henzinger:
Determinacy in Discrete-Bidding Infinite-Duration Games. - Bruno Courcelle:
Axiomatization of betweenness in order-theoretic trees. - Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea:
Robustness Against Transactional Causal Consistency. - Brijesh Dongol, Ian J. Hayes, Georg Struth:
Convolution Algebras: Relational Convolution, Generalised Modalities and Incidence Algebras. - Bas Luttik, Fei Yang:
The π-Calculus is Behaviourally Complete and Orbit-Finitely Executable. - Cristian Ene, Laurent Mounier, Marie-Laure Potet:
Output-sensitive Information flow analysis. - Assia Mahboubi, Thomas Sibut-Pinote:
A Formal Proof of the Irrationality of ζ(3). - Jan A. Bergstra, Alban Ponse:
Datatype defining rewrite systems for naturals and integers. - Ryu Hasegawa:
Complete Call-by-Value Calculi of Control Operators II: Strong Termination. - Mario Bravetti, Marco Carbone, Julien Lange, Nobuko Yoshida, Gianluigi Zavattaro:
A Sound Algorithm for Asynchronous Session Subtyping and its Implementation. - Dirk Pattinson, Mina Mohammadian:
Constructive Domains with Classical Witnesses. - Frederik Meyer Bønneland, Peter Gjøl Jensen, Kim Guldstrand Larsen, Marco Muñiz, Jirí Srba:
Stubborn Set Reduction for Two-Player Reachability Games. - Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier:
Synthesis of Data Word Transducers. - Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Reconfiguration and Message Losses in Parameterized Broadcast Networks.
Volume 17, Number 2, 2021
- Alexander Bentkamp, Jasmin Blanchette, Simon Cruanes, Uwe Waldmann:
Superposition for Lambda-Free Higher-Order Logic. - Tao Gu, Fabio Zanasi:
Coalgebraic Semantics for Probabilistic Logic Programming. - Jan Pachl, Pedro Sánchez Terraf:
Semipullbacks of labelled Markov processes. - Iosif Petrakis:
Direct spectra of Bishop spaces and their limits. - Uli Fahrenberg, Christian Johansen, Christopher Trotter, Krzysztof Ziemianski:
Sculptures in Concurrency. - Achim Blumensath:
Algebraic Language Theory for Eilenberg-Moore Algebras. - Helmut Schwichtenberg, Franziskus Wiesnet:
Logic for exact real arithmetic. - Sam Buss, Neil Thapen:
DRAT and Propagation Redundancy Proofs Without New Variables. - Rob van Glabbeek:
Failure Trace Semantics for a Process Algebra with Time-outs. - Étienne André, Didier Lime, Mathias Ramparison:
Parametric updates in parametric timed automata. - Martijn Hendriks, Marc Geilen, Kees Goossens, Rob de Jong, Twan Basten:
Interface Modeling for Quality and Resource Management. - Maria Emilia Maietti, Samuele Maschio, Michael Rathjen:
A realizability semantics for inductive formal topologies, Church's Thesis and Axiom of Choice. - Tatsuji Kawai:
Predicative theories of continuous lattices. - Jirí Adámek:
Algebraic cocompleteness and finitary functors. - John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani:
Reachability Switching Games. - Niccolò Veltri, Niels van der Weide:
Constructing Higher Inductive Types as Groupoid Quotients. - Bert Lindenhovius, Michael W. Mislove, Vladimir Zamdzhiev:
LNL-FPC: The Linear/Non-linear Fixpoint Calculus. - Tomás Masopust, Markus Krötzsch:
Partially Ordered Automata and Piecewise Testability. - Daisuke Kimura, Makoto Tatsuta:
Decidability for Entailments of Symbolic Heaps with Arrays. - Florian Steinberg, Laurent Théry, Holger Thies:
Computable analysis and notions of continuity in Coq. - Benedikt Ahrens, André Hirschowitz, Ambroise Lafont, Marco Maggesi:
Presentable signatures and initial semantics. - Alexis Bès, Christian Choffrut:
Theories of real addition with and without a predicate for integers. - Jörg Endrullis, Jan Willem Klop, Roy Overbeek:
Star Games and Hydras. - Ross Horne, Sjouke Mauw:
Discovering ePassport Vulnerabilities using Bisimilarity. 24 - Fer-Jan de Vries:
Encoding many-valued logic in λ-calculus. 25
Volume 17, Number 3, 2021
- Michael Blondin
, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin:
Affine Extensions of Integer Vector Addition Systems with States. - Ki Yung Ahn, Ross Horne, Alwen Tiu:
A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic. - Michael Blondin, Mikhail A. Raskin:
The Complexity of Reachability in Affine Vector Addition Systems with States. - Philipp Hieronymi, Danny Nguyen, Igor Pak:
Presburger Arithmetic with algebraic scalar multiplications. - Carlos Areces, Raul Fervari:
Axiomatizing Hybrid XPath with Data. - Rod Downey, Alexander G. Melnikov, Keng Meng Ng:
Foundations of Online Structure Theory II: The Operator Approach. - Agnishom Chattopadhyay, Filip Mazowiecki, Anca Muscholl, Cristian Riveros:
Pumping lemmas for weighted automata. - Thomas Neele, Antti Valmari, Tim A. C. Willemse:
A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction. - Dan Frumin, Robbert Krebbers, Lars Birkedal:
ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity. - Filippo Bonchi, Alexandra Silva, Ana Sokolova:
Distribution Bisimilarity via the Power of Convex Algebras. - Daniel Gratzer, G. A. Kavvos, Andreas Nuyts, Lars Birkedal:
Multimodal Dependent Type Theory. - Victor Marsault:
On p/q-recognisable sets. - Pierre Hyvernat:
Representing Continuous Functions between Greatest Fixed Points of Indexed Containers. - Matthias Hoelzel, Richard Wilke:
On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics. - Herman Geuvers, Bart Jacobs:
Relating Apartness and Bisimulation. - Eike Neumann:
Decision problems for linear recurrences involving arbitrary real numbers. - Stéphane Demri, Étienne Lozes, Alessio Mansutti:
A Complete Axiomatisation for Quantifier-Free Separation Logic. - Alexander Rabinovich, Doron Tiferet:
Ambiguity Hierarchy of Regular Infinite Tree Languages. - Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi:
Equivalence checking for weak bi-Kleene algebra. - Julien Grange:
Successor-Invariant First-Order Logic on Classes of Bounded Degree. - Jean-Louis Krivine:
A program for the full axiom of choice. - Ester Livshits, Leopoldo E. Bertossi, Benny Kimelfeld, Moshe Sebag:
The Shapley Value of Tuples in Query Answering. - Mario Alvarez-Picallo, Jean-Simon Pacaud Lemay:
Cartesian Difference Categories. - Thomas Place, Marc Zeitoun:
Separation for dot-depth two. - Jean-Marie Madiot, Damien Pous, Davide Sangiorgi:
Modular coinduction up-to for higher-order languages via first-order transition systems. - Adam Shimi, Aurélie Hurault, Philippe Quéinnec:
Characterization and Derivation of Heard-Of Predicates for Asynchronous Message-Passing Models. - Jakub Michaliszyn, Jan Otop, Piotr Wieczorek:
Modular Path Queries with Arithmetic. - Jacopo Emmenegger:
W-types in setoids.
Volume 17, Number 4, 2021
- Claudio Antares Mezzina, Jorge A. Pérez:
Causal Consistency for Reversible Multiparty Protocols. - Francesco Dagnino:
Foundations of regular coinduction. - Mircea-Dan Hernest, Trifon Trifonov:
Modal Functional (Dialectica) Interpretation. - Anthony W. Lin, Rupak Majumdar:
Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility. - Evan Cavallo, Robert Harper:
Internal Parametricity for Cubical Type Theory. - Jeremy Sproston:
Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities. - Amir M. Ben-Amram, Geoff W. Hamilton:
Tight Polynomial Bounds for Loop Programs in Polynomial Space. - J. Robin B. Cockett, Cole Comfort, Priyaa V. Srinivasan:
Dagger linear logic for categorical quantum mechanics. - Nils Vortmeier, Thomas Zeume:
Dynamic Complexity of Parity Exists Queries. - Massimo Bartoletti, Letterio Galletta, Maurizio Murgia:
A theory of transaction parallelism in blockchains. - James Laird:
Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism. - Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann:
Controlling a random population. - Danilo Pianini, Roberto Casadei, Mirko Viroli, Stefano Mariani, Franco Zambonelli:
Time-Fluid Field-Based Coordination through Programmable Distributed Schedulers. - Mateus de Oliveira Oliveira:
On Supergraphs Satisfying CMSO Properties. - Yo Mitani, Naoki Kobayashi, Takeshi Tsukada:
A Probabilistic Higher-order Fixpoint Logic. - G. Michele Pinna:
A new operational representation of dependencies in Event Structures. - Michal Koucký, Vojtech Rödl, Navid Talebanfard:
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. - Petar Vukmirovic, Alexander Bentkamp, Visa Nummelin:
Efficient Full Higher-Order Unification. - Clemens Kupke, Jurriaan Rot:
Expressive Logics for Coinductive Predicates. - Vasco Brattka:
Stashing And Parallelization Pentagons. - Rick Erkens, Maurice Laveaux:
Adaptive Non-linear Pattern Matching Automata. - Jules Chouquet, Lionel Vaux Auclair:
An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets. - Patricia Johann, Enrico Ghiorzi:
Parametricity for Nested Types and GADTs. - Tomasz Brengos:
A coalgebraic take on regular and ω-regular behaviours. - Flavien Breuvart, Ugo Dal Lago, Agathe Herrou:
On Higher-Order Probabilistic Subrecursion. - Maria Pittou, George Rahonis:
Architectures in parametric component-based systems: Qualitative and quantitative modelling.
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-11-11 21:17 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:
