作者: 注意力集中 時(shí)間: 2025-3-21 20:21 作者: 嘮叨 時(shí)間: 2025-3-22 03:05 作者: Reservation 時(shí)間: 2025-3-22 04:55
Robustness Verification of Semantic Segmentation Neural Networks Using Relaxed Reachability of robustness for segmentation, such as the percentage of pixels in the output that can be proven robust under different adversarial perturbations, and a robust variant of intersection-over-union (IoU), the typical performance evaluation measure for segmentation tasks. Our approach is based on a ne作者: 碌碌之人 時(shí)間: 2025-3-22 12:11
PEREGRiNN: Penalized-Relaxation Greedy Neural Network Verifierns of the usual linear constraints, and combine this with a convex objective function that penalizes the discrepancy between the output of each neuron and its relaxation. This convex function is further structured to force the largest relaxations to appear closest to the input layer; this provides t作者: 系列 時(shí)間: 2025-3-22 14:02 作者: 系列 時(shí)間: 2025-3-22 17:10
Summing up Smart Transitions automated reasoners do not provide ways to specify summations of arbitrary length..In this paper, we present a generalization of first-order logic which can express the unbounded sum of balances. We prove the decidablity of one of our extensions and the undecidability of a slightly richer one. We i作者: GUILE 時(shí)間: 2025-3-22 22:04
Stateless Model Checking Under a Reads-Value-From Equivalencepproaches based on Mazurkiewicz and “reads-from” partitionings. Our experimental evaluation reveals that RVF is quite often a very effective equivalence, as the underlying partitioning is exponentially coarser than other approaches. Moreover, . generates representatives very efficiently, as the redu作者: ABOUT 時(shí)間: 2025-3-23 04:53 作者: URN 時(shí)間: 2025-3-23 09:01
Situation der Materialbeschaffung,hms with respect to a small disturbance of noises, derived from the surrounding environment. The effectiveness of our robust bound and algorithm is confirmed by the experimental results, including quantum bits classification as the “Hello World” example, quantum phase recognition and cluster excitat作者: 預(yù)測 時(shí)間: 2025-3-23 12:32 作者: 隱語 時(shí)間: 2025-3-23 16:04 作者: 熔巖 時(shí)間: 2025-3-23 19:56 作者: Bmd955 時(shí)間: 2025-3-24 00:43
https://doi.org/10.1007/978-3-642-99037-3 automated reasoners do not provide ways to specify summations of arbitrary length..In this paper, we present a generalization of first-order logic which can express the unbounded sum of balances. We prove the decidablity of one of our extensions and the undecidability of a slightly richer one. We i作者: oracle 時(shí)間: 2025-3-24 02:29 作者: 鈍劍 時(shí)間: 2025-3-24 08:45
Computer Aided Verification978-3-030-81685-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: PIZZA 時(shí)間: 2025-3-24 10:45
Alexandra Silva,K. Rustan M. LeinoThis book is open access, which means that you have free and unlimited access作者: 先兆 時(shí)間: 2025-3-24 17:45
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233358.jpg作者: Pastry 時(shí)間: 2025-3-24 22:23 作者: 過剩 時(shí)間: 2025-3-25 01:31
978-3-030-81684-1The Editor(s) (if applicable) and The Author(s) 2021作者: 包租車船 時(shí)間: 2025-3-25 07:19 作者: 通知 時(shí)間: 2025-3-25 09:23 作者: 和平主義 時(shí)間: 2025-3-25 14:40 作者: 漫步 時(shí)間: 2025-3-25 15:55 作者: 入會(huì) 時(shí)間: 2025-3-25 21:17
https://doi.org/10.1007/978-3-663-05113-8the .. . first uses . to find potentially faulty network parameters (such as the .) and then performs . using . to apply small modifications to the parameters to remedy the defects. We present novel strategies to enable precise yet efficient repair such as inferring correctness specifications to act作者: 吵鬧 時(shí)間: 2025-3-26 02:18 作者: 壕溝 時(shí)間: 2025-3-26 04:57 作者: 交響樂 時(shí)間: 2025-3-26 10:16
Walter Eversheim,Werner Fischer,Hans Seiferte several challenges. First, verifier developers must contend with the rapidly changing DNN field to support new DNN operations and property types. Second, verifier users have the burden of selecting a verifier input format to specify their problem. Due to the many input formats, this decision can g作者: Missile 時(shí)間: 2025-3-26 15:47
Situation der Materialbeschaffung,assical classifiers and applications to data analytics in quantum physics that can be implemented on the near future quantum computers. However, quantum noise is a major obstacle to the practical implementation of quantum machine learning. In this work, we define a formal framework for the robustnes作者: 表示向前 時(shí)間: 2025-3-26 20:37 作者: Inculcate 時(shí)間: 2025-3-26 21:12 作者: 戲法 時(shí)間: 2025-3-27 01:14 作者: 金絲雀 時(shí)間: 2025-3-27 09:13 作者: chisel 時(shí)間: 2025-3-27 10:28 作者: 禁令 時(shí)間: 2025-3-27 16:08
https://doi.org/10.1007/978-3-658-35568-5 verification. They should define the allowed sequential and relaxed-memory concurrency behaviour of programs, but hitherto there has been no integration of full-scale instruction-set architecture (ISA) semantics with axiomatic concurrency models, either in mathematics or in?tools. These ISA semanti作者: OTHER 時(shí)間: 2025-3-27 20:16 作者: FIN 時(shí)間: 2025-3-28 01:58
Konradin Ferrari d’Occhieppo,Ernst G?belonentially large spaces of thread interleavings, SMC attempts to partition this space into equivalence classes and explore only a few representatives from each class. The efficiency of this approach depends on two factors: (a)?the coarseness of the partitioning, and (b)?the time to generate represen作者: Ambulatory 時(shí)間: 2025-3-28 04:24
NN,: Constraint-Based Repair of?Neural Network Classifiersthe .. . first uses . to find potentially faulty network parameters (such as the .) and then performs . using . to apply small modifications to the parameters to remedy the defects. We present novel strategies to enable precise yet efficient repair such as inferring correctness specifications to act作者: GREEN 時(shí)間: 2025-3-28 07:02
Balancing Automation and Control for Formal Verification of Microprocessorsrmal validation of large scale projects reliable. In this paper, we will describe the current status of formal verification at Centaur Technology. We will explain our challenges and our methodology—how various proofs and verification artifacts are interconnected and how we keep them consistent over 作者: Frequency 時(shí)間: 2025-3-28 14:29 作者: Arrhythmia 時(shí)間: 2025-3-28 14:41 作者: Obliterate 時(shí)間: 2025-3-28 19:12 作者: 寡頭政治 時(shí)間: 2025-3-29 00:10
Automated Safety Verification of Programs Invoking Neural Networkscomponents implemented using diverse technologies. This shortcoming is pinpointed by programs invoking neural networks despite their acclaimed role as innovation drivers across many application areas. In this paper, we embark on the verification of system-level properties for systems characterized b作者: HAVOC 時(shí)間: 2025-3-29 05:19 作者: 強(qiáng)化 時(shí)間: 2025-3-29 11:18
Verisig 2.0: Verification of Neural Network Controllers Using Taylor Model Preconditioningctivations and develop a Taylor-model-based reachability algorithm through Taylor model preconditioning and shrink wrapping. Furthermore, we provide a parallelized implementation that allows Verisig 2.0 to efficiently handle larger NNs than existing tools can. We provide an extensive evaluation over作者: 獸皮 時(shí)間: 2025-3-29 15:29 作者: Grating 時(shí)間: 2025-3-29 16:54
PEREGRiNN: Penalized-Relaxation Greedy Neural Network Verifierted as well as adversarial misclassifications can result in fatal outcomes. As a consequence, techniques of formal verification have been recognized as crucial to the design and deployment of safe NNs. In this paper, we introduce a new approach to formally verify the most commonly considered safety 作者: chronicle 時(shí)間: 2025-3-29 22:24
Isla: Integrating Full-Scale ISA Semantics and Axiomatic Concurrency Models verification. They should define the allowed sequential and relaxed-memory concurrency behaviour of programs, but hitherto there has been no integration of full-scale instruction-set architecture (ISA) semantics with axiomatic concurrency models, either in mathematics or in?tools. These ISA semanti作者: 性別 時(shí)間: 2025-3-30 03:02
Summing up Smart Transitionsgrity of currencies and transactions. For example, the sum of balances should not be changed by a transfer operation. Currencies manipulated by code present a verification challenge to mathematically prove their integrity by reasoning about computer programs that operate over them, e.g., in Solidity作者: 減至最低 時(shí)間: 2025-3-30 04:45
Stateless Model Checking Under a Reads-Value-From Equivalenceonentially large spaces of thread interleavings, SMC attempts to partition this space into equivalence classes and explore only a few representatives from each class. The efficiency of this approach depends on two factors: (a)?the coarseness of the partitioning, and (b)?the time to generate represen作者: Fibrillation 時(shí)間: 2025-3-30 09:03
0302-9743 and synthesis...Part II: complexity and termination; decision procedures and solvers; hardware and model checking; logical foundations; and software verification..This is an open access book..978-3-030-81684-1978-3-030-81685-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Heart-Attack 時(shí)間: 2025-3-30 14:35 作者: colony 時(shí)間: 2025-3-30 19:56
NN,: Constraint-Based Repair of?Neural Network Classifiersttacks. Our evaluation on MNIST and CIFAR-10 models shows that . can improve the accuracy by 45.56% points on poisoned data and 10.40% points on adversarial data. . also provides small improvement in the overall accuracy of models, without requiring new data or re-training.作者: 小說 時(shí)間: 2025-3-30 21:39
Automated Safety Verification of Programs Invoking Neural Networksy interaction between programs and neural networks. Our technique provides a tight two-way integration of a program and a neural-network analysis and is formalized in a general framework based on abstract interpretation. We evaluate its effectiveness on 26 variants of a widely used, restricted autonomous-driving benchmark.作者: 露天歷史劇 時(shí)間: 2025-3-31 02:57 作者: 改正 時(shí)間: 2025-3-31 08:29 作者: 光明正大 時(shí)間: 2025-3-31 12:10 作者: 有特色 時(shí)間: 2025-3-31 16:42
https://doi.org/10.1007/978-3-322-88430-5 10 benchmarks and compare Verisig 2.0 against three state-of-the-art verification tools. We show that Verisig 2.0 is both more accurate and faster, achieving speed-ups of up?to 21x and 268x against different tools, respectively.
