Titlebook: Automated Technology for Verification and Analysis; 9th International Sy Tevfik Bultan,Pao-Ann Hsiung Conference proceedings 2011 Springer-

Coolidge

書目名稱Automated Technology for Verification and Analysis影響因子(影響力)




書目名稱Automated Technology for Verification and Analysis影響因子(影響力)學(xué)科排名




書目名稱Automated Technology for Verification and Analysis網(wǎng)絡(luò)公開度




書目名稱Automated Technology for Verification and Analysis網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Automated Technology for Verification and Analysis被引頻次




書目名稱Automated Technology for Verification and Analysis被引頻次學(xué)科排名




書目名稱Automated Technology for Verification and Analysis年度引用




書目名稱Automated Technology for Verification and Analysis年度引用學(xué)科排名




書目名稱Automated Technology for Verification and Analysis讀者反饋




書目名稱Automated Technology for Verification and Analysis讀者反饋學(xué)科排名

Dealing

譏笑

Zoltan J. Acs,László Szerb,Erkko Autions and the formal verification of some of their fundamental properties, such as Joint probabilities, Chapman-Kolmogorov equation and steady state probabilities, using the HOL theorem prover. For illustration purposes, we utilize our formalization to analyze a simplified binary communication channel.

lobster

天空

Carcinogen

Minuet

Nondeterministic Update of CTL Models by Preserving Satisfaction through Protectionson, our algorithm can efficiently generate a model to satisfy a specification of mutual exclusion in a variant of CTL. Such a variant extends CTL with an operator that limits the out-degree of states. We compare our method with a generate-and-test algorithm and outline a proof of soundness and completeness for our method.

仲裁者

Formalization of Finite-State Discrete-Time Markov Chains in HOLns and the formal verification of some of their fundamental properties, such as Joint probabilities, Chapman-Kolmogorov equation and steady state probabilities, using the HOL theorem prover. For illustration purposes, we utilize our formalization to analyze a simplified binary communication channel.

lactic

Affiliation

Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata together with algorithms for upward as well as downward inclusion checking over this representation of tree automata. Results of a set of experiments comparing the performance of these algorithms are provided, again showing that the newly proposed downward inclusion is very often better than upward inclusion checking.