Full Text Available
Access Full Text at Repository
Search Results - "Computer and Information Science"
-
Model Checking One-clock Priced Timed Automata
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
Online Article RSS Article -
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
-
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Algebraic Pattern Matching in Join Calculus
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Independence and concurrent separation logic
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Generative Unbinding of Names
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Call-by-value Termination in the Untyped lambda-calculus
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Lambda-RBAC: Programming with Role-Based Access Control
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
Are there Hilbert-style Pure Type Systems?
Published in Logical Methods in Computer Science (2008)Subjects: “…Computer Science & Information Science…”
Get full text
-
A proof of strong normalisation using domain theory
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
Generic Trace Semantics via Coinduction
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text