Automatic Verification of Strongly Dynamic Software Systems

Authors:
N. Dor;J. Field;D. Gopan;T. Lev-Ami;A. Loginov;R. Manevich;G. Ramalingam;T. Reps;N. Rinetzky;M. Sagiv;R. Wilhelm;E. Yahav;G. Yorsh
Affiliations:
Panaya Ltd.,;IBM Research,;University of Wisconsin,;Tel Aviv University,;IBM Research,;Tel Aviv University,;Microsoft Research,;University of Wisconsin,;Tel Aviv University,;Tel Aviv University,;Universität des Saarlandes,;IBM Research,;Tel Aviv University,
Venue:
Verified Software: Theories, Tools, Experiments
Year:
2005

Citing 28
Cited 0

Typestate: A programming language concept for enhancing software reliability

IEEE Transactions on Software Engineering
Bandera: extracting finite-state models from Java source code

Proceedings of the 22nd international conference on Software engineering
Putting static analysis to work for verification: A case study

Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Verifying safety properties of concurrent Java programs using 3-valued logic

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Enforcing high-level protocols in low-level software

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Flow-sensitive type qualifiers

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
ESP: path-sensitive program verification in polynomial time

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Deriving specialized program analyses for certifying component-client conformance

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Extended static checking for Java

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Parametric shape analysis via 3-valued logic

ACM Transactions on Programming Languages and Systems (TOPLAS)
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Kleene Analysis of Mobile Ambients

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Compactly Representing First-Order Structures for Static Analysis

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Checking Cleanness in Linked Lists

SAS '00 Proceedings of the 7th International Symposium on Static Analysis
TVLA: A System for Implementing Static Analyses

SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Interprocedural Shape Analysis for Recursive Programs

CC '01 Proceedings of the 10th International Conference on Compiler Construction
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Mobile Ambients

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Using Programmer-Written Compiler Extensions to Catch Security Holes

SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Verifying safety properties using separation and heterogeneous abstractions

Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
A semantics for procedure local heaps and its abstractions

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A framework for numeric analysis of array operations

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typestate verification: abstraction techniques and complexity results

SAS'03 Proceedings of the 10th international conference on Static analysis
Establishing local temporal heap safety properties with applications to compile-time memory management

SAS'03 Proceedings of the 10th international conference on Static analysis
Verifying temporal heap properties specified via evolution logic

ESOP'03 Proceedings of the 12th European conference on Programming
Predicate abstraction and canonical abstraction for singly-linked lists

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
A relational abstraction for functions

SAS'05 Proceedings of the 12th international conference on Static Analysis
Interprocedural shape analysis for cutpoint-free programs

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

Quantified Score

Hi-index	0.01

Visualization

Abstract

Strongly dynamic software systems are difficult to verify. By strongly dynamic, we mean that the actors in such systems change dynamically, that the resources used by such systems are dynamically allocated and deallocated, and that for both sets, no bounds are statically known. In this position paper, we describe the progress we have made in automated verification of strongly dynamic systems using abstract interpretation with three-valued logical structures. We then enumerate a number of challenges that must be tackled in order for such techniques to be widely adopted.