Verified Software: Theories, Tools, Experiments

Volume 4171 of the series Lecture Notes in Computer Science pp 82-92

Automatic Verification of Strongly Dynamic Software Systems

  • N. DorAffiliated withPanaya Ltd.
  • , J. FieldAffiliated withIBM Research
  • , D. GopanAffiliated withUniversity of Wisconsin
  • , T. Lev-AmiAffiliated withTel Aviv University
  • , A. LoginovAffiliated withIBM Research
  • , R. ManevichAffiliated withTel Aviv University
  • , G. RamalingamAffiliated withMicrosoft Research
  • , T. RepsAffiliated withUniversity of Wisconsin
  • , N. RinetzkyAffiliated withTel Aviv University
    • , M. SagivAffiliated withTel Aviv University
    • , R. WilhelmAffiliated withUniversität des Saarlandes
    • , E. YahavAffiliated withIBM Research
    • , G. YorshAffiliated withTel Aviv University


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.