Abstract. Spreadsheet languages are very commonly used, by large user bases, yet they are error prone. However, many semantic issues and errors could be avoided by enforcing a stricter type discipline. As declaring and specifying type information would represent a prohibitive amount of work for users, we propose an abstract interpretation based static analysis for spreadsheet programs that infers type constraints over zones of spread-sheets, viewed as two-dimensional arrays. Our abstract domain consists in a cardinal power from a numerical abstraction describing zones in a spreadsheet to an abstraction of cell values, including type properties. We formalize this abstract domain and its operators (transfer functions, join, widening and reduc...
International audienceThe C language does not have a specific Boolean type: Boolean values are encod...
Abstract. We present the concept of typelets, a specification technique for dynamic graphical user i...
AbstractThe C language does not have a specific Boolean type: Boolean values are encoded with intege...
International audienceSpreadsheet languages are very commonly used, by large user bases, yet they ar...
are the most popular programming systems in use today. Since spreadsheets are visual, first-order fu...
International audienceSpreadsheets are widely used, yet are error-prone: they use a weak type system...
In previous work we have tried to transfer ideas that have been successful in general-purpose progra...
There are many common spreadsheet errors that traditional spreadsheet systems do not help users find...
The spreadsheet metaphor has, over the years, proved itself valuable for the definition and use of c...
Empirical thesis.Bibliography: pages 59-65.1. Introduction -- 2. Background -- 3. Design considerati...
International audienceThe aim of static analysis is to infer invariants about programs that are tigh...
International audienceIn previous work we have shown that more precise type analysis can be achieved...
In the process of incorporating subtyping in relation algebra, an algorithm was found to derive the ...
In previous work we have shown that more precise type analysis can be achieved by exploiting union t...
In previous work, we introduced scope graphs as a formalism for describing program binding structure...
International audienceThe C language does not have a specific Boolean type: Boolean values are encod...
Abstract. We present the concept of typelets, a specification technique for dynamic graphical user i...
AbstractThe C language does not have a specific Boolean type: Boolean values are encoded with intege...
International audienceSpreadsheet languages are very commonly used, by large user bases, yet they ar...
are the most popular programming systems in use today. Since spreadsheets are visual, first-order fu...
International audienceSpreadsheets are widely used, yet are error-prone: they use a weak type system...
In previous work we have tried to transfer ideas that have been successful in general-purpose progra...
There are many common spreadsheet errors that traditional spreadsheet systems do not help users find...
The spreadsheet metaphor has, over the years, proved itself valuable for the definition and use of c...
Empirical thesis.Bibliography: pages 59-65.1. Introduction -- 2. Background -- 3. Design considerati...
International audienceThe aim of static analysis is to infer invariants about programs that are tigh...
International audienceIn previous work we have shown that more precise type analysis can be achieved...
In the process of incorporating subtyping in relation algebra, an algorithm was found to derive the ...
In previous work we have shown that more precise type analysis can be achieved by exploiting union t...
In previous work, we introduced scope graphs as a formalism for describing program binding structure...
International audienceThe C language does not have a specific Boolean type: Boolean values are encod...
Abstract. We present the concept of typelets, a specification technique for dynamic graphical user i...
AbstractThe C language does not have a specific Boolean type: Boolean values are encoded with intege...