Fair Asynchronous Session Subtyping

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

A higher-order transformation approach to the formalization and analysis of BPMN using graph transformation systems

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

Pre-measure spaces and pre-integration spaces in predicative Bishop-Cheng measure theory

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

Formalising the Double-Pushout Approach to Graph Transformation

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

History-deterministic Timed Automata

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

Completeness Theorems for Kleene algebra with tests and top

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

Higher-Order Asynchronous Effects

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

Advanced Model Consistency Restoration with Higher-Order Short-Cut Rules

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

Disentangling Parallelism and Interference in Game Semantics

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

Sharing proofs with predicative theories through universe-polymorphic elaboration

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

QBF Merge Resolution is powerful but unnatural

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

Simply typed convertibility is TOWER-complete even for safe lambda-terms

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

Preservation theorems for Tarski's relation algebra

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

Half-Positional Objectives Recognized by Deterministic Büchi Automata

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

Zeta Functions and the (Linear) Logic of Markov Processes

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

Controller Synthesis for Timeline-based Games

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

On two-variable guarded fragment logic with expressive local Presburger constraints

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

Deterministic pushdown automata can compress some normal sequences

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

Complexity results for modal logic with recursion via translations and tableaux

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

Decidability for Sturmian words

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