標(biāo)題: Titlebook: Automated Technology for Verification and Analysis; 20th International S Ahmed Bouajjani,Luká? Holík,Zhilin Wu Conference proceedings 2022 [打印本頁] 作者: Orthosis 時間: 2025-3-21 16:48
書目名稱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é)科排名
作者: 增長 時間: 2025-3-21 23:07
Nada K. Kakabadse,Eddy Louchartof concrete random testing and symbolic execution) as an input generation technique and thereby allowing parts of the input format to remain unspecified (i.e. unconstrained) symbolic values. For this purpose, we present SISL, a domain-specific language for creating partial input specifications for structured binary input formats.作者: Expertise 時間: 2025-3-22 01:00
https://doi.org/10.1007/978-3-662-46479-3uation over a wide range of benchmarks shows that it vastly improves the performance of the solver for satisfiable non-linear arithmetic formulas, significantly outperforming other available tools for problems with transcendental functions.作者: 放大 時間: 2025-3-22 08:00
https://doi.org/10.1007/978-3-662-46479-3ntiate our definitions for .-regular properties and give automata-based constructions for our approach. Checking that an .-regular property qualifies as a cause can then be encoded as a hyperproperty model-checking problem.作者: languid 時間: 2025-3-22 09:54
Dynamic Shielding for?Reinforcement Learning in?Black-Box Environments variant of the RPNI algorithm and suppresses undesired explorations due to the shield constructed from the learned model. Through this combination, potentially unsafe actions can be foreseen before the agent experiences them. Experiments show that our dynamic shield significantly decreases the number of undesired events during training.作者: 聯(lián)邦 時間: 2025-3-22 16:57
SISL: Concolic Testing of?Structured Binary Input Formats via?Partial Specificationof concrete random testing and symbolic execution) as an input generation technique and thereby allowing parts of the input format to remain unspecified (i.e. unconstrained) symbolic values. For this purpose, we present SISL, a domain-specific language for creating partial input specifications for structured binary input formats.作者: Adornment 時間: 2025-3-22 18:40 作者: 發(fā)誓放棄 時間: 2025-3-22 22:49
Temporal Causality in?Reactive Systemsntiate our definitions for .-regular properties and give automata-based constructions for our approach. Checking that an .-regular property qualifies as a cause can then be encoded as a hyperproperty model-checking problem.作者: Bmd955 時間: 2025-3-23 02:34
0302-9743 VA 2022, held in Beiging, China in October 2022. The symposium is dedicated to promoting research in theoretical and practical aspects of automated analysis, verification and synthesis by providing an international venue for the researchers to present new results. The 21 regular papers presented tog作者: 小木槌 時間: 2025-3-23 06:15 作者: Digest 時間: 2025-3-23 10:55 作者: wreathe 時間: 2025-3-23 15:45
Conference proceedings 2022eld in Beiging, China in October 2022. The symposium is dedicated to promoting research in theoretical and practical aspects of automated analysis, verification and synthesis by providing an international venue for the researchers to present new results. The 21 regular papers presented together with作者: aspect 時間: 2025-3-23 18:05
https://doi.org/10.1007/978-3-662-46479-3 control update policies. In particular, we propose a joint encoding of control and scheduling behaviour as a satisfiability-modulo-theory formulation and a novel abstraction-refinement procedure with incremental solving to scale the analysis. Case studies with realistic systems show the utility of our approach.作者: 移動 時間: 2025-3-24 00:51 作者: Distribution 時間: 2025-3-24 05:21
Checking Scheduling-Induced Violations of?Control Safety Properties control update policies. In particular, we propose a joint encoding of control and scheduling behaviour as a satisfiability-modulo-theory formulation and a novel abstraction-refinement procedure with incremental solving to scale the analysis. Case studies with realistic systems show the utility of our approach.作者: Resign 時間: 2025-3-24 07:23 作者: 彎彎曲曲 時間: 2025-3-24 13:35 作者: 饒舌的人 時間: 2025-3-24 17:07 作者: 善于 時間: 2025-3-24 21:26 作者: 冒失 時間: 2025-3-25 00:04
Fence Synthesis Under the?C11 Memory Model. We additionally propose a near-optimal efficient alternative called .. We prove the optimality of . and the soundness of . and present an implementation of both techniques. Finally, we contrast the performance of the two techniques and empirically demonstrate . effectiveness.作者: MOAN 時間: 2025-3-25 06:33
Resources for Global Ethics Educationquence of monitorable observations whether the system is about to exit the ODD. We particularly investigate the learning of optimal monitors based on counterexample-guided refinement and conformance testing. We evaluate the applicability of our approach on a case study from the domain of autonomous 作者: 我們的面粉 時間: 2025-3-25 08:20
Global Effects of Environmental Pollutionns to scalar rewards exists” remained unresolved..This paper presents an impossibility result implying that any attempt to use Rabin automata directly (without extra memory) for model-free RL is bound to fail. To establish this result, we show a link between a class of automata enabling memoryless r作者: 不確定 時間: 2025-3-25 11:38
S. Fred Singer (Deputy Assistant Secretary)ontract patterns. Our contract patterns together with the invariant derivation enable systematic reuse of manually defined hybrid contracts and invariants and reduce the manual effort of the deductive verification process for intelligent hybrid systems.作者: Gyrate 時間: 2025-3-25 17:52 作者: RADE 時間: 2025-3-25 23:06
https://doi.org/10.1007/978-3-662-46479-3rantees an upper bound of the projected model count. Theoretically, a UBS can be exponentially smaller than the smallest independent support. Our experiments show that even otherwise, UBS-based projected counting can be faster than independent support-based projected counting, while yielding bounds 作者: 法律的瑕疵 時間: 2025-3-26 01:01
https://doi.org/10.1007/978-3-662-46479-3 languages in the classes. Our results refer to the basic minimization problem as well as to its extension to transition-based and GFG automata. In some cases, we provide bounds, and in others we provide connections between the different settings. Thus, our results are of practical interest and also作者: Dealing 時間: 2025-3-26 04:49
Automated Technology for Verification and Analysis20th International S作者: 送秋波 時間: 2025-3-26 09:17 作者: Bph773 時間: 2025-3-26 15:37 作者: 罵人有污點 時間: 2025-3-26 19:48 作者: 吞吞吐吐 時間: 2025-3-26 23:37 作者: 不適當(dāng) 時間: 2025-3-27 05:02
Projected Model Counting: Beyond Independent Supportrantees an upper bound of the projected model count. Theoretically, a UBS can be exponentially smaller than the smallest independent support. Our experiments show that even otherwise, UBS-based projected counting can be faster than independent support-based projected counting, while yielding bounds 作者: CRUC 時間: 2025-3-27 07:50 作者: obeisance 時間: 2025-3-27 13:00
Resources for Global Ethics Educationon, and control. The use of ML components is projected to grow and with it the concern of using these components in systems that operate in safety-critical settings. To guarantee a safe operation of autonomous systems, it is important to run an ML component in its operational design domain (ODD), i.作者: 和音 時間: 2025-3-27 17:31 作者: 可用 時間: 2025-3-27 19:20 作者: LAVA 時間: 2025-3-28 00:51
S. Fred Singer (Deputy Assistant Secretary)n requires abstract formal descriptions, e.g. properties, contracts, and invariants. Defining these requires a high level of expertise and an enormous amount of manual effort, in particular if the system contains intelligent components such as reinforcement learning agents. In this paper, we propose作者: quiet-sleep 時間: 2025-3-28 03:44 作者: 徹底檢查 時間: 2025-3-28 07:14 作者: TAP 時間: 2025-3-28 12:52
https://doi.org/10.1007/978-3-662-46479-3eadline, policies for handling deadline miss – . delayed scheduling of the task instance – may still lead the CPS into an unsafe or sub-optimal state. We present a technique for . checking of such control safety and reachability properties, for a class of CPS, under common deadline miss handling and作者: 因無茶而冷淡 時間: 2025-3-28 17:30
https://doi.org/10.1007/978-3-662-46479-3 presence of partial knowledge about the observed run, particularly where input values may not be precise or may not be observed at all. We also allow declaring assumptions on the execution which permits to obtain more precise verdicts also under imprecise inputs. We encode the specification into a 作者: defile 時間: 2025-3-28 20:37
https://doi.org/10.1007/978-3-662-46479-3ls augmented with transcendental functions. Our procedure is based on the fruitful combination of two main ingredients: unconstrained optimisation, to generate a set of candidate solutions, and a result from topology called the topological degree test to check whether a given bounded region contains作者: finale 時間: 2025-3-28 23:09
https://doi.org/10.1007/978-3-662-46479-3propose a general approach, obtained by combining two ingredients: exploration of a finite instance, to obtain candidate inductive invariants, and instantiation-based techniques to discharge quantified queries. A thorough experimental evaluation on a wide range of benchmarks demonstrates the general作者: 初學(xué)者 時間: 2025-3-29 03:26 作者: CURT 時間: 2025-3-29 09:12
https://doi.org/10.1007/978-3-662-46479-3 complexity of minimzation for . automata, where acceptance is defined with respect to the set of transitions that a run traverses infinitely often, and minimization for . (GFG) automata, where nondeterminism is allowed, yet has to be resolved in a way that only depends on the past. Of special inter作者: 槍支 時間: 2025-3-29 14:29 作者: Noctambulant 時間: 2025-3-29 18:42
https://doi.org/10.1007/978-3-662-46479-3 longest witness traces. We consider totally ordered weight domains which have important applications, e.g. in network verification, and achieve a speedup of two orders of magnitude compared to the state-of-the-art tool WALi. Our tool further extends the state of the art by supporting the generation作者: incision 時間: 2025-3-29 20:32
Automated Technology for Verification and Analysis978-3-031-19992-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 失望未來 時間: 2025-3-30 02:02
https://doi.org/10.1007/978-3-031-19992-9architecting; architecture verification and validation; artificial intelligence; automata; automata theo作者: SIT 時間: 2025-3-30 08:04 作者: 流逝 時間: 2025-3-30 11:03 作者: 挑剔為人 時間: 2025-3-30 14:28 作者: Excitotoxin 時間: 2025-3-30 17:14
Dynamic Shielding for?Reinforcement Learning in?Black-Box Environmentsve been various proposals to reduce undesired behaviors during learning, most of these techniques require prior system knowledge, and their applicability is limited. This paper aims to reduce undesired behaviors during learning without requiring . prior system knowledge. We propose .: an extension o
