Add to ORKGThis paper presents a general approach to annotation inference for a given static program checker. The approach reuses the checker as a subroutine. The approach has been used to implement annotation inference systems for two static program checkers, ESC/Java and rccjava. The paper describes the approach formally and shows how it applies to ESC. Static program checkers find software defects. Many static checkers rely on the programmer to supply annotations describing program proper-ties such as invariants and module specifications
This paper explores an approach to improving the practical us-ability of static verification tools f...
Many important classes of bugs result from invalid assumptions about the results of functions and th...
AbstractMultithreaded software systems are prone to errors due to the difficulty of reasoning about ...
A static program checker that performs modular checking can check one program module for errors with...
Static checking can verify the absence of errors in a program, but often requires written annotation...
Software development and maintenance are costly endeavors. The cost can be reduced if more software ...
AbstractThis paper shows how to integrate two complementary techniques for manipulating program inva...
With the years, program complexity has increased dramatically: ensuring program correctness has beco...
We devised a reachability analysis that exploits code annotations and implemented it as a component ...
This paper shows how to integrate two complementary techniques for manip-ulating program invariants:...
Modular analyses of software systems rely on the specifications of the analyzed mod-ules. In many an...
We show that abstract interpretation-based static program analysis can be made ecient and precise en...
Abstract. With the years, program complexity has increased dramati-cally: ensuring program correctne...
Static analysis tools cannot detect violations of application-specific rules. They can be extended w...
technical reportStatic inference involves the compile-time analysis of programs, either with a view ...
This paper explores an approach to improving the practical us-ability of static verification tools f...
Many important classes of bugs result from invalid assumptions about the results of functions and th...
AbstractMultithreaded software systems are prone to errors due to the difficulty of reasoning about ...
A static program checker that performs modular checking can check one program module for errors with...
Static checking can verify the absence of errors in a program, but often requires written annotation...
Software development and maintenance are costly endeavors. The cost can be reduced if more software ...
AbstractThis paper shows how to integrate two complementary techniques for manipulating program inva...
With the years, program complexity has increased dramatically: ensuring program correctness has beco...
We devised a reachability analysis that exploits code annotations and implemented it as a component ...
This paper shows how to integrate two complementary techniques for manip-ulating program invariants:...
Modular analyses of software systems rely on the specifications of the analyzed mod-ules. In many an...
We show that abstract interpretation-based static program analysis can be made ecient and precise en...
Abstract. With the years, program complexity has increased dramati-cally: ensuring program correctne...
Static analysis tools cannot detect violations of application-specific rules. They can be extended w...
technical reportStatic inference involves the compile-time analysis of programs, either with a view ...
This paper explores an approach to improving the practical us-ability of static verification tools f...
Many important classes of bugs result from invalid assumptions about the results of functions and th...
AbstractMultithreaded software systems are prone to errors due to the difficulty of reasoning about ...