Sciweavers

LICS
1999
IEEE
14 years 2 months ago
Counting and Addition Cannot Express Deterministic Transitive Closure
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
Matthias Ruhl
LICS
1999
IEEE
14 years 2 months ago
Proving Security Protocols Correct
Security protocols use cryptography to set up private communication channels on an insecure network. Many protocols contain flaws, and because security goals are seldom specified ...
Lawrence C. Paulson
LICS
1999
IEEE
14 years 2 months ago
Entailment of Atomic Set Constraints is PSPACE-Complete
The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constra...
Joachim Niehren, Martin Müller, Jean-Marc Tal...
LICS
1999
IEEE
14 years 2 months ago
Type Inference for Recursive Definitions
We consider type systems that combine universal types, recursive types, and object types. We study type inference in these systems under a rank restriction, following Leivant'...
A. J. Kfoury, Santiago M. Pericás-Geertsen
LICS
1999
IEEE
14 years 2 months ago
The Higher-Order Recursive Path Ordering
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
LICS
1999
IEEE
14 years 2 months ago
Towards a Theory of Bisimulation for Local Names
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
Alan Jeffrey, Julian Rathke
LICS
1999
IEEE
14 years 2 months ago
Logics with Aggregate Operators
Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon...
LICS
1999
IEEE
14 years 2 months ago
Plausibility Measures and Default Reasoning: An Overview
We introduce a new approach to modeling uncertainty based on plausibility measures. This approach is easily seen to generalize other approaches to modeling uncertainty, such as pr...
Joseph Y. Halpern, Nir Friedman