44 search results - page 5 / 9 » A Clausal Approach to Proof Analysis in Second-Order Logic |
118
Voted
CADE
2009
Springer
16 years 7 days ago
2009
Springer
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...
110
Voted
PLDI
2009
ACM
15 years 6 months ago
2009
ACM
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
213
click to vote
POPL
2006
ACM
15 years 12 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
113
Voted
CSFW
1999
IEEE
15 years 4 months ago
1999
IEEE
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
102
click to vote
PODS
2007
ACM
15 years 11 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...