Tight field bounds contribute to verifying the correctness of object oriented programs in bounded scenarios, by restricting the values that fields can take to feasible cases only, during automated analysis. Tight field bounds are computed from formal class specifications. Their computation is costly, and existing approaches use a cluster of computers to obtain the bounds, from declarative (JML) formal specifications. In this article we address the question of whether the language in which class specifications are expressed may affect the efficiency with which tight field bounds can be computed. We introduce a novel technique that generates tight field bounds from data structure descriptions provided in terms of shape predicates, expressed u...
This paper presents an analysis for bounds checking of array sub-scripts that lifts checking asserti...
Abstract. This paper addresses the problem of automatically generating quan-tified invariants for pr...
An important feature of object-oriented programming languages is the ability todynamically instantia...
Dada una descripción formal de los estados válidos del heap -por ejemplo, un invariante de una estru...
We introduce field constraint analysis, a new technique for verifying data structure invariants. A...
We introduce \emph{field constraint analysis}, a new technique for verifying data structure invarian...
Abstract. We introduce field constraint analysis, a new technique for verifying data struc-ture inva...
Software model checkers are able to exhaustively explore different bounded program executions arisin...
SAT-based bounded verification of annotated code consists of translating the code together with the ...
Abstract. We propose a logic-based framework for automated reasoning about sequential programs manip...
Shape analysis is a static analysis of the source code of a program to determine shapes and manipula...
Abstract — Despite their popularity and importance, pointerbased programs remain a major challenge f...
One of the main challenges in the verification of software systems is the analysis of unbounded data...
An important feature of object-oriented programming languages is the ability to dynamically instanti...
AbstractDespite their popularity and importance, pointer-based programs remain a major challenge for...
This paper presents an analysis for bounds checking of array sub-scripts that lifts checking asserti...
Abstract. This paper addresses the problem of automatically generating quan-tified invariants for pr...
An important feature of object-oriented programming languages is the ability todynamically instantia...
Dada una descripción formal de los estados válidos del heap -por ejemplo, un invariante de una estru...
We introduce field constraint analysis, a new technique for verifying data structure invariants. A...
We introduce \emph{field constraint analysis}, a new technique for verifying data structure invarian...
Abstract. We introduce field constraint analysis, a new technique for verifying data struc-ture inva...
Software model checkers are able to exhaustively explore different bounded program executions arisin...
SAT-based bounded verification of annotated code consists of translating the code together with the ...
Abstract. We propose a logic-based framework for automated reasoning about sequential programs manip...
Shape analysis is a static analysis of the source code of a program to determine shapes and manipula...
Abstract — Despite their popularity and importance, pointerbased programs remain a major challenge f...
One of the main challenges in the verification of software systems is the analysis of unbounded data...
An important feature of object-oriented programming languages is the ability to dynamically instanti...
AbstractDespite their popularity and importance, pointer-based programs remain a major challenge for...
This paper presents an analysis for bounds checking of array sub-scripts that lifts checking asserti...
Abstract. This paper addresses the problem of automatically generating quan-tified invariants for pr...
An important feature of object-oriented programming languages is the ability todynamically instantia...