ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity

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

A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

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

Pumping lemmas for weighted automata

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

Axiomatizing Hybrid XPath with Data

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

Presburger Arithmetic with algebraic scalar multiplications

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

The Complexity of Reachability in Affine Vector Addition Systems with States

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

Affine Extensions of Integer Vector Addition Systems with States

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

Encoding many-valued logic in $lambda$-calculus

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

Discovering ePassport Vulnerabilities using Bisimilarity

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

Algebraic cocompleteness and finitary functors

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

Predicative theories of continuous lattices

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

A realizability semantics for inductive formal topologies, Church's Thesis and Axiom of Choice

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

Star Games and Hydras

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

Interface Modeling for Quality and Resource Management

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

Theories of real addition with and without a predicate for integers

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

Presentable signatures and initial semantics

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

Computable analysis and notions of continuity in Coq

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

Partially Ordered Automata and Piecewise Testability

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

Decidability for Entailments of Symbolic Heaps with Arrays

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

Parametric updates in parametric timed automata

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