Automated verification
Volume 70: Automated Verification of Critical Systems 2014
... Extensions to and applications of GPUVerify The core GPUVerify method was presented in [BCD + 12], with details on how to support unstructured control flow graphs, key to re-use of the Clang/LLVM infrastructure (see ...
18
Volume 53: Automated Verification of Critical Systems 2012
... fully automated verification of formal specifications is an elusive goal, due to the disproportionate gap between the expressive power of rich specification languages and the simplicity of temporal logics ...
16
A formal method framework for automated verification of a deaerator system
... an automated verification technique which focused on determines the temporal logic and sees whether specification is same with the system designed or ...
24
Automated Verification of Virtualized Infrastructures
... formal verification: they are complex environments that continuously change their shape, and that give rise to non-trivial security goals such as isolation and failure resilience ...different verification ...
12
Volume 66: Automated Verification of Critical Systems 2013
... the automated generation of real-time control software from activity diagrams extended with information regarding exe- cution time, parallelism and ...the verification of a set of benchmark UML activity ...
16
Volume 66: Automated Verification of Critical Systems 2013
... One important point in asynchronous systems is that the lack of a reference clock leads to an interleaved execution of processes. Therefore, in GALS NoCs, a sent packet might be delayed by different number of disrupting ...
17
Volume 66: Automated Verification of Critical Systems 2013
... A Mix Net is a cryptographic protocol which conceals the correspondence between the initial vec- tor of encrypted input values and the permuted vector of decrypted values given as output. No protocol participant should ...
16
Volume 66: Automated Verification of Critical Systems 2013
... In this step, we use the UML-B and AD tools to convert the diagrams of step 2 to Event-B notation. We also manually convert the structured English representation of step 2 into Event-B. [r] ...
17
Volume 66: Automated Verification of Critical Systems 2013
... In Parnas and Madey [ PM95 ], a system implementation is given as SY S = IN ., SOF ., OU T. As seen in Subsection 2.2 , the angelic composition allows dead ends between the composed rela[r] ...
16
Volume 66: Automated Verification of Critical Systems 2013
... So AD diagrams can provide a guideline for when and how to refine the Event-B model, like the constrain that, the all-construct should be only applied to one event, so in this case we ad[r] ...
16
Volume 66: Automated Verification of Critical Systems 2013
... Failures-Divergence-Refinement (FDR) [GGH + ] verifies that the two systems refine each other, meaning that they are trace equivalent and hence that the intruder cannot distinguish them. We conclude that the vVote voting ...
16
Volume 66: Automated Verification of Critical Systems 2013
... The verification of incomplete timed systems can provide three major benefits: First of all, certain verification steps can be performed at early stages of the design of a timed system, when parts of the ...
16
Volume 66: Automated Verification of Critical Systems 2013
... the verification of object-oriented sequential programs [BDF + 04], facilitate its ...program verification shows that using * can be advantageous over the use of inductive reachability predicates when ...
16
Volume 66: Automated Verification of Critical Systems 2013
... We then consider the general rational case, and study the complexity of the decision problem together with several optimisations. We reformulate the original LP problem [HT12] in order to simplify the construction of the ...
16
Volume 53: Automated Verification of Critical Systems 2012
... The first model we use to evaluate our approach is a micro benchmark consisting of two methods (one of them optimizable) and one process. The process invokes a non-preemptable method to test whether the numbers between 1 ...
16
Volume 53: Automated Verification of Critical Systems 2012
... The Interlocking machine captures information about the location of trains on tracks using the pos: TRAIN 7→ ALLTRACK function. In Section 6 we will discuss the reason for this weak invariant and its impact on safety ...
16
Volume 53: Automated Verification of Critical Systems 2012
... for first-order logic with equality that includes extensions for TLA + for reasoning about sets and functions, and Isabelle/TLA + , a faithful encoding of TLA + in the Isabelle proof assistant, which provides ...
16
Volume 53: Automated Verification of Critical Systems 2012
... It is our conviction that any unverified communication scheme is likely to contain bugs. We have demonstrated once more that formal modelling is an invaluable addition to the standardisation pro- cesses. If requirements ...
17
Volume 53: Automated Verification of Critical Systems 2012
... We demonstrate the simultaneous creation of the system model and model validation speci- fications; our approach is to validate these two parts against each other using model checking. Previous work [5, 6, 23, 31] often ...
16
Volume 70: Automated Verification of Critical Systems 2014
... Abstract: Smartcards are security critical devices requiring a high assurance veri- fication approach. Although formal techniques can be used at design or even at de- velopment stages, such systems have to undergo a ...
16