Sciweavers

1225 search results - page 119 / 245
» The Instance Complexity Conjecture
Sort
View
POPL
2001
ACM
14 years 9 months ago
A generic type system for the Pi-calculus
We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial propert...
Atsushi Igarashi, Naoki Kobayashi
PODS
2007
ACM
119views Database» more  PODS 2007»
14 years 9 months ago
Reasoning about XML update constraints
XML and semi-structured data are now de-facto standards for data exchange, and it is often the case that published or exchanged XML documents have specic restrictions on how they ...
Bogdan Cautis, Serge Abiteboul, Tova Milo
TACAS
2009
Springer
106views Algorithms» more  TACAS 2009»
14 years 3 months ago
Hierarchical Set Decision Diagrams and Regular Models
Abstract. This paper presents algorithms and data structures that exploit a compositional and hierarchical specification to enable more efficient symbolic modelchecking. We encod...
Yann Thierry-Mieg, Denis Poitrenaud, Alexandre Ham...
VL
2009
IEEE
142views Visual Languages» more  VL 2009»
14 years 3 months ago
Using a degree of interest model to facilitate ontology navigation
Understanding and maintaining the structure of large ontologies is a cognitively demanding task. Visualizations are commonly used as a cognitive aid for presenting large ontologie...
Tricia d'Entremont, Margaret-Anne Storey
INDOCRYPT
2009
Springer
14 years 3 months ago
Two Attacks against the Ff RFID Protocol
This paper investigates a new family of RFID protocols called Ff that grew out of a proposal made at ESORICS 2007. This family has the property of having highly efficient implement...
Olivier Billet, Kaoutar Elkhiyaoui