Towards Uniform Certification in QBF

Subjects: “…Computer Science & IT…”
Get full text

Galois connecting call-by-value and call-by-name

Subjects: “…Computer Science & IT…”
Get full text

Varieties of unary-determined distributive $ell$-magmas and bunched implication algebras

Subjects: “…Computer Science & IT…”
Get full text

revTPL: The Reversible Temporal Process Language

Subjects: “…Computer Science & IT…”
Get full text

Playing Safe, Ten Years Later

Subjects: “…Computer Science & IT…”
Get full text

Linear Programs with Conjunctive Database Queries

Subjects: “…Computer Science & IT…”
Get full text

Deciding Equations in the Time Warp Algebra

Subjects: “…Computer Science & IT…”
Get full text

Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language

Subjects: “…Computer Science & IT…”
Get full text

Node Replication: Theory And Practice

Subjects: “…Computer Science & IT…”
Get full text

Compositional Confluence Criteria

Subjects: “…Computer Science & IT…”
Get full text

Foundations of probability-raising causality in Markov decision processes

Subjects: “…Computer Science & IT…”
Get full text

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct

Subjects: “…Computer Science & IT…”
Get full text

Offline and online energy-efficient monitoring of scattered uncertain logs using a bounding model

Subjects: “…Computer Science & IT…”
Get full text

Depth lower bounds in Stabbing Planes for combinatorial principles

Subjects: “…Computer Science & IT…”
Get full text

Robustness against Read Committed for Transaction Templates with Functional Constraints

Subjects: “…Computer Science & IT…”
Get full text

Efficient Evaluation of Arbitrary Relational Calculus Queries

Subjects: “…Computer Science & IT…”
Get full text

Decision Questions for Probabilistic Automata on Small Alphabets

Subjects: “…Computer Science & IT…”
Get full text

Existential Definability over the Subword Ordering

Subjects: “…Computer Science & IT…”
Get full text

Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets

Subjects: “…Computer Science & IT…”
Get full text

Finitary Simulation of Infinitary $beta$-Reduction via Taylor Expansion, and Applications

Subjects: “…Computer Science & IT…”
Get full text