Sciweavers

640 search results - page 107 / 128
» Logical types for untyped languages
Sort
View
CCS
2005
ACM
14 years 1 months ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
ICLP
2005
Springer
14 years 1 months ago
Techniques for Scaling Up Analyses Based on Pre-interpretations
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
PLDI
2009
ACM
14 years 11 days ago
Flow-sensitive semantics for dynamic information flow policies
Dynamic information flow policies, such as declassification, are essential for practically useful information flow control systems. However, most systems proposed to date that ...
Niklas Broberg, David Sands
IKE
2007
13 years 9 months ago
A Set-Theoretic Data Model For Evolving Database Environments
The paper presents an integrated set-theoretic data model that offers a framework for defining a unified schema for any database environment. We utilise the concepts ”entity...
Emmanuel J. Yannakoudakis, Panagiotis Andrikopoulo...
IFIP
2010
Springer
13 years 2 months ago
Semantics of Trust
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with "strangers". This makes ...
Tim Muller