Titlebook: Computer Aided Verification; 16th International C Rajeev Alur,Doron A. Peled Conference proceedings 2004 Springer-Verlag Berlin Heidelberg

稀少

書(shū)目名稱(chēng)Computer Aided Verification影響因子(影響力)




書(shū)目名稱(chēng)Computer Aided Verification影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Computer Aided Verification網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Computer Aided Verification網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Computer Aided Verification被引頻次




書(shū)目名稱(chēng)Computer Aided Verification被引頻次學(xué)科排名




書(shū)目名稱(chēng)Computer Aided Verification年度引用




書(shū)目名稱(chēng)Computer Aided Verification年度引用學(xué)科排名




書(shū)目名稱(chēng)Computer Aided Verification讀者反饋




書(shū)目名稱(chēng)Computer Aided Verification讀者反饋學(xué)科排名

antidote

殺蟲(chóng)劑

DOSE

Proving More Properties with Bounded Model Checking,the LTL formula to a Büchi automaton so as to reduce model checking to the verification of a fairness constraint. This reduction leads to one termination criterion that applies to all formulae. We also discuss cases for which a dedicated termination test improves bounded model checking efficiency.

有權(quán)威

刺耳

Compositional Specification and Model Checking in GSTE,cally, we develop an efficient model checking algorithm for directly verifying the compositional specification. At the end, we show the result of our approach in the verification of a micro-instruction scheduler in a state-of-the-art microprocessor.

刺耳

違法事實(shí)

消耗

https://doi.org/10.1007/978-4-431-87704-2ruence closure algorithms for dealing with the built-in equality and the integer successor and predecessor symbols. Experiments with a first implementation indicate that our technique already outperforms the previous methods on most benchmarks, and scales up very well.

Outspoken

Ahmed Mediani,Syarul Nataqain Baharuma Markov chain . and automaton ., check whether the probability induced by . of . is one (or compute the probability precisely). We show that these problem can be solved within the same complexity bounds as model checking of Markov chains with respect to LTL formulas. Thus, the additional expressive power comes at no penalty.