Abstract
No abstract available.
Cited By
- Roy S, Deursen A and Hermans F Perceived Relevance of Automatic Code Inspection in End-User Development Proceedings of the 23rd International Conference on Evaluation and Assessment in Software Engineering, (167-176)
- Thüm T, Apel S, Kästner C, Schaefer I and Saake G (2014). A Classification and Survey of Analysis Strategies for Software Product Lines, ACM Computing Surveys, 47:1, (1-45), Online publication date: 1-Jul-2014.
- Mascheroni M and Farina F Nets-Within-Nets paradigm and grid computing Transactions on Petri Nets and Other Models of Concurrency V, (201-220)
- Dewar R The compiler as a static analysis tool Proceedings of the 2007 ACM international conference on SIGAda annual international conference, (83-88)
- Dewar R (2019). The compiler as a static analysis tool, ACM SIGAda Ada Letters, XXVII:3, (83-88), Online publication date: 17-Nov-2007.
- Nkwocha F and Elbaum S Fault patterns in Matlab Proceedings of the first workshop on End-user software engineering, (1-4)
- Nkwocha F and Elbaum S (2005). Fault patterns in Matlab, ACM SIGSOFT Software Engineering Notes, 30:4, (1-4), Online publication date: 1-Jul-2005.
- Brand D A Software Falsifier Proceedings of the 11th International Symposium on Software Reliability Engineering
- Brykczynski B (2019). A survey of software inspection checklists, ACM SIGSOFT Software Engineering Notes, 24:1, (82), Online publication date: 1-Jan-1999.
Index Terms
- Checking C programs with lint
Recommendations
Precise and efficient static array bound checking for large embedded C programs
PLDI '04In this paper we describe the design and implementation of a static array-bound checker for a family of embedded programs: the flight control software of recent Mars missions. These codes are large (up to 280 KLOC), pointer intensive, heavily ...
Interprocedural analysis of asynchronous programs
Proceedings of the 2007 POPL ConferenceAn asynchronous program is one that contains procedure calls which are not immediately executed from the callsite, but stored and "dispatched" in a non-deterministic order by an external scheduler at a later point. We formalize the problem of ...