Sciweavers

44 search results - page 6 / 9
» Security Theorems via Model Theory
Sort
View
FOSSACS
2009
Springer
14 years 2 months ago
Realizability of Concurrent Recursive Programs
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habe...
SOUPS
2009
ACM
14 years 2 months ago
Challenges in supporting end-user privacy and security management with social navigation
Social navigation is a promising approach for supporting privacy and security management. By aggregating and presenting the choices made by others, social navigation systems can p...
Jeremy Goecks, W. Keith Edwards, Elizabeth D. Myna...
LOGCOM
2010
158views more  LOGCOM 2010»
13 years 6 months ago
Applying Universal Algebra to Lambda Calculus
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
Giulio Manzonetto, Antonino Salibra
CORR
2004
Springer
120views Education» more  CORR 2004»
13 years 7 months ago
Validating a Web Service Security Abstraction by Typing
Abstraction by Typing Andrew D. Gordon Microsoft Research Riccardo Pucella Cornell University An XML web service is, to a first approximation, an RPC service in which requests and...
Andrew D. Gordon, Riccardo Pucella
TLCA
2009
Springer
14 years 2 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann