Attacking Large Industrial Code with Bi-abductive Inference

Authors:
Dino Distefano
Affiliations:
Queen Mary, University of London,
Venue:
FMICS '09 Proceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems
Year:
2009

Citing 11
Cited 4

Solving shape-analysis problems in languages with destructive updating

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic predicate abstraction of C programs

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
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
Local Reasoning about Programs that Alter Data Structures

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A static analyzer for large safety-critical software

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Scalable Shape Analysis for Systems Code

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
jStar: towards practical verification for java

Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Compositional shape analysis by means of bi-abduction

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Shape analysis for composite data structures

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Symbolic execution with separation logic

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
A local shape analysis based on separation logic

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Abductive, inductive and deductive reasoning about resources

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
The complexity of abduction for separated heap abstractions

SAS'11 Proceedings of the 18th international conference on Static analysis
Software verification with VeriFast: Industrial case studies

Science of Computer Programming
Automatically refining partial specifications for heap-manipulating programs

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In joint work with Cristiano Calcagno, Peter O'Hearn, and Hongseok Yang, we have introduced bi-abductive inference and its use in reasoning about heap manipulating programs [5]. This extended abstract briefly surveys the key concepts and describes our experience in the application of bi-abduction to real-world applications and systems programs of over one million lines of code.