Sciweavers

768 search results - page 89 / 154
» Symbolic and Abstract Interpretation for C C Programs
Sort
View
POPL
1989
ACM
14 years 1 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
SIGSOFT
2004
ACM
14 years 10 months ago
Testing static analysis tools using exploitable buffer overflows from open source code
Five modern static analysis tools (ARCHER, BOON, PolySpace C Verifier, Splint, and UNO) were evaluated using source code examples containing 14 exploitable buffer overflow vulnera...
Misha Zitser, Richard Lippmann, Tim Leek
ECOOP
2009
Springer
14 years 10 months ago
Modular Visitor Components
Abstract. The expression families problem can be defined as the problem of achieving reusability and composability across the components involved in a family of related datatypes a...
Bruno C. D. S. Oliveira
FOSSACS
2007
Springer
14 years 3 months ago
Polynomial Constraints for Sets with Cardinality Bounds
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 ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
SAS
2007
Springer
111views Formal Methods» more  SAS 2007»
14 years 3 months ago
Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis
Abstract. Pointer information is a prerequisite for most program analyses, and inclusion-based, i.e. Andersen-style, pointer analysis is widely used to compute such information. Ho...
Ben Hardekopf, Calvin Lin