Toward Parametric Verification of Open Distributed Systems

State Space Representation for Verification of Open Systems

“…In our understanding of the term, verification of open systems can be performed by a compositional proof system due to Dam et al [16] for CCS processes and [14] for Erlang programs. It is a Gentzen-style compositional proof system.…”

“…Furthermore, proving system properties relative to given assumptions on some of its components is a standard element of compositional reasoning. Such reasoning can for example be employed for verifying systems with dynamically changing configuration due to dynamic process spawning [14]. Finally, replacing a component implementation with a specification can be used as a means of abstraction in order to control state space explosion.…”

“…Proof system based methods have previously been suggested for the interactive verification of open systems [14,15] where modal µ-calculus is used to express the temporal assumptions on components as well as the desired property of the system. These interactive methods explore the state space implicitly as much as it is necessary for the particular verification task.…”

Semi-automated verification of Erlang code

“…The setting is general and rich, admitting the use of the same machinery for addressing both program and data behaviours. Previous experiences [8], [2] indicate that proof graphs of a size up to lo5 nodes can be handled. In our experience, larger programs do usually not lead to more difficult proof structures, but rather just to additional proof obligations.…”

“…We explore the alternative of proof system-based Erlang code ver8cation. Verifying temporal properties of systems with dynamically evolving process structures and unbounded data is hard, requiring a framework [2], [3], [4] which is parametric on components and relativised on their properties, i.e., does not necessarily require all parts of the Erlang system in question to be fully specified;…”