Full Text Available
Access Full Text at Repository
Search Results - Information Technology
-
Inductive Definition and Domain Theoretic Properties of Fully Abstract
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
Online Article RSS Article -
A Normalizing Intuitionistic Set Theory with Inaccessible Sets
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
Relating two standard notions of secrecy
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Complexity of Model Checking Higher-Order Fixpoint Logic
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
On tractability and congruence distributivity
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
Bistable Biorders: A Sequential Domain Theory
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
Transforming structures by set interpretations
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
Automatic Structures: Richness and Limitations
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
Predicate Abstraction via Symbolic Decision Procedures
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
Adventures in time and space
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
On the decidability and complexity of Metric Temporal Logic over finite words
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
Real-Time Model-Checking: Parameters everywhere
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
Predicate Abstraction with Under-approximation Refinement
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
Logic Meets Algebra: the Case of Regular Languages
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text
-
Expressiveness of Metric modalities for continuous time
Published in Logical Methods in Computer Science (2007)Subjects: “…Computer Science & Information Science…”
Get full text