125 search results - page 10 / 25 » Bounds Checking with Taint-Based Analysis |
ATVA
2008
Springer
14 years 26 days ago
2008
Springer
1 : Logic in Specification and Verification (abstract) Natarajan Shankar (SRI) Session Chair : Sungdeok Cha 12 : 00 13 : 00 Lunch 13 : 00 15 : 00 2 : Boolean Modeling of Cell Biolo...
FOSSACS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
ICALP
2000
Springer
14 years 2 months ago
2000
Springer
We introduce a generic type system (based on Milner's sort system) for the synchronous polyadic -calculus, allowing us to mechanise the analysis of input/output capabilities o...
PLDI
2006
ACM
14 years 4 months ago
2006
ACM
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...
DATE
2008
IEEE
14 years 5 months ago
2008
IEEE
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...