Model Detection Tool Summary __ Model detection

Source of Self Blog

http://www.yingzinanfei.com/2017/02/01/moxingjiancegongjuhuizong/

Model Detection Tool for formal specification language

The SMV (Symbolic model Verifier) symbol Model Detection Tool SMV is used to detect whether a finite state system satisfies a CTL formula. Its modeling mode is in modules, modules can be synchronized or asynchronous combination, module description of the basic elements include non-deterministic selection, state transition and parallel assignment statements. The basic method of the model detection is to represent the state transition relationship with a two-fork graph, and to compute the fixed point method to detect the accessibility of the State and its satisfying properties. > http://www.cs.cmu.edu/~modelcheck/smv.html

NUSMV (new symbolic model Verifier) A model detection tool for SMV reconfiguration supports all specifications of the compute tree logical CTL and linear sequential logic LTL description integrate the SAT based bounded model detection technology > http://nusmv.fbk.eu/

The new symbol Model Detection tool for NUXMV analysis of synchronous finite state and infinite state systems is extended to NUSMV for finite states, the NUXMV feature is an effective validation engine based on Sat algorithm for infinite State, NUXMV feature is based on SMT verification technology, Close integration with MathSAT5 > https://nuxmv.fbk.eu/

Uppaal (Uppsala University & Aalborg University) Model Detection Tool modeling and simulation and validation of real-time system Tools > http://www.uppaal.org/for Time automata

Step (Stanford temporal prover) The verification problem of the model detector processing subsystem of the Stanford time Validator using a theorem verifier to summarize the results without limiting the result to the finite state system, the joint model detection using inference mode is applied to a wider system. Programs that include infinite data fields > http://www-step.stanford.edu/

CWB (concurrency Workbench) An automated tool for concurrent system operations and analysis can detect equivalence relationships between system models, fre-order relationships, and whether systems can meet the formulas of $\mu$-calculus Modeling methods use a subset of CCS or Lotos languages -to analyze the state space of a given program and detect the equivalence and serialization of multiple semantics > http://homepages.inf.ed.ac.uk/perdita/cwb/

VIS (verification interacting with synthesis) tools for formal validation, synthesis, and simulation of finite state systems can synthesize finite state systems and verify the properties of these systems > http:// vlsi.colorado.edu/~vis/

Model Detection Tool for source programming language

The SPIN (simple Promela interpreter) Explicit model detection Tool SPIN to detect whether a finite state system satisfies PLTL formulas and other properties, including accessibility and cycling. Modeling is a process-by-unit, asynchronous combination of processes, and the basic elements of process description include assignment statements, conditional statements, communication statements, non-deterministic selections, and circular statements. The basic approach is to use automata to represent processes and PLTL formulas to determine whether the combined acceptable language of these automata detects whether a process model satisfies a given property. The modeling language is Promela (process MEta LAnguage), based on processes, with a structure similar to the C language > http://spinroot.com/spin/whatispin.html

BLAST (Berkeley Lazy Abstraction Software verification) Time series security attribute of C program automatic verification tool The abstract refinement framework based on anti-example guidance is used to detect C language program using lazy abstraction (lazy abstraction) technology, effectively improve the efficiency > http://cseweb.ucsd.edu/~rjhala/ Blast.html

SLAM C Program Model Detection Tool to abstract the original C language program into the Boolean program process validation work abstract after the program only the remaining Boolean variables rely on c2bp,Bebop, **newton**3 tools are responsible for the completion of abstraction, detection and abstract refinement tasks > https://www.microsoft.com/en-us/research/project/slam/

JPF (Java Path Finder) The Java Program Validation tool implements a MC-JVM to address issues such as memory allocation and garbage collection > HTTP://BABELFISH.ARC.NASA.GOV/TRAC/JPF

verisoft Direct test C source code Eraser can detect Java code jchecker C Program Model Detection Tool
Based on predicate abstraction theory, abstract refinement framework based on predicate abstraction is able to abstract the model for C program source and search its state space completely, so that the security attribute of this validator can minimize state space.

Bandera Concurrent Java Program Model Detection Tool platform based on program slicing technology, the Java program is converted into intermediate code back-end interface to adapt to a variety of model detectors, including spin and SMV > http:// bandera.projects.cs.ksu.edu/

Klocwork Insightpro can detect multiple types of quality defects and vulnerabilities CMC can detect C language programs at the time of execution OS level scheduling MACEMC used to detect distributed systems
Http://www.macesystems.org/wiki/macemc

Chess is used to detect multithreaded Windows programs > https://www.microsoft.com/en-us/research/project/ chess-find-and-reproduce-heisenbugs-in-concurrent-programs/

FDR > https://www.cs.ox.ac.uk/projects/fdr/

Murphi A model detector for enumerating display states, for C language > http://formalverification.cs.utah.edu/Murphi/

Moonwalker for. NET Application Model Detection Tool XMC to the synchronization operation algorithm detection in Java program

flavers ( flow analysis for verification of Systems tools for the ADA language > http://formalverification.cs.utah.edu/Murphi/

Mocha model Detection Tools > https://www.cis.upenn.edu/~mocha/for C language

CBMC /c++ model Detection Tools > http://www.cprover.org/cbmc/for C language

MAGIC (Modular analysis of ProGrams in C) model detection Tools > http://www.cs.cmu.edu/~chaki/magic/for C language

Other model detection ToolsOFMCA symbol model detection tool for security protocolscopsPersistent Security CheckerRational Tau F-soft IMPACT Astree Analysis Tool Saturn Calysto Terminator Satabs Terminator mCRL2 (Micro Common representation Language)Concurrency System Detection ToolLTSA (labeled Transition System Analyzer)Concurrency System Detection ToolMaudeA tool based on logical semanticsISPTesting tools for MPI programsCHIC (Checker for Interface compatibility)Validation tool for module behavior compatibilitymrmc (Markov reward Model)A Markov excitation model for discrete and continuous timeUmlcheckerUML Model Detection ToolsBACH (bounded reachablity CHecker)Analysis of bounded accessibility for linear hybrid automataLdpcheckerChecking linear time-period properties for positive-loop closed automata (Positive loop-closed automata)QrdcheckerTesting tools for time series Logic QRDC (quantified restrictred Duration calculs)Kronos Hytech Autoabs Feaver 3VMC ASpin

Other classification methods combined with model detection and theorem proving
Step Symbol Model Detection
Using Boolean logic formula to describe the System attribute delimitation Model detection technique (diagrams model bounded) using the ordered binary graph Obdds (Ordered Binary Decision checking) to describe the State migration graph
The solver, which relies on Boolean satisfiability problem, SAT, determines whether the system satisfies the nature by limiting the number of steps K. If not, increase the K value and verify again

Other classification methods based on automata theory
SPIN based fixed point theorem
Smv

Other classification methods for real-time system model detection tools
UPPAAL, Kronos, step model detection tools for concurrent systems
Spin, JPF, VeriSoft Model Detection tool for hybrid systems
Hytech, Hysat, BACH, Ldpchecker

The steps of model detection: Abstracting The mathematical model of the system
Migration system Markov chain Kripke structure gives a language that can describe the nature of the system
Linear sequential Logic LTL
Care about the state of the system in any one run and the relationship between them the temporal logic ctl
Bifurcation sequence logic, used to describe the relationship and branching of States $\mu$-calculus
Care about the relationship between the action and the state of the system