Sciweavers

2137 search results - page 271 / 428
» Proving Abstract Non-interference
Sort
View
234
Voted
POPL
2006
ACM
16 years 4 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
147
Voted
CADE
2007
Springer
16 years 4 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
148
Voted
CSL
2007
Springer
15 years 10 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin
BMCBI
2008
102views more  BMCBI 2008»
15 years 4 months ago
Improving protein function prediction methods with integrated literature data
Background: Determining the function of uncharacterized proteins is a major challenge in the post-genomic era due to the problem's complexity and scale. Identifying a protein...
Aaron Gabow, Sonia M. Leach, William A. Baumgartne...
IPL
2006
141views more  IPL 2006»
15 years 3 months ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan