標題: Titlebook: Computer Aided Verification; 16th International C Rajeev Alur,Doron A. Peled Conference proceedings 2004 Springer-Verlag Berlin Heidelberg [打印本頁] 作者: 稀少 時間: 2025-3-21 16:46
書目名稱Computer Aided Verification影響因子(影響力)
書目名稱Computer Aided Verification影響因子(影響力)學科排名
書目名稱Computer Aided Verification網絡公開度
書目名稱Computer Aided Verification網絡公開度學科排名
書目名稱Computer Aided Verification被引頻次
書目名稱Computer Aided Verification被引頻次學科排名
書目名稱Computer Aided Verification年度引用
書目名稱Computer Aided Verification年度引用學科排名
書目名稱Computer Aided Verification讀者反饋
書目名稱Computer Aided Verification讀者反饋學科排名
作者: antidote 時間: 2025-3-21 21:35 作者: 殺蟲劑 時間: 2025-3-22 04:14 作者: DOSE 時間: 2025-3-22 07:38
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.作者: 有權威 時間: 2025-3-22 11:57 作者: 刺耳 時間: 2025-3-22 13:54
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.作者: 刺耳 時間: 2025-3-22 18:57 作者: 違法事實 時間: 2025-3-23 00:51 作者: 消耗 時間: 2025-3-23 05:26
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 時間: 2025-3-23 07:42
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.作者: 棲息地 時間: 2025-3-23 10:57 作者: 興奮過度 時間: 2025-3-23 17:20
Verifying ,-Regular Properties of Markov Chains,a 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.作者: 集聚成團 時間: 2025-3-23 19:09
Zahra Fahmi,Sven A. Sewitz,Karen Lipkowt-order quantification to define a predicate that relates pipeline states with ISA states and uses its . for correspondence proofs. Our methodology can be used to reason about . pipelines with interrupts, stalls, and exceptions, and we demonstrate its use in verifying pipelines mechanically in the ACL2 theorem prover.作者: Mortar 時間: 2025-3-24 01:42 作者: indoctrinate 時間: 2025-3-24 05:12 作者: 不知疲倦 時間: 2025-3-24 06:50
Mahmoud Tavallaie,Mostafa Khafaeiby supporting modular refinement. We distinguish conformance from the related preorders, stable failures refinement in CSP and refusal preorder in CCS. We have implemented conformance checking in a new software model checker, ., and we report on how we used it to find errors in distributed programs.作者: MAL 時間: 2025-3-24 10:40
Mahmoud Tavallaie,Mostafa Khafaei violation of the property, the algorithm may respond with a “don’t know” answer. We implemented our algorithm in a Java-based prototype tool called ., and experimented with the tool using case studies analyzed in [15]. Our empirical results show that our approach may, at least in some cases, be faster than previous analysis methods.作者: cauda-equina 時間: 2025-3-24 18:12 作者: 安慰 時間: 2025-3-24 21:36
Computer Aided Verification978-3-540-27813-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 公理 時間: 2025-3-24 23:34
0302-9743 Overview: Includes supplementary material: 978-3-540-22342-9978-3-540-27813-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 后退 時間: 2025-3-25 04:21 作者: inspired 時間: 2025-3-25 09:41 作者: 圖畫文字 時間: 2025-3-25 13:39
Zahra Fahmi,Sven A. Sewitz,Karen Lipkow overlapped execution of different instructions. Nevertheless, we show that if the logic used is sufficiently expressive, then it is possible to relate the executions of the pipelined machine with the corresponding Instruction Set Architecture using (stuttering) simulation. Our methodology uses firs作者: NICHE 時間: 2025-3-25 19:39
Hans V. Westerhoff,Jan-Hendrik S. Hofmeyrorithms can do without locking mechanisms, and are therefore desirable. Lock-free algorithms are hard to design correctly, however, even when apparently straightforward. We formalize Herlihy’s methodology [13] for transferring a sequential implementation of any data structure into a lock-free synchr作者: ORE 時間: 2025-3-25 23:47 作者: 大雨 時間: 2025-3-26 00:41 作者: NOTCH 時間: 2025-3-26 05:20 作者: 人類學家 時間: 2025-3-26 09:45
https://doi.org/10.1007/978-1-59745-525-1r low-level nets [4,5] and a state of the art parallel high-level net unfolder described in [15,13]. We present experimental results comparing our approach to the one of [4,5] and the model-checker . [12].作者: reception 時間: 2025-3-26 14:37 作者: FLORA 時間: 2025-3-26 18:28
Justin Newberg,Juchang Hua,Robert F. Murphycally constructed given a set of predicates. Predicate abstraction coupled with automatic predicate discovery provides for a completely automatic verification scheme. For systems with unbounded integer state variables (e.g. software), counterexample guided predicate discovery has been successful in 作者: HEAVY 時間: 2025-3-26 22:37 作者: 西瓜 時間: 2025-3-27 03:59
Jacob Czech,Markus Dittrich,Joel R. Stilesnot well studied. We compare the behavior of ground decision procedures by comparing the performance of a variety of technologies on benchmark suites with differing characteristics. Based on these experimental results, we discuss relative strengths and shortcomings of different systems.作者: laparoscopy 時間: 2025-3-27 06:00
https://doi.org/10.1007/978-4-431-87704-2riety of progressively more sophisticated (. or .) translations into propositional SAT. Here we propose a new approach, namely a general DPLL(.) engine, whose parameter . can be instantiated with a specialized solver . . for a given theory ., thus producing a system DPLL(.). We describe this DPLL(.)作者: BROTH 時間: 2025-3-27 11:24
Ahmed Mediani,Syarul Nataqain Baharum induces a probability measure on sets of computations. The notion of correctness now becomes probabilistic. We solve here the general problem of linear-time probabilistic model checking with respect to .-regular specifications. As specification formalism, we use alternating Büchi infinite-word auto作者: 鞏固 時間: 2025-3-27 16:40 作者: 坦白 時間: 2025-3-27 18:14 作者: 小隔間 時間: 2025-3-27 23:22 作者: TEM 時間: 2025-3-28 06:05
Mahmoud Tavallaie,Mostafa Khafaeiand . is any environment such that . | . is stuck-free, then . | . is stuck-free. Stuck-freedom is related to the CSP notion of deadlock, but it is more discriminative by taking orphan messages in asynchronous systems into account. We prove that conformance is a precongruence on CCS processes, there作者: 不能強迫我 時間: 2025-3-28 07:37
Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings,r low-level nets [4,5] and a state of the art parallel high-level net unfolder described in [15,13]. We present experimental results comparing our approach to the one of [4,5] and the model-checker . [12].作者: 雪崩 時間: 2025-3-28 13:44 作者: 紅潤 時間: 2025-3-28 15:03 作者: 雄偉 時間: 2025-3-28 21:23 作者: 典型 時間: 2025-3-28 23:26 作者: Small-Intestine 時間: 2025-3-29 07:01 作者: Obscure 時間: 2025-3-29 07:57 作者: Ingratiate 時間: 2025-3-29 15:15
https://doi.org/10.1007/978-3-319-92967-5This paper reviews the principles behind the paradigm of “abstract interpretation via 3-valued logic,” discusses recent work to extend the approach, and summarizes on-going research aimed at overcoming remaining limitations on the ability to create program-analysis algorithms fully automatically.作者: 做事過頭 時間: 2025-3-29 19:12 作者: corpus-callosum 時間: 2025-3-29 20:22 作者: Euphonious 時間: 2025-3-30 01:22 作者: 河潭 時間: 2025-3-30 07:23
Symbolic Model Checking of Non-regular Properties,This paper presents a symbolic model checking algorithm for Fixpoint Logic with Chop, an extension of the modal .-calculus capable of defining non-regular properties. Some empirical data about running times of a naive implementation of this algorithm are given as well.作者: SYN 時間: 2025-3-30 09:09
Deductive Verification of Pipelined Machines Using First-Order Quantification, overlapped execution of different instructions. Nevertheless, we show that if the logic used is sufficiently expressive, then it is possible to relate the executions of the pipelined machine with the corresponding Instruction Set Architecture using (stuttering) simulation. Our methodology uses firs作者: 不能仁慈 時間: 2025-3-30 16:22 作者: resilience 時間: 2025-3-30 19:34
An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model Checking,uire either checking a quadratic size witness formula, or multiple model checking runs; either alternative may be quite expensive in practice. Vacuity is, in its essence, a problem with the justification used by the model checker for deeming the property to be true. We argue that current definitions作者: Override 時間: 2025-3-31 00:07
Termination of Linear Programs,governing termination, that is, a while loop with linear assignments. We relate the termination of such a simple loop, on all initial values, to the eigenvectors corresponding to only the positive real eigenvalues of the matrix defining the loop assignments. This characterization of termination is r作者: 舞蹈編排 時間: 2025-3-31 03:37
Proving More Properties with Bounded Model Checking, this paper we propose a termination criterion for all of LTL, and we show its effectiveness through experiments. Our approach is based on converting 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 terminat作者: 為現(xiàn)場 時間: 2025-3-31 08:44 作者: ineptitude 時間: 2025-3-31 12:22
Using Interface Refinement to Integrate Formal Verification into the Design Cycle, main verification challenges is to keep up with the changes to the specifications as the design evolves, and in particular, the transformations to the interfaces between the components. Interface changes are usually incremental, and therefore, the verification efforts after each change should also 作者: Paradox 時間: 2025-3-31 16:26
Indexed Predicate Discovery for Unbounded System Verification,cally constructed given a set of predicates. Predicate abstraction coupled with automatic predicate discovery provides for a completely automatic verification scheme. For systems with unbounded integer state variables (e.g. software), counterexample guided predicate discovery has been successful in 作者: 忍受 時間: 2025-3-31 21:16
Range Allocation for Separation Logic,type like . or .. Any equality or inequality can be expressed in this logic. We propose a decision procedure for Separation Logic based on allocating small domains (ranges) to the formula’s variables that are sufficient for preserving satisfiability. Given a Separation Logic formula ., our procedure作者: Hectic 時間: 2025-3-31 23:46
An Experimental Evaluation of Ground Decision Procedures,not well studied. We compare the behavior of ground decision procedures by comparing the performance of a variety of technologies on benchmark suites with differing characteristics. Based on these experimental results, we discuss relative strengths and shortcomings of different systems.作者: 相互影響 時間: 2025-4-1 04:50
DPLL(,): Fast Decision Procedures,riety of progressively more sophisticated (. or .) translations into propositional SAT. Here we propose a new approach, namely a general DPLL(.) engine, whose parameter . can be instantiated with a specialized solver . . for a given theory ., thus producing a system DPLL(.). We describe this DPLL(.)作者: 傻瓜 時間: 2025-4-1 08:19 作者: 輕率看法 時間: 2025-4-1 12:00 作者: 舊石器時代 時間: 2025-4-1 16:57 作者: 漂浮 時間: 2025-4-1 18:28 作者: 格言 時間: 2025-4-2 00:48
