Sciweavers

108 search results - page 15 / 22
» Verifying Design with Proof Scores
Sort
View
KBSE
2005
IEEE
14 years 2 months ago
Prufrock: a framework for constructing polytypic theorem provers
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
Justin Ward, Garrin Kimmell, Perry Alexander
ACSAC
2007
IEEE
14 years 2 months ago
Establishing and Sustaining System Integrity via Root of Trust Installation
Integrity measurements provide a means by which distributed systems can assess the trustability of potentially compromised remote hosts. However, current measurement techniques si...
Luke St. Clair, Joshua Schiffman, Trent Jaeger, Pa...
ICDE
2012
IEEE
291views Database» more  ICDE 2012»
12 years 7 months ago
Efficiently Monitoring Top-k Pairs over Sliding Windows
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
Zhitao Shen, Muhammad Aamir Cheema, Xuemin Lin, We...
POPL
2006
ACM
14 years 9 months ago
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
Steve Bishop, Matthew Fairbairn, Michael Norrish, ...
ICFP
2008
ACM
14 years 8 months ago
AURA: a programming language for authorization and audit
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
Limin Jia, Jeffrey A. Vaughan, Karl Mazurak, Jianz...