Vector Addition System Reversible Reachability Problem

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

A Rewriting View of Simple Typing

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

Asymptotically almost all lambda-terms are strongly normalizing

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

Counting CTL

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

Type classes for efficient exact real arithmetic in Coq

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

Continuous Markovian Logics - Axiomatization and Quantified Metatheory

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

Probabilistic modal {mu}-calculus with independent product

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

A Complete Axiomatization of Quantified Differential Dynamic Logic for Distributed Hybrid Systems

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

The Structure of Differential Invariants and Differential Cut Elimination

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

On computable approximations of Landau's constant

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

Environment and classical channels in categorical quantum mechanics

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

Adaptable processes

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

Linear Dependent Types and Relative Completeness

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

Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees

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

Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds

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

Petri Net Reachability Graphs: Decidability Status of First Order Properties

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

Off-line test selection with test purposes for non-deterministic timed automata

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

On Berry's conjectures about the stable order in PCF

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

Parameterised Multiparty Session Types

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

Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion

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