Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic, Volume 21
Volume 21, Number 1, January 2020
- Rémy Chrétien, Véronique Cortier, Antoine Dallon, Stéphanie Delaune:
Typing Messages for Free in Security Protocols. 1:1-1:52 - Gergei Bana, Rohit Chadha, Ajay Kumar Eeralla, Mitsuhiro Okada:
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability. 2:1-2:44 - Tuan-Fang Fan, Churn-Jung Liau
:
Reason-maintenance Belief Logic with Uncertain Information. 3:1-3:32 - Silvio Ghilardi, Maria João Gouveia, Luigi Santocanale:
Fixed-point Elimination in the Intuitionistic Propositional Calculus. 4:1-4:37 - David A. Basin, Felix Klaedtke, Eugen Zalinescu:
Runtime Verification over Out-of-order Streams. 5:1-5:43 - Michael Benedikt, Pierre Bourhis, Georg Gottlob, Pierre Senellart:
Monadic Datalog, Tree Validity, and Limited Access Containment. 6:1-6:45 - Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. 7:1-7:18
Volume 21, Number 2, March 2020
- Olaf Beyersdorff, Joshua Blinkhorn:
Dynamic QBF Dependencies in Reduction and Expansion. 8:1-8:27 - Thomas Place, Marc Zeitoun:
Adding Successor: A Transfer Theorem for Separation and Covering. 9:1-9:45 - David M. Cerna, Temur Kutsia:
Idempotent Anti-unification. 10:1-10:32 - Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz:
Model-Checking on Ordered Structures. 11:1-11:28 - Shiguang Feng, Claudia Carapelle, Oliver Fernández Gil, Karin Quaas:
MTL and TPTL for One-Counter Machines: Expressiveness, Model Checking, and Satisfiability. 12:1-12:34 - Manuel Montenegro, Susana Nieva, Ricardo Peña, Clara Segura:
Extending Liquid Types to Arrays. 13:1-13:41 - Philippe Balbiani, Joseph Boudou, Martín Diéguez, David Fernández-Duque:
Intuitionistic Linear Temporal Logics. 14:1-14:32 - Facundo Carreiro, Alessandro Facchini, Yde Venema, Fabio Zanasi:
The Power of the Weak. 15:1-15:47 - Sinisa Tomovic, Zoran Ognjanovic, Dragan Doder:
A First-order Logic for Reasoning about Knowledge and Probability. 16:1-16:30
Volume 21, Number 3, May 2020
- Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz:
Why Liveness for Timed Automata Is Hard, and What We Can Do About It. 17:1-17:28 - Guillaume Burel:
Linking Focusing and Resolution with Selection. 18:1-18:30 - Mnacho Echenim, Radu Iosif, Nicolas Peltier:
The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates. 19:1-19:46 - André Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter:
Dichotomies in Ontology-Mediated Querying with the Guarded Fragment. 20:1-20:47 - Arnaud Carayol, Olivier Serre:
How Good Is a Strategy in a Game with Nature? 21:1-21:39 - Camillo Fiorentini, Mauro Ferrari:
Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic. 22:1-22:47 - Sergey Goncharov, Stefan Milius, Alexandra Silva:
Toward a Uniform Theory of Effectful State Machines. 23:1-23:63 - Ana Cavalcanti, Robert M. Hierons, Sidney C. Nogueira:
Inputs and Outputs in CSP: A Model and a Testing Theory. 24:1-24:53 - Andrew M. Pitts:
Typal Heterogeneous Equality Types. 25:1-25:10 - Claudio Menghi, Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
Model Checking MITL Formulae on Timed Automata: A Logic-based Approach. 26:1-26:44
Volume 21, Number 4, October 2020
- Antoine Amarilli, Michael Benedikt:
Finite Open-world Query Answering with Number Restrictions. 27:1-27:73 - Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan:
A New Perspective on FO Model Checking of Dense Graph Classes. 28:1-28:23 - Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
First-Order Interpretations of Bounded Expansion Classes. 29:1-29:41 - Franz Baader, Stefan Borgwardt, Patrick Koopmann, Ana Ozaki, Veronika Thost:
Metric Temporal Description Logics with Interval-Rigid Names. 30:1-30:46 - Liron Cohen, Reuben N. S. Rowe:
Non-well-founded Proof Theory of Transitive Closure Logic. 31:1-31:31 - Ron van der Meyden, Manas K. Patra:
Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic. 32:1-32:26 - Jori Bomanson, Tomi Janhunen, Ilkka Niemelä:
Applying Visible Strong Equivalence in Answer-Set Program Transformations. 33:1-33:41 - Paolo Baldan, Tommaso Padoan:
Model Checking a Logic for True Concurrency. 34:1-34:49
a service of 
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-04-30 20:48 CEST 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:
