1016 search results - page 80 / 204 » Automatic Analysis of Programming Assignments |
119
Voted
PLDI
2006
ACM
15 years 9 months ago
2006
ACM
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
134
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Static analysis is a powerful technique for automatic verification of programs but raises major engineering challenges when developing a full-fledged analyzer for a reali...
132
Voted
SAS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
127
Voted
FMOODS
2008
15 years 5 months ago
2008
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...
119
Voted
IFIP
2010
Springer
14 years 10 months ago
2010
Springer
We present a new approach to information flow control (IFC), ploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existi...