Automatic verification of strongly dynamic software systems

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationVerified Software
Subtitle of host publicationTheories, Tools, Experiments - First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Revised Selected Papers and Discussions
Number of pages11
StatePublished - 1 Dec 2008
Externally publishedYes
Event1st IFIP TC 2/WG 2.3 Conference on Verified Software: Theories, Tools, Experiments, VSTTE 2005 - Zurich, Switzerland
Duration: 10 Oct 200513 Oct 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4171 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference1st IFIP TC 2/WG 2.3 Conference on Verified Software: Theories, Tools, Experiments, VSTTE 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Automatic verification of strongly dynamic software systems'. Together they form a unique fingerprint.

Cite this