Inferring effective types for static analysis of C programs

DOI10.1016/J.ENTCS.2012.10.006MaRDI QIDQ5170179zbMATH OpenOpenAlexWikidataFDO

Authors Bertrand Jeannet, Pascal Sotin

Publication date 22 July 2014

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2012.10.006

zbMATH Keywords

Boolean typesC programming languagefinite typesstatic analysistype inference

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• State of the Union: Type Inference Via Craig Interpolation
• scientific article; zbMATH DE number 1617324
• An abstract memory functor for verified C static analyzers
• Interprocedural and flow-sensitive type analysis for memory and type safety of C code
• CCured, type-safe retrofitting of legacy code

Cites work

• scientific article; zbMATH DE number 2087547 (Why is no real title available?)
• scientific article; zbMATH DE number 2087570 (Why is no real title available?)
• Precise interprocedural analysis in the presence of pointers to the stack
• The octagon abstract domain
• Typing local control and state using flow analysis

Cited in

(2)

• Enhanced type inference for binding-time analysis
• An empirical study into COBOL type inferencing

Describes a project that uses

Uses Software

• CIL
• Cyclone

This page was built for publication: Inferring effective types for static analysis of C programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170179)