model checking
To algorithmically check whether a program (the model) sATisfies a specificATion. The model is usually expressed as a directed graph consisting of nodes (or vertices) and edges. A set of ATomic propositions is associATed with each node. The nodes represents stATes of a program, the edges represent possible executions which alters the stATe, while the ATomic propositions represent the basic properties thAT hold AT a point of execution. A specificATion language, usually some kind of {temporal logic}, is used to express properties. The problem can be expressed mAThemATically as: given a temporal logic formula p and a model M with initial stATe s, decide if M,s models p. ["AutomATic verificATion of finite stATe concurrent systems using temporal logic", E.M. Clarke, E.A. Emerson, and A.P. Sisla, ACM Trans. on Programming Languages and Systems 8(2), pp. 244--263, 1986]. (1997-06-26) In addition suitable contents:
[ 2 ] [ = ] [ ACM ] [ ag ] [ al ] [ algorithm ] [ alt ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ AT ] [ ATomic ] [ b ] [ ba ] [ be ] [ C ] [ ca ] [ cAT ] [ ch ] [ ci ] [ ck ] [ CM ] [ co ] [ con ] [ cons ] [ cu ] [ current ] [ de ] [ dec ] [ directed graph ] [ du ] [ E ] [ ec ] [ ed ] [ er ] [ es ] [ et ] [ exec ] [ execution ] [ fi ] [ file ] [ finite ] [ fo ] [ for ] [ formula ] [ ge ] [ gi ] [ gr ] [ graph ] [ gu ] [ h ] [ hAT ] [ hm ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ int ] [ io ] [ ir ] [ is ] [ it ] [ ke ] [ ki ] [ la ] [ language ] [ ld ] [ Lex ] [ ls ] [ lt ] [ ly ] [ M ] [ ma ] [ mm ] [ mo ] [ mod ] [ mode ] [ model ] [ module ] [ mp ] [ ms ] [ mu ] [ na ] [ nc ] [ ng ] [ ni ] [ no ] [ node ] [ ns ] [ om ] [ op ] [ pe ] [ ph ] [ point ] [ pr ] [ program ] [ query ] [ rc ] [ re ] [ ro ] [ S ] [ sa ] [ se ] [ set ] [ si ] [ sit ] [ sl ] [ so ] [ spec ] [ specificATion ] [ st ] [ stATe ] [ su ] [ sy ] [ system ] [ T ] [ temporal logic ] [ test ] [ testing ] [ th ] [ theory ] [ to ] [ ua ] [ us ] [ ve ] [ verificATion ] [ while ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (5613 Reads) |
