Compositional verification of priority systems using sharp bisimulation

A Compositional Protocol Verification Using Relativized Bisimulation

Compositional Verification of Timed Systems

In this paper we address the state space explosion problem inherent to model-checking timed systems with a large number of components. The main challenge is to obtain pertinent global timing constraints from the timings in the components alone. To this end, we make use of auxiliary clocks to automatically generate new invariants which capture the constraints induced by the synchronisations betw...

automatic verification of authentication protocols using genetic programming

implicit and unobserved errors and vulnerabilities issues usually arise in cryptographic protocols and especially in authentication protocols. this may enable an attacker to make serious damages to the desired system, such as having the access to or changing secret documents, interfering in bank transactions, having access to users’ accounts, or may be having the control all over the syste...

Compositional Verification of Hybrid Systems using Simulation Relations

ed models, such as in the examples above, can help to considerably speed up the analysis, and experimental results will be provided in Part 11. In the next section, we will discuss methods to compute simulation relations algorithmically, based on geometric operations in Rn. 6.3 Computing Simulation Relations in Rn 91 6.3 Computing Simulation Relations in Rn The computation of a simulation relat...

Verification of Orchestration Systems Using Compositional Partial Order Reduction

Orc is a computation orchestration language which is designed to specify computational services, such as distributed communication and data manipulation, in a concise and elegant way. Four concurrency primitives allow programmers to orchestrate site calls to achieve a goal, while managing timeouts, priorities, and failures. To guarantee the correctness of Orc model, effective verification suppo...