Type inference for C : applications to the static analysis of incomplete programs.

Simple item page
dc.contributor.authorMelo, Leandro T. C.
dc.contributor.authorRibeiro, Rodrigo Geraldo
dc.contributor.authorGuimarães, Breno Campos Ferreira
dc.contributor.authorPereira, Fernando Magno Quintao
dc.date.accessioned2022-02-15T16:00:11Z
dc.date.available2022-02-15T16:00:11Z
dc.date.issued2020pt_BR
dc.description.abstractType inference is a feature that is common to a variety of programming languages. While, in the past, it has been prominently present in functional ones (e.g., ML and Haskell), today, many object-oriented/ multi-paradigm languages such as C# and C++ offer, to a certain extent, such a feature. Nevertheless, type inference still is an unexplored subject in the realm of C. In particular, it remains open whether it is possible to devise a technique that encompasses the idiosyncrasies of this language. The first difficulty encountered when tackling this problem is that parsing C requires, not only syntactic, but also semantic information. Yet, greater challenges emerge due to C’s intricate type system. In this work, we present a unification-based framework that lets us infer the missing struct, union, enum, and typedef declarations in a program. As an application of our technique, we investigate the reconstruction of partial programs. Incomplete source code naturally appears in software development: during design and while evolving, testing, and analyzing programs; therefore, understanding it is a valuable asset. With a reconstructed well-typed program, one can: (i) enable static analysis tools in scenarios where components are absent; (ii) improve precision of “zero setup” static analysis tools; (iii) apply stub generators, symbolic executors, and testing tools on code snippets; and (iv) provide engineers with an assortment of compilable benchmarks for performance and correctness validation. We evaluate our technique on code from a variety of C libraries, including GNU’s Coreutils and on snippets from popular projects such as CPython, FreeBSD, and Git.pt_BR
dc.identifier.citationMELO, L. T. C. et al. Type inference for C: applications to the static analysis of incomplete programs. ACM Transactions on Programming Languages and Systems, v. 42, n. 3, nov. 2020. Disponível em: <https://dl.acm.org/doi/10.1145/3421472>. Acesso em: 25 ago. 2021.pt_BR
dc.identifier.doihttps://doi.org/10.1145/3421472pt_BR
dc.identifier.issn1558-4593
dc.identifier.urihttp://www.repositorio.ufop.br/jspui/handle/123456789/14492
dc.identifier.uri2https://dl.acm.org/doi/10.1145/3421472pt_BR
dc.language.isoen_USpt_BR
dc.rightsrestritopt_BR
dc.subjectParsingpt_BR
dc.subjectConstraintspt_BR
dc.subjectSyntaxpt_BR
dc.subjectPartial programspt_BR
dc.titleType inference for C : applications to the static analysis of incomplete programs.pt_BR
dc.typeArtigo publicado em periodicopt_BR
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
ARTIGO_TypeInferenceApplications.pdf
Size:
5.02 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
DECOM - Artigos publicados em periódicos