Full Text Available
Access Full Text at Repository
Search Results - Computer Engineering
-
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
Online Article RSS Article -
Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Unifying Büchi Complementation Constructions
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
L-Recursion and a new Logic for Logarithmic Space
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
On the Complexity of Equivalence and Minimisation for Q-weighted Automata
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Generalizing determinization from automata to coalgebras
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Coarse abstractions make Zeno behaviours difficult to detect
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Vector Addition System Reversible Reachability Problem
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
A Rewriting View of Simple Typing
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Asymptotically almost all lambda-terms are strongly normalizing
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Counting CTL
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Type classes for efficient exact real arithmetic in Coq
Published in Logical Methods in Computer Science (2013)Subjects: “…Computer Science & Information Science…”
Get full text
-
Continuous Markovian Logics - Axiomatization and Quantified Metatheory
Published in Logical Methods in Computer Science (2012)Subjects: “…Computer Science & Information Science…”
Get full text
-
Probabilistic modal {mu}-calculus with independent product
Published in Logical Methods in Computer Science (2012)Subjects: “…Computer Science & Information Science…”
Get full text
-
A Complete Axiomatization of Quantified Differential Dynamic Logic for Distributed Hybrid Systems
Published in Logical Methods in Computer Science (2012)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Structure of Differential Invariants and Differential Cut Elimination
Published in Logical Methods in Computer Science (2012)Subjects: “…Computer Science & Information Science…”
Get full text
-
Environment and classical channels in categorical quantum mechanics
Published in Logical Methods in Computer Science (2012)Subjects: “…Computer Science & Information Science…”
Get full text