3342 search results - page 361 / 669 » Automating Abstract Interpretation |
114
Voted
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. We present KeY-C, a tool for deductive verification of C programs. KeY-C allows to prove partial correctness of C programs relative to pre- and postconditions. It is base...
140
Voted
CADE
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
126
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
136
click to vote
CADE
2004
Springer
16 years 4 months ago
2004
Springer
ended abstract motivates and presents techniques for identifying variable independence in free variable calculi for classical logic without equality. Two variables are called indep...
132
Voted
NCA
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—This paper describes a set of innovative attributebased checks for defending against phishing attacks1 . We explain a number of anti-phishing algorithms implemented as p...