FIXBAG: a fixpoint calculator for quantified bag constraints

Authors:
Tuan-Hung Pham;Minh-Thai Trinh;Anh-Hoang Truong;Wei-Ngan Chin
Affiliations:
University of Minnesota, Twin Cities;Vietnam National University, Hanoi;Vietnam National University, Hanoi;National University of Singapore
Venue:
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Year:
2011

Citing 11
Cited 3

Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation

PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
TVLA: A System for Implementing Static Analyses

SAS '00 Proceedings of the 7th International Symposium on Static Analysis
The octagon abstract domain

Higher-Order and Symbolic Computation
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems

Science of Computer Programming
Shape-Value Abstraction for Verifying Linearizability

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Apron: A Library of Numerical Abstract Domains for Static Analysis

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Inferring disjunctive postconditions

ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Static analysis in disjunctive numerical domains

SAS'06 Proceedings of the 13th international conference on Static Analysis
Banshee: a scalable constraint-based analysis toolkit

SAS'05 Proceedings of the 12th international conference on Static Analysis

QUIC graphs: relational invariant generation for containers

ECOOP'13 Proceedings of the 27th European conference on Object-Oriented Programming
Invariants synthesis over a combined domain for automated program verification

Theories of Programming and Formal Methods
Automatically refining partial specifications for heap-manipulating programs

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract interpretation techniques have played a major role in advancing the state-of-the-art in program analysis. Traditionally, stand-alone tools for these techniques have been developed for the numerical domains which may be sufficient for lower levels of program correctness. To analyze a wider range of programs, we have developed a tool to compute symbolic fixpoints for quantified bag domain. This domain is useful for programs that deal with collections of values. Our tool is able to derive both loop invariants and method pre/post conditions via fixpoint analysis of recursive bag constraints. To support better precision, we have allowed disjunctive formulae to be inferred, where appropriate. As a stand-alone tool, we have tested it on a range of small but challenging examples with acceptable precision and performance.