Full Text Available
Access Full Text at Repository
Search Results - Information Technology
-
Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
Online Article RSS Article -
Rational streams coalgebraically
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Consistency and Completeness of Rewriting in the Calculus of Constructions
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Game Refinement Relations and Metrics
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Coinductive Formal Reasoning in Exact Real Arithmetic
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Separability in the Ambient Logic
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Exhaustible sets in higher-type computation
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Canonical calculi with (n,k)-ary quantifiers
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Enriched MU-Calculi Module Checking
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Model Checking One-clock Priced Timed Automata
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Visibly Tree Automata with Memory and Constraints
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
A lower bound on web services composition
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Relational Parametricity and Separation Logic
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
On the Expressiveness and Complexity of ATL
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
A Distribution Law for CCS and a New Congruence Result for the pi-calculus
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Semi-continuous Sized Types and Termination
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Normalization of IZF with Replacement
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Normalisation Control in Deep Inference via Atomic Flows
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text