|
Descripción
|
|
|---|---|
| Static program analysis (generally based on computing fixpoints using the technique of abstract interpretation) is widely used for automatically inferring program properties such as correctness, robustness, safety, cost, etc. Performing such analysis interactively during software development allows early detection and reporting of bugs, such as, e.g., assertion violations, back to the programmer. This can be done as the program is being edited by (re-)running the analysis in the background each time a set of changes is made, e.g., when a file is saved, or a commit made in the version control system. However, real-life programs are large, and, typically, have a complex structure combining a good number of modules with other modules in system libraries. Global analysis of such large code bases can be very expensive, and more so if context-sensitivity is supported for precision. This renders triggering a complete reanalysis for each set of changes too costly. A key observation, however, is that in practice each development or transformation iteration is normally formed by relatively small modifications, which in turn are isolated inside a small number of modules. This property can be taken advantage of in order to reduce the cost of re-analysis by reusing | |
|
Internacional
|
Si |
|
Nombre congreso
|
34th International Conference on Logic Programming (ICLP 2018) |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
Poland |
|
Revisores
|
Si |
|
ISBN o ISSN
|
978-3746786940 |
|
DOI
|
10.4230/OASIcs.ICLP.2018.7 |
|
Fecha inicio congreso
|
02/09/2018 |
|
Fecha fin congreso
|
07/09/2018 |
|
Desde la página
|
1 |
|
Hasta la página
|
2 |
|
Título de las actas
|
Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018), OpenAccess Series in Informatics (OASIcs), |