A logic for complex computing systems: Properties preservation along integration and abstraction

Marc Aiguier (1) , Bilal Kanso (2)

1 MAS - Mathématiques Appliquées aux Systèmes - EA 4037
2 E3S - Supélec Sciences des Systèmes

In a previous paper, we defined both a unified formal framework based on L.-S. Barbosa's components for modeling complex software systems, and a generic formalization of integration rules to combine their behavior. In the present paper, we propose to continue this work by proposing a variant of first-order fixed point modal logic to express both components and systems requirements. We establish the important property for this logic to be adequate with respect to bisimulation. We then study the conditions to be imposed to our logic (characterization of sub-families of formulas) to preserve properties along integration operators, and finally show correctness by construction results. The complexity of computing systems results in the definition of formal means to manage their size. To deal with this issue, we propose an abstraction (resp. simulation) of components by components. This enables us to build systems and check their correctness in an incremental way.

Keywords: pi-calculus; correct by construction; Component modeling; refinement/abstraction; coalgebra

Domains: Computer Science [cs]; Logic in Computer Science [cs.LO]

Marc Aiguier, Bilal Kanso. A logic for complex computing systems: Properties preservation along integration and abstraction. Scientific Annals of Computer Science, 2014, 24 (1), pp.1-46. ⟨10.7561/sacs.2014.1.1⟩. ⟨hal-01056530⟩