Sciweavers

66 search results - page 13 / 14
» On the Formal Modelling of Trust in Reputation-Based Systems
Sort
View
LICS
2002
IEEE
15 years 4 months ago
A Syntactic Approach to Foundational Proof-Carrying Code
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, S...
SIGMOD
2010
ACM
170views Database» more  SIGMOD 2010»
15 years 4 months ago
Querying data provenance
Many advanced data management operations (e.g., incremental maintenance, trust assessment, debugging schema mappings, keyword search over databases, or query answering in probabil...
Grigoris Karvounarakis, Zachary G. Ives, Val Tanne...
CCS
2008
ACM
15 years 1 months ago
Stale-safe security properties for group-based secure information sharing
Attribute staleness arises due to the physical distribution of authorization information, decision and enforcement points. This is a fundamental problem in virtually any secure di...
Ram Krishnan, Jianwei Niu, Ravi S. Sandhu, William...
IWCMC
2006
ACM
15 years 5 months ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras
ICFP
2012
ACM
13 years 2 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens