標題: Titlebook: Automated Technology for Verification and Analysis; 16th International S Shuvendu K. Lahiri,Chao Wang Conference proceedings 2018 Springer [打印本頁] 作者: 會議記錄 時間: 2025-3-21 19:42
書目名稱Automated Technology for Verification and Analysis影響因子(影響力)
書目名稱Automated Technology for Verification and Analysis影響因子(影響力)學科排名
書目名稱Automated Technology for Verification and Analysis網(wǎng)絡公開度
書目名稱Automated Technology for Verification and Analysis網(wǎng)絡公開度學科排名
書目名稱Automated Technology for Verification and Analysis被引頻次
書目名稱Automated Technology for Verification and Analysis被引頻次學科排名
書目名稱Automated Technology for Verification and Analysis年度引用
書目名稱Automated Technology for Verification and Analysis年度引用學科排名
書目名稱Automated Technology for Verification and Analysis讀者反饋
書目名稱Automated Technology for Verification and Analysis讀者反饋學科排名
作者: laceration 時間: 2025-3-21 22:57
978-3-030-01089-8Springer Nature Switzerland AG 2018作者: 有其法作用 時間: 2025-3-22 01:19 作者: 多嘴 時間: 2025-3-22 05:08 作者: Incommensurate 時間: 2025-3-22 09:05 作者: 不如屎殼郎 時間: 2025-3-22 16:20 作者: CHANT 時間: 2025-3-22 20:03
Global Governance and Conflict Preventiontively. This paper presents a formally verified motion planner based on manoeuvre automata in Isabelle/HOL. Two general properties which we ensure are numerical soundness (the absence of floating-point errors) and logical correctness (satisfying a plan specified in linear temporal logic). From these作者: 使饑餓 時間: 2025-3-22 21:43 作者: gastritis 時間: 2025-3-23 02:01 作者: GIDDY 時間: 2025-3-23 09:12 作者: Popcorn 時間: 2025-3-23 09:44 作者: MAL 時間: 2025-3-23 13:58 作者: 虛假 時間: 2025-3-23 18:04
Mthuli Ncube,Nombulelo Gumata,Eliphas Ndouility that a complex temporal property is satisfied by finite traces of the system. Desired temporal properties of the system are expressed using a fragment of linear temporal logic, called .. We propose to use barrier certificates for computations of such lower bounds, which is computationally much作者: 背心 時間: 2025-3-23 23:26
Mthuli Ncube,Nombulelo Gumata,Eliphas Ndoun probability distributions. We study .-differential privacy in the setting of labelled Markov chains. While the exact differences relevant to .-differential privacy are not computable in this framework, we propose a computable bisimilarity distance that yields a sound technique for measuring ., the作者: syring 時間: 2025-3-24 03:48 作者: enfeeble 時間: 2025-3-24 10:03
https://doi.org/10.1007/978-3-030-97212-7ation of a concurrent program to a series of verification tasks of sequential programs. Our approach is modular in the sense that each sequential verification task roughly corresponds to the verification of a single thread, with some additional information about the environment in which it operates.作者: 知道 時間: 2025-3-24 10:41
https://doi.org/10.1007/978-3-030-97212-7he transition system with theory of Arrays, further complicates the problem by requiring inference and reasoning with universally quantified formulas. In this paper, we present a new algorithm, ., that extends IC3 to infer universally quantified invariants over the combined theory of LIA and Arrays.作者: 平淡而無味 時間: 2025-3-24 16:14 作者: 截斷 時間: 2025-3-24 21:43
Alan Shiell,Hannah Jackson,Penelope Hawethe ., that is closed under intersection and linear transformations, and allows to check inclusion, equality, and emptiness. The main feature of DCPs lies in their ability to represent concisely polyhedra that can be expressed as combinations of simpler sets, which can overcome combinatorial explosi作者: AMPLE 時間: 2025-3-24 23:47
Formal Specification for Deep Neural Networksc of verification of neural networks. However, verification is most meaningful when performed with high-quality formal specifications. In this paper, we survey the landscape of formal specification for deep neural networks, and discuss the opportunities and challenges for formal methods for this domain.作者: 啤酒 時間: 2025-3-25 03:42 作者: 前面 時間: 2025-3-25 09:20
Global Governance and Conflict Preventionc of verification of neural networks. However, verification is most meaningful when performed with high-quality formal specifications. In this paper, we survey the landscape of formal specification for deep neural networks, and discuss the opportunities and challenges for formal methods for this domain.作者: Simulate 時間: 2025-3-25 12:52 作者: OGLE 時間: 2025-3-25 19:47
Global Governance, Conflict and Resistanceon are guaranteed to be classified correctly. We also introduce the concept of ., which ensures that the neural network is guaranteed not to misclassify inputs within a region to a specific target (adversarial) label. We evaluate DeepSafe on a neural network implementation of a controller for the ne作者: 亞當心理陰影 時間: 2025-3-25 20:06
Global Governance and State Collapseimpractical for non-trivial delays as it incurs a blow-up of the game graph which is exponential in the magnitude of the delay. For safety objectives, we propose a more practical incremental algorithm synthesizing a series of controllers handling increasing delays and reducing game-graph size in bet作者: 側面左右 時間: 2025-3-26 00:24 作者: 數(shù)量 時間: 2025-3-26 07:25 作者: 鴕鳥 時間: 2025-3-26 11:51 作者: frivolous 時間: 2025-3-26 14:40
Mthuli Ncube,Nombulelo Gumata,Eliphas Ndouan be terminated at any time. The key feature of our algorithm is that it minimises the number of satisfiability tests and thus speeds up the computation. The algorithm is applicable to an arbitrary constraint domain. We benchmark our algorithm against the state-of-the-art algorithm Marco on the Boo作者: ABASH 時間: 2025-3-26 18:41
https://doi.org/10.1007/978-3-030-97212-7ss initiates queries to its “environment” (which may contain multiple threads). Those queries are answered by sequential verification, if the environment consists of a single thread, or, otherwise, by applying the same hierarchical algorithm on the environment. Our technique is fully automatic, and 作者: Confirm 時間: 2025-3-26 21:10 作者: abysmal 時間: 2025-3-27 01:40
DeepSafe: A Data-Driven Approach for Assessing Robustness of Neural Networkson are guaranteed to be classified correctly. We also introduce the concept of ., which ensures that the neural network is guaranteed not to misclassify inputs within a region to a specific target (adversarial) label. We evaluate DeepSafe on a neural network implementation of a controller for the ne作者: 孵卵器 時間: 2025-3-27 08:06 作者: Carcinogen 時間: 2025-3-27 11:45
Robustness Testing of Intermediate Verifiersf robustness in the verifier. We implemented our technique in a tool called . ., which operates on programs written in the popular Boogie language for verification—used as intermediate representation in numerous program verifiers. Experiments targeting 135 Boogie programs indicate that brittle behav作者: 血統(tǒng) 時間: 2025-3-27 15:43 作者: 修正案 時間: 2025-3-27 18:56 作者: entrance 時間: 2025-3-28 00:11
Recursive Online Enumeration of All Minimal Unsatisfiable Subsetsan be terminated at any time. The key feature of our algorithm is that it minimises the number of satisfiability tests and thus speeds up the computation. The algorithm is applicable to an arbitrary constraint domain. We benchmark our algorithm against the state-of-the-art algorithm Marco on the Boo作者: outrage 時間: 2025-3-28 04:34
Modular Verification of Concurrent Programs via Sequential Model Checkingss initiates queries to its “environment” (which may contain multiple threads). Those queries are answered by sequential verification, if the environment consists of a single thread, or, otherwise, by applying the same hierarchical algorithm on the environment. Our technique is fully automatic, and 作者: 熱情贊揚 時間: 2025-3-28 06:39 作者: DAFT 時間: 2025-3-28 11:27 作者: ALOFT 時間: 2025-3-28 14:56 作者: 有節(jié)制 時間: 2025-3-28 20:56
What’s to Come is Still Unsureate winning condition permits to specify desirable behavior. The classical model here is the positional game, where both players can (fully or partially) observe the current position in the game graph, which in turn is indicative of their mutual current states. In practice, neither sensing or actuat作者: emission 時間: 2025-3-29 01:48 作者: prodrome 時間: 2025-3-29 07:04
Robustness Testing of Intermediate Verifierse changes considerably with details of how the input program is expressed—details that should be irrelevant, such as the order of independent declarations. Such a lack of robustness frustrates users who have to spend considerable time figuring out a tool’s idiosyncrasies before they can use it effec作者: 淡紫色花 時間: 2025-3-29 09:01
Simulation Algorithms for Symbolic Automatalabeled by predicates over alphabet symbols. In one approach, we build on the algorithm by Ilie, Navaro, and Yu proposed originally for classical finite automata, modifying it using the so-called mintermisation of the transition predicates. This solution, however, generates all Boolean combinations 作者: 檔案 時間: 2025-3-29 13:29
Quantitative Projection Coverage for Testing ML-enabled Autonomous Systemsngineered using data-driven approach. We propose quantitative .-projection coverage as a metric to mediate combinatorial explosion while guiding the data sampling process. By assuming that domain experts propose largely independent environment conditions and by associating elements in each condition作者: Limerick 時間: 2025-3-29 18:11
Recursive Online Enumeration of All Minimal Unsatisfiable Subsetsdesirable to identify the core problems among them. Such cores are called minimal unsatisfiable subsets (MUSes). The more MUSes are identified, the more information about the conflicts among the constraints is obtained. However, a full enumeration of all MUSes is in general intractable due to the la作者: Vertebra 時間: 2025-3-29 21:33 作者: 心胸開闊 時間: 2025-3-30 02:29 作者: 組裝 時間: 2025-3-30 04:02
Bisimilarity Distances?for?Approximate Differential Privacyn probability distributions. We study .-differential privacy in the setting of labelled Markov chains. While the exact differences relevant to .-differential privacy are not computable in this framework, we propose a computable bisimilarity distance that yields a sound technique for measuring ., the作者: 移動 時間: 2025-3-30 12:05 作者: 母豬 時間: 2025-3-30 15:22 作者: 殺人 時間: 2025-3-30 19:09
Quantifiers on Demandhe transition system with theory of Arrays, further complicates the problem by requiring inference and reasoning with universally quantified formulas. In this paper, we present a new algorithm, ., that extends IC3 to infer universally quantified invariants over the combined theory of LIA and Arrays.作者: 厭煩 時間: 2025-3-30 23:25
Signal Convolution Logict the percentage of time a formula is satisfied in a bounded interval. We demonstrate that this new logic is a suitable formalism to effectively express non-functional requirements in Cyber-Physical Systems displaying noisy and irregular behaviours. We define both a qualitative and quantitative sema作者: SOW 時間: 2025-3-31 02:20
Efficient Symbolic Representation of Convex Polyhedra in High-Dimensional Spacesthe ., that is closed under intersection and linear transformations, and allows to check inclusion, equality, and emptiness. The main feature of DCPs lies in their ability to represent concisely polyhedra that can be expressed as combinations of simpler sets, which can overcome combinatorial explosi作者: Infect 時間: 2025-3-31 06:42
Global Governance and State Collapsefy sufficient conditions for efficiently computing optimal proofs. We design and evaluate an algorithm that performs this computation, demonstrating that it can produce optimal proofs for complex formulas in under a second.作者: 合同 時間: 2025-3-31 12:14
Alan Shiell,Hannah Jackson,Penelope Hawele sets constructed by long sequences of manipulations, such as those handled by state-space exploration tools. Their practical efficiency has been evaluated with the help of a prototype implementation, with promising results.作者: 冰雹 時間: 2025-3-31 14:58
