Termination of Graph Transformation Systems Using Weighted Subgraph Counting

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

Stochastic Processes with Expected Stopping Time

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

Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages

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

String diagrams for Strictification and Coherence

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

Sum and Tensor of Quantitative Effects

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

Categorical composable cryptography: extended version

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

A cone-theoretic barycenter existence theorem

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

Fair Asynchronous Session Subtyping

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

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

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

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

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

Formalising the Double-Pushout Approach to Graph Transformation

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

History-deterministic Timed Automata

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

Completeness Theorems for Kleene algebra with tests and top

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

Higher-Order Asynchronous Effects

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

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

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

Disentangling Parallelism and Interference in Game Semantics

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

Sharing proofs with predicative theories through universe-polymorphic elaboration

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

QBF Merge Resolution is powerful but unnatural

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

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

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

Preservation theorems for Tarski's relation algebra

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