標題: Titlebook: Computer Aided Verification; 29th International C Rupak Majumdar,Viktor Kun?ak Conference proceedings 2017 Springer International Publishin [打印本頁] 作者: Malevolent 時間: 2025-3-21 16:55
書目名稱Computer Aided Verification影響因子(影響力)
書目名稱Computer Aided Verification影響因子(影響力)學科排名
書目名稱Computer Aided Verification網(wǎng)絡公開度
書目名稱Computer Aided Verification網(wǎng)絡公開度學科排名
書目名稱Computer Aided Verification被引頻次
書目名稱Computer Aided Verification被引頻次學科排名
書目名稱Computer Aided Verification年度引用
書目名稱Computer Aided Verification年度引用學科排名
書目名稱Computer Aided Verification讀者反饋
書目名稱Computer Aided Verification讀者反饋學科排名
作者: 先鋒派 時間: 2025-3-21 23:02 作者: 拖債 時間: 2025-3-22 03:11
Mikhail Dozmorov,Robert E. Hurstfor recurrences of classical randomized algorithms, including ., where the worst-case bounds are either inefficient (such as linear as compared to logarithmic expected-runtime complexity, or quadratic as compared to linear or almost-linear expected-runtime complexity), or ineffective.作者: 不感興趣 時間: 2025-3-22 05:26
Rebecca A. Sealfon,Stuart C. Sealfonxisting approaches for classical Markov decision processes. The main challenge is to treat policies exploiting state residence times, even for .timed objectives. Experimental results show the feasibility and scalability of our approach.作者: 詞匯記憶方法 時間: 2025-3-22 11:15 作者: 遍及 時間: 2025-3-22 14:46
Lisette J. A. Kogelman,Haja N. Kadarmideenees. Second, extending the above approach with a simulation-guided on-demand variant of VI, we present an anytime algorithm that is able to deal with very large models. (3)?Finally, we present experimental results showing that our methods significantly outperform the standard approaches on several b作者: 遍及 時間: 2025-3-22 17:45
Xiaohong Li,Carolyn M. Klinge,Susmita Dattahose in the initial dataset, critical for discovering corner cases and ensuring the learned analysis generalizes to unseen programs..We implemented and instantiated our approach to the task of learning JavaScript static analysis rules for a subset of points-to analysis and for allocation sites analy作者: 腫塊 時間: 2025-3-22 21:26
https://doi.org/10.1007/978-94-007-4819-4n abstract example, or provide a counterexample in which case the synthesizer will explore a different program. When the user accepts a set of abstract examples that covers the entire input space, the synthesis process is completed..We have implemented our approach and we experimentally show that ou作者: 原來 時間: 2025-3-23 01:23
Safety Verification of Deep Neural Networksimage. We enable exhaustive search of the region by employing discretisation, and propagate the analysis layer by layer. Our method works directly with the network code and, in contrast to existing methods, can guarantee that adversarial examples, if they exist, are found for the given region and fa作者: Conflagration 時間: 2025-3-23 06:43
The Power of Symbolic Automata and Transducers and what challenges arise when reasoning about these formalisms. Finally, we present a list of open problems and research directions that relate to both the theory and practice of symbolic automata and transducers.作者: defibrillator 時間: 2025-3-23 09:51 作者: Aphorism 時間: 2025-3-23 13:57
Markov Automata with Multiple Objectivesxisting approaches for classical Markov decision processes. The main challenge is to treat policies exploiting state residence times, even for .timed objectives. Experimental results show the feasibility and scalability of our approach.作者: libertine 時間: 2025-3-23 20:27 作者: Kindle 時間: 2025-3-24 02:12 作者: 小卷發(fā) 時間: 2025-3-24 05:48 作者: 下邊深陷 時間: 2025-3-24 07:37
Synthesis with Abstract Examplesn abstract example, or provide a counterexample in which case the synthesizer will explore a different program. When the user accepts a set of abstract examples that covers the entire input space, the synthesis process is completed..We have implemented our approach and we experimentally show that ou作者: 相反放置 時間: 2025-3-24 12:49 作者: outskirts 時間: 2025-3-24 15:36 作者: 帶傷害 時間: 2025-3-24 21:22 作者: gregarious 時間: 2025-3-25 00:49
Systems Biology and Computational Proteomicstheories, such as linear arithmetic. Therefore, these models extend their classic counterparts to operate over infinite alphabets, such as the set of rational numbers. Due to their expressiveness, symbolic automata and transducers have been used to verify functional programs operating over lists and作者: Crohns-disease 時間: 2025-3-25 05:08 作者: Ingratiate 時間: 2025-3-25 10:40 作者: Alienated 時間: 2025-3-25 15:40 作者: 散步 時間: 2025-3-25 16:43
Rebecca A. Sealfon,Stuart C. SealfonMarkov decision processes is used in reliability engineering, performance evaluation and stochastic scheduling. Their verification so far focused on single objectives such as (timed) reachability, and expected costs. In practice, often the objectives are mutually dependent and the aim is to reveal t作者: 胖人手藝好 時間: 2025-3-25 21:16
Rebecca A. Sealfon,Stuart C. Sealfonmerical results that it returns is critical. However, recent results have shown that implementations of value iteration, a widely used iterative numerical method for computing reachability probabilities, can return results that are incorrect by several orders of magnitude. To remedy this, interval i作者: CUR 時間: 2025-3-26 00:13
Systems Biology for Signaling Networksf the repair is to construct a new program that satisfies a probabilistic Boolean expression. Our work focuses on loop-free decision-making programs, e.g., classifiers, that return a Boolean- or finite-valued result. Specifically, we propose ., a novel program repair technique that iteratively (.)?.作者: Aggressive 時間: 2025-3-26 05:22 作者: 隱語 時間: 2025-3-26 12:02 作者: 流動性 時間: 2025-3-26 15:59 作者: exercise 時間: 2025-3-26 19:48 作者: 材料等 時間: 2025-3-26 21:17
https://doi.org/10.1007/978-94-007-4819-4cessing intractably large amounts of data produced by complex models and experiments. In this work, we utilize monotonic parametric signal temporal logic (PSTL) to design features for unsupervised classification of time series data. This enables using off-the-shelf machine learning tools to automati作者: Narrative 時間: 2025-3-27 02:57
Computer Aided Verification978-3-319-63387-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 項目 時間: 2025-3-27 08:25 作者: Multiple 時間: 2025-3-27 12:33 作者: 使熄滅 時間: 2025-3-27 17:01
https://doi.org/10.1007/978-3-319-63387-9Software engineering; Semantics; Computer software selection and evaluation; Artificial intelligence; Mo作者: 話 時間: 2025-3-27 21:47
978-3-319-63386-2Springer International Publishing AG 2017作者: 偽證 時間: 2025-3-27 23:19 作者: SHOCK 時間: 2025-3-28 05:11
Sa?o D?eroski,Ljup?o Todorovskiof the next-generation airborne collision avoidance system for unmanned aircraft (ACAS Xu). Results show that our technique can successfully prove properties of networks that are an order of magnitude larger than the largest networks verified using existing methods.作者: 議程 時間: 2025-3-28 08:08 作者: 蚊帳 時間: 2025-3-28 12:33
Development: Drug Formulation and Delivery,industry, hence contributes to leveraging the use of formal specifications and computer-aided verification in industrial practice. We apply the tool to several collections of STL formulas and show its effectiveness.作者: 帶傷害 時間: 2025-3-28 14:43 作者: saturated-fat 時間: 2025-3-28 21:52
Repairing Decision-Making Programs Under Uncertaintyess by rooting it in computational learning theory. For evaluation, we focus on repairing machine learning classifiers with the goal of making them . (fair). Our implementation and evaluation demonstrate our approach’s ability to repair a range of programs.作者: 混合物 時間: 2025-3-29 02:52 作者: 我不重要 時間: 2025-3-29 03:22 作者: DECRY 時間: 2025-3-29 08:54 作者: Systemic 時間: 2025-3-29 14:05 作者: 公共汽車 時間: 2025-3-29 19:03 作者: carotid-bruit 時間: 2025-3-29 20:13 作者: Charitable 時間: 2025-3-30 03:40 作者: adroit 時間: 2025-3-30 04:46 作者: 白楊魚 時間: 2025-3-30 11:36
Program Verification Under Weak Memory Consistency Using Separation Logict separation logic, we develop a number of sound program logics for fragments of the C/C++11 memory model. We show that these logics are useful not only for verifying concurrent programs, but also for explaining the weak memory constructs of C/C++.作者: 龍卷風 時間: 2025-3-30 12:43 作者: Laconic 時間: 2025-3-30 19:17 作者: SENT 時間: 2025-3-30 22:27
Program Verification Under Weak Memory Consistency Using Separation Logic1 or Java) or by the hardware architecture (e.g., for assembly and legacy C code). Since most work in concurrent software verification has been developed prior to weak memory consistency, it is natural to ask how these models affect formal reasoning about concurrent programs..In this overview paper,作者: 召集 時間: 2025-3-31 01:48
The Power of Symbolic Automata and Transducerstheories, such as linear arithmetic. Therefore, these models extend their classic counterparts to operate over infinite alphabets, such as the set of rational numbers. Due to their expressiveness, symbolic automata and transducers have been used to verify functional programs operating over lists and作者: etiquette 時間: 2025-3-31 05:42
Maximum Satisfiability in Software Analysis: Applications and Techniquesthe Maximum Satisfiability (MaxSAT) problem, an optimization extension of the Boolean Satisfiability (SAT) problem. We demonstrate the approach on three diverse applications that advance the state-of-the-art in balancing tradeoffs in software analysis. Enabling these applications on real-world progr作者: Brittle 時間: 2025-3-31 11:46
Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networksg them to safety-critical systems is the great difficulty in providing formal guarantees about their behavior. We present a novel, scalable, and efficient technique for verifying properties of deep neural networks (or providing counter-examples). The technique is based on the simplex method, extende作者: 主動 時間: 2025-3-31 17:13
Automated Recurrence Analysis for Almost-Linear Expected-Runtime Boundsvation is that several classical textbook algorithms have quite efficient expected-runtime complexity, whereas the corresponding worst-case bounds are either inefficient (e.g., .), or completely ineffective (e.g., .). Since the main focus of expected-runtime analysis is to obtain efficient bounds, w作者: Bmd955 時間: 2025-3-31 20:25 作者: Ibd810 時間: 2025-3-31 22:03
Ensuring the Reliability of Your Model Checker: Interval Iteration for Markov Decision Processesmerical results that it returns is critical. However, recent results have shown that implementations of value iteration, a widely used iterative numerical method for computing reachability probabilities, can return results that are incorrect by several orders of magnitude. To remedy this, interval i作者: antenna 時間: 2025-4-1 04:07 作者: WITH 時間: 2025-4-1 09:15
