Compositional Verification of CCS Processes

Compositional Verification of Secure Applet Interactions

“…This approach has been successfully used for the compositional verification of CCS programs [7], and even of complex telecommunications software written in the Erlang programming language [9]. The proof system uses Gentzen style sequents, i.e.…”

“…Informally, the discharge rule applies if (1) every non-axiom leaf of the proof tree is an instance (up to a substitution) of some ancestor sequent in the proof tree, (2) for each such sequent, this substitution maps some ordinal variable approximating a fixed-point formula to an ordinal variable which is assumed to be smaller, and (3) these separate induction schemes are consistent with each other. For the technical details the interested reader is referred to [8,7,9].…”

“…-a specification language based on the modal µ-calculus [12,8], together with a set of specification patterns, inspired from Bandera [1], that allows higherlevel specifications and reasoning; -a compositional proof system in the style of [16,7,9] that is used for proving correctness of property decompositions. This proof system has been proved sound w.r.t.…”

State Space Representation for Verification of Open Systems

“…The proof system based method of Dam and Gurov [15] is an example of interactive verification of open systems. Reasoning about open systems in such a proof-theoretic manner can essentially be viewed as a symbolic execution of OTA.…”

Compositional Verification: Decidability Issues Using Graph Substitutions

“…This framework relies on the language-independent model of programs introduced in [12] in order to catch some classical security properties. It has been studied in [4,3,18] (see also [7]) for compositional reasoning about security of open multi-application smart cards. Like e.g.…”