Formally Proving Compositionality in Industrial Systems with Informal Specifications

Nyberg, Mattias; Westman, Jonas; Gurov, Dilian

doi:10.1007/978-3-030-61467-6_22

Cited by 9 publications

(6 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, we plan to extend the contract theory to capture program traces by developing a finite-trace semantics, to enable its use in the specification and verification of temporal properties. Lastly, we plan to combine our contract theory with a contract theory for hybrid systems [19].…”

Section: Discussionmentioning

confidence: 99%

An Abstract Contract Theory for Programs with Procedures

Lidström¹,

Gurov²

2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Discussionmentioning

confidence: 99%

An Abstract Contract Theory for Programs with Procedures

Lidström¹,

Gurov²

2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…We will also extend behaviors to incorporate input as well as output, calling them input/output behaviors. In accordance with [24], a specification is simply the set of all input/output behaviors that implement it, and a specification refines another if each behavior implementing it also implements the other. Thus, the framework presented in this paper constitutes an instantiation of the main part of [24].…”

Section: A Theory For Specifying Stochastic Behaviormentioning

confidence: 99%

“…In accordance with [24], a specification is simply the set of all input/output behaviors that implement it, and a specification refines another if each behavior implementing it also implements the other. Thus, the framework presented in this paper constitutes an instantiation of the main part of [24]. Lastly, we present probabilistic automaton contracts (PACs) as a syntax for expressing specifications.…”

Section: A Theory For Specifying Stochastic Behaviormentioning

confidence: 99%

“…Note that a prerequisite for this is that in(Σ 1 ) = ∅ and out(Σ 1 ) = in(Σ 2 ). Again, the following definition is in accordance with [24].…”

Section: Example 5 (Refines)mentioning

confidence: 99%

“…In the present paper, we consider general cyber-physical systems and have therefore chosen a representation compliant with continuous time. Based upon logic and various extensions to include time, a number of frameworks are available to express specifications and to verify refinements between specifications, e.g., [4][5][6][7]. A limitation of these frameworks is that they do not consider probabilistic or stochastic behaviors.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Formally verifying decompositions of stochastic specifications

Hampus,

Nyberg

2024

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

According to the principles of compositional verification, verifying that lower-level components satisfy their specification ensures that the whole system satisfies its top-level specification. The key step is to ensure that the lower-level specifications constitute a correct decomposition of the top-level specification. In a non-stochastic context, such decomposition can be analyzed using techniques of theorem proving. In industrial applications, especially in safety-critical systems, specifications are often of stochastic nature, for example, giving a bound on the probability that a system failure will occur before a given time. A decomposition of such a specification requires techniques beyond traditional theorem proving. The first contribution of the paper is a theoretical framework that allows the representation of, and reasoning about, stochastic and timed behavior of systems as well as specifications for such behavior. The framework is based on traces that describe the continuous-time evolution of a system, and specifications are formulated using timed automata combined with probabilistic acceptance conditions. The second contribution is a novel approach to verifying decompositions of such specifications by reducing the problem to checking emptiness of the solution space for a system of linear inequalities.

show abstract