Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Denis Kuperberg |
Positive First-order Logic on Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Fedor Part, Neil Thapen, Iddo Tzameret |
First-Order Reasoning and Efficient Semi-Algebraic Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jean Christoph Jung, Frank Wolter |
Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-14, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Antonis Achilleos, Mathias Ruggaard Pedersen |
Axiomatizations and Computability of Weighted Monadic Second-Order Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Federico Olimpieri |
Intersection Type Distributors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-15, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Luca Aceto, Elli Anastasiadi, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik |
In search of lost time: Axiomatising parallel composition in process algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-14, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Xiaodong Jia 0002, Bert Lindenhovius, Michael W. Mislove, Vladimir Zamdzhiev |
Commutative Monads for Probabilistic Programming Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-14, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Paul-André Melliès |
Asynchronous Template Games and the Gray Tensor Product of 2-Categories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk |
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan 0001 |
On Linear Time Decidability of Differential Privacy for Programs with Unbounded Inputs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Balázs F. Mezei, Marcin Wrochna, Stanislav Zivný |
PTAS for Sparse General-Valued CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-11, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jeff Erickson 0001, Gabriel Nivasch, Junyan Xu |
Fusible numbers and Peano Arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Rineke Verbrugge |
Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all frames. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jan Dreier |
Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jamie Tucker-Foltz |
Inapproximability of Unique Games in Fixed-Point Logic with Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Ramana Nagasamudram, David A. Naumann |
Alignment Completeness for Relational Hoare Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | James Laird |
A Compositional Cost Model for the λ-calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Manuel Bodirsky, Thomas Feller 0001, Simon Knäuer, Sebastian Rudolph |
On Logics and Homomorphism Closure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi |
On sequentiality and well-bracketing in the π-calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Albert Atserias, Phokion G. Kolaitis, Wei-Lin Wu |
On the Expressive Power of Homomorphism Counts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Manuel Bodirsky, Bertalan Bodor |
Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Farzaneh Derakhshan, Stephanie Balzer, Limin Jia 0001 |
Session Logical Relations for Noninterference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-14, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Emanuel Kieronski, Sebastian Rudolph |
Finite Model Theory of the Triguarded Fragment and Related Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Matteo Mio, Ralph Sarkis, Valeria Vignudelli |
Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-14, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Krishnendu Chatterjee, Laurent Doyen 0001 |
Stochastic Processes with Expected Stopping Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Maciej Gazda, Robert M. Hierons |
Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Ehrhard, Farzad Jafarrahmani |
Categorical models of Linear Logic with fixed points of formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Orna Kupferman, Noam Shenwald |
Perspective Multi-Player Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Moritz Lichter |
Separating Rank Logic from Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Julien Grange |
Successor-Invariant First-Order Logic on Classes of Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 479-491, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | A. R. Balasubramanian |
Complexity of controlled bad sequences over finite sets of Nd. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 130-140, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Henning Urbat, Lutz Schröder |
Automata Learning: An Algebraic Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 900-914, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Matthew Moore, Taylor Walenczyk |
The Hidden Subgroup Problem for Universal Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 756-767, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Angelos Charalambidis, Giannos Chatziagapis, Panos Rondogiannis |
A Fixed Point Theorem on Lexicographic Lattice Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 301-311, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Powell 0001 |
On the computational content of Zorn's lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 768-781, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Pranav Ashok, Krishnendu Chatterjee, Jan Kretínský, Maximilian Weininger, Tobias Winkler |
Approximating Values of Generalized-Reachability Stochastic Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 102-115, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Manuel Bodirsky, Wied Pakusa, Jakub Rydval |
Temporal Constraint Satisfaction Problems in Fixed-Point Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 237-251, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Martin Grohe |
Counting Bounded Tree Depth Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 507-520, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Niels van der Weide |
Constructing Higher Inductive Types as Groupoid Quotients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 929-943, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan |
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 209-223, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Peter Schuster 0001, Daniel Misselbeck-Wessel |
Resolving finite indeterminacy: A definitive constructive universal prime ideal theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 820-830, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Clemens Grabmayer, Wan J. Fokkink |
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 465-478, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Rajeev Alur, Yu Chen 0039, Kishor Jothimurugan, Sanjeev Khanna |
Space-efficient Query Evaluation over Probabilistic Event Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 74-87, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Mikolaj Bojanczyk, Amina Doumane |
First-order tree-to-tree functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 252-265, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Gianluca Curzi, Michele Pagani |
The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 327-340, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Peio Borthelle, Tom Hirschowitz, Ambroise Lafont |
A Cellular Howe Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 273-286, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Russell Impagliazzo, Sasank Mouli, Toniann Pitassi |
The Surprising Power of Constant Depth Algebraic Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 591-603, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani |
One-Clock Priced Timed Games are PSPACE-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 397-409, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jendrik Brachter, Pascal Schweitzer |
On the Weisfeiler-Leman Dimension of Finite Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 287-300, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Karoliina Lehtinen, Martin Zimmermann 0002 |
Good-for-games ω-Pushdown Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 689-702, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Matteo Acclavio, Ross Horne, Lutz Straßburger |
Logic Beyond Formulas: A Proof System on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 38-52, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dmitry Chistikov 0001, Mikhail Vyalyi |
Re-pairing brackets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 312-326, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Cong Tian, Wensheng Wang, Zhenhua Duan |
Making Streett Determinization Tight. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 859-872, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Szymon Torunczyk, Thomas Zeume |
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 873-885, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kuldeep S. Meel, S. Akshay 0001 |
Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 728-741, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Gilles Barthe, Rohit Chadha, Vishal Jagannath, A. Prasad Sistla, Mahesh Viswanathan 0001 |
Deciding Differential Privacy for Programs with Finite Inputs and Outputs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 141-154, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Ehrhard |
Cones as a model of intuitionistic linear logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 370-383, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | András Kovács, Ambrus Kaposi |
Large and Infinitary Quotient Inductive-Inductive Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 648-661, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Alexandre Goy 0002, Daniela Petrisan |
Combining probabilistic and non-deterministic choice via weak distributive laws. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 454-464, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Hugo Herbelin, Étienne Miquey |
A calculus of expandable stores: Continuation-and-environment-passing style translations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 564-577, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Delia Kesner, Pierre Vial |
Consuming and Persistent Types for Classical Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 619-632, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Miika Hannula, Juha Kontinen, Jan Van den Bussche, Jonni Virtema |
Descriptive complexity of real computation and probabilistic independence logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 550-563, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Antonín Kucera 0001, Jérôme Leroux, Dominik Velan |
Efficient Analysis of VASS Termination Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 676-688, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jérôme Leroux |
When Reachability Meets Grzegorczyk. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 1-6, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Salomon Sickert, Javier Esparza |
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 831-844, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Francesco Belardinelli, Catalin Dima, Vadim Malvone, Ferucio Laurentiu Tiplea |
A Hennessy-Milner Theorem for ATL with Imperfect Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 181-194, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Michael Blondin, Mikhail A. Raskin |
The Complexity of Reachability in Affine Vector Addition Systems with States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 224-236, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Göller, Pawel Parys |
Bisimulation Finiteness of Pushdown Systems Is Elementary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 521-534, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Abraham Westerbaan, Bas Westerbaan, John van de Wetering |
A characterisation of ordered abstract probabilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 944-957, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Pierre-Marie Pédrot |
Russian Constructivism in a Prefascist Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 782-794, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Thorsten Altenkirch, Luis Scoccola |
The Integers as a Higher Inductive Type. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 67-73, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Holger Hermanns, Lijun Zhang 0001, Naoki Kobayashi 0001, Dale Miller 0001 (eds.) |
LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![ACM, 978-1-4503-7104-9 The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Revantha Ramanayake |
Extended Kripke lemma and decidability for hypersequent substructural logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 795-806, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Takeshi Tsukada |
On Computability of Logical Approaches to Branching-Time Property Verification of Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 886-899, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kristina Sojakova, Floris van Doorn, Egbert Rijke |
Sequential Colimits in Homotopy Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 845-858, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Nathanael Arkor, Marcelo Fiore |
Algebraic models of simple type theories: A polynomial approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 88-101, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Matthew Z. Weaver, Daniel R. Licata |
A Constructive Model of Directed Univalence in Bicubical Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 915-928, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Peng Fu 0001, Kohei Kishida, Peter Selinger |
Linear Dependent Type Theory for Quantum Programming Languages: Extended Abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 440-453, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Benedikt Ahrens, Paige Randall North, Michael Shulman, Dimitris Tsementzis |
A Higher Structure Identity Principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 53-66, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti |
Modal Logics with Composition on Finite Forests: Expressivity and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 167-180, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Paul-André Melliès, Léo Stefanesco |
Concurrent Separation Logic Meets Template Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 742-755, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Marcelo Fiore, Philip Saville |
Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 425-439, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Christian Sattler, Andrea Vezzosi |
Partial Univalence in n-truncated Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 807-819, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jim de Groot, Dirk Pattinson |
Modal Intuitionistic Logics as Dialgebraic Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 355-369, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Erich Grädel |
Automatic Structures: Twenty Years Later. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 21-34, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux |
A tier-based typed programming language characterizing Feasible Functionals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 535-549, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler |
Lower Bounds for QBFs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 410-424, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Wojciech Czerwinski, Georg Zetzsche |
An Approach to Regular Separability in Vector Addition Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 341-354, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski |
Intermediate problems in modular circuits satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 578-590, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Grzegorz Fabianski, Michal Skrzypczak, Szymon Torunczyk |
Uniformisations of Regular Relations Over Bi-Infinite Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 384-396, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Shin-ya Katsumata, Exequiel Rivas, Tarmo Uustalu |
Interaction Laws of Monads and Comonads. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 604-618, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Umang Mathur 0001, Andreas Pavlogiannis, Mahesh Viswanathan 0001 |
The Complexity of Dynamic Data Race Prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 713-727, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Brigitte Pientka |
Contextual Types, Explained: Invited Tutorial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 35-37, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Michal Wrona |
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 958-971, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Gilles Barthe, Charlie Jacomme, Steve Kremer |
Universal equivalence and majority of probabilistic programs over finite fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 155-166, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Arthur Azevedo de Amorim, Matt Fredrikson, Limin Jia 0001 |
Reconciling noninterference and gradual typing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 116-129, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche |
Extensions of ω-Regular Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 266-272, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Nathan Lhote |
Pebble Minimization of Polyregular Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 703-712, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jérémie Koenig, Zhong Shao |
Refinement-Based Game Semantics for Certified Abstraction Layers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 633-647, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Nicolai Kraus, Jakob von Raumer |
Coherence via Well-Foundedness: Taming Set-Quotients in Homotopy Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 662-675, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|