標(biāo)題: Titlebook: Dependable Software Engineering. Theories, Tools, and Applications; 8th International Sy Wei Dong,Jean-Pierre Talpin Conference proceedings [打印本頁] 作者: 貧血 時(shí)間: 2025-3-21 18:24
書目名稱Dependable Software Engineering. Theories, Tools, and Applications影響因子(影響力)
書目名稱Dependable Software Engineering. Theories, Tools, and Applications影響因子(影響力)學(xué)科排名
書目名稱Dependable Software Engineering. Theories, Tools, and Applications網(wǎng)絡(luò)公開度
書目名稱Dependable Software Engineering. Theories, Tools, and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Dependable Software Engineering. Theories, Tools, and Applications被引頻次
書目名稱Dependable Software Engineering. Theories, Tools, and Applications被引頻次學(xué)科排名
書目名稱Dependable Software Engineering. Theories, Tools, and Applications年度引用
書目名稱Dependable Software Engineering. Theories, Tools, and Applications年度引用學(xué)科排名
書目名稱Dependable Software Engineering. Theories, Tools, and Applications讀者反饋
書目名稱Dependable Software Engineering. Theories, Tools, and Applications讀者反饋學(xué)科排名
作者: output 時(shí)間: 2025-3-22 00:01
Wake Instabilities Behind Bluff Bodieselopers to virtually completely rewrite matrix-related scripts when switching to a new matrix model. To address these problems, herein we undertake the following. First, we propose a unified matrix interface and integrate existing formal matrix models in the Coq community based on this interface. Se作者: CANE 時(shí)間: 2025-3-22 02:25 作者: 狗舍 時(shí)間: 2025-3-22 08:27
Dependable Software Engineering. Theories, Tools, and Applications8th International Sy作者: Neolithic 時(shí)間: 2025-3-22 10:23 作者: 出生 時(shí)間: 2025-3-22 14:42
Integration of?Multiple Formal Matrix Models in?Coqelopers to virtually completely rewrite matrix-related scripts when switching to a new matrix model. To address these problems, herein we undertake the following. First, we propose a unified matrix interface and integrate existing formal matrix models in the Coq community based on this interface. Se作者: 出生 時(shí)間: 2025-3-22 17:37
On-The-Fly Bisimilarity Checking for?Fresh-Register Automatamarks its efficiency compared to existing algorithms and tools. We moreover implement a translation from .-calculus processes to fresh-register automata, and use the latter to obtain a prototype (strong early) bisimilarity checking tool for finitary .-calculus processes.作者: 發(fā)出眩目光芒 時(shí)間: 2025-3-22 21:15 作者: 褻瀆 時(shí)間: 2025-3-23 04:52
: Towards Mutation Testing of?Unsupervised Learning Systemsata and playing an increasingly critical role in many fields. Therefore, more and more attention has been paid to the security and stability of UL systems. Testing has achieved great success in ensuring the safety of traditional software systems and been gradually applied to supervised learning. How作者: 落葉劑 時(shí)間: 2025-3-23 07:07 作者: 蔓藤圖飾 時(shí)間: 2025-3-23 10:34 作者: Generator 時(shí)間: 2025-3-23 15:30
Mastery: Shifted-Code-Aware Structured Mergingsed structured approaches have shown advantages in enhancing merge accuracy. Prior structured merging approaches visit abstract syntax trees in a top-down manner, which is hard to detect and merge shifted code in the general sense. This paper presents a novel methodology combining a top-down and a b作者: 愛管閑事 時(shí)間: 2025-3-23 20:51
KCL: A Declarative Language for?Large-Scale Configuration and?Policy Managementple, delivering and managing complex service mesh and various cloud-native technologies, supporting a variety of operations on infrastructures, such as database, load balancer, dynamic configuration, etc, configuring monitoring for all types of applications, and arranging a range of variety of servi作者: 仇恨 時(shí)間: 2025-3-23 23:46 作者: CROAK 時(shí)間: 2025-3-24 04:03 作者: 商業(yè)上 時(shí)間: 2025-3-24 08:28
A Contract-Based Semantics and?Refinement for?Simulinkte-time and continuous-time blocks. To analyze complex block diagrams, a semantics to support compositional reasoning and verification is required. Contract-based modelling provides good compositional reasoning about complex systems. In this paper, we present a . for Simulink to formalise the semant作者: LEVY 時(shí)間: 2025-3-24 12:11 作者: neolith 時(shí)間: 2025-3-24 16:55
Integration of?Multiple Formal Matrix Models in?Coqystem behaviors related to matrix operations. The Coq community has proposed at least five formal matrix models, although the Coq standard library does not implement them. Developers who require a formal matrix library could have difficulty choosing what model to use. More importantly, once a choice作者: 流行 時(shí)間: 2025-3-24 21:39
On-The-Fly Bisimilarity Checking for?Fresh-Register Automataegisters where it can store data values and compare them with others from the input. Fresh-register automata are additionally able to accept a given data value just if it is fresh in the computation history. The bisimilarity problem for fresh-register automata is known to be in NP, when empty regist作者: 不怕任性 時(shí)間: 2025-3-25 01:00 作者: BACLE 時(shí)間: 2025-3-25 04:43 作者: 嚴(yán)厲批評(píng) 時(shí)間: 2025-3-25 10:15 作者: 感情 時(shí)間: 2025-3-25 13:28
: A Coq Library for?Logicsan easily formalize a standard soundness proof or a Henkin-style completeness proof for logics like classical/intuitionistic propositional logic, separation logic and modal logic with .’s help. In this paper, we present how compositional and portable proof engineering is possible in ..作者: 加劇 時(shí)間: 2025-3-25 16:26
0302-9743 with 3 abstracts of keynote speeches. They deal with latest research results and ideas on bridging the gap between formal methods and software engineering..978-3-031-21212-3978-3-031-21213-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Herbivorous 時(shí)間: 2025-3-25 20:43 作者: Bridle 時(shí)間: 2025-3-26 01:48 作者: ERUPT 時(shí)間: 2025-3-26 08:00
Ben van Vianen,Anthony van Raan and KMNC) much finer. Meanwhile, HashC reduces the time complexity of combinatorial coverage testing from polynomial time to linear time. Our experiments show that, 1) the HashC criteria are finer than existing mainstream coverage criteria, 2) HashC greatly accelerates combinatorial coverage testing and can handle the testing of large-scale DNNs.作者: consolidate 時(shí)間: 2025-3-26 12:05 作者: 一加就噴出 時(shí)間: 2025-3-26 13:20 作者: 藝術(shù) 時(shí)間: 2025-3-26 19:09 作者: 心胸開闊 時(shí)間: 2025-3-26 21:24 作者: 古代 時(shí)間: 2025-3-27 02:53 作者: Manifest 時(shí)間: 2025-3-27 07:03
HashC: Making DNNs’ Coverage Testing Finer and?Faster and KMNC) much finer. Meanwhile, HashC reduces the time complexity of combinatorial coverage testing from polynomial time to linear time. Our experiments show that, 1) the HashC criteria are finer than existing mainstream coverage criteria, 2) HashC greatly accelerates combinatorial coverage testing and can handle the testing of large-scale DNNs.作者: nocturnal 時(shí)間: 2025-3-27 11:24
VM Migration and?Live-Update for?Reliable Embedded Hypervisoring fault recovery, this paper implements a hypervisor live-update mechanism to complete fault recovery while avoiding migration network delays. Test results show that these mechanisms combine reliability and operational efficiency to meet the needs of embedded applications.作者: SHRIK 時(shí)間: 2025-3-27 15:01
Mastery: Shifted-Code-Aware Structured Merging-time. Compared with four representative merge tools in 40,533 real-world merge scenarios, our approach achieves the highest merge accuracy and 2.4. as fast as a state-of-the-art structured merge tool.作者: ALE 時(shí)間: 2025-3-27 20:30
EqFix: Fixing LaTeX Equation Errors by?Exampless. An extension of relaxers is also introduced to enhance the practicality of EqFix. We evaluate EqFix on real-world examples and find that it can synthesize rules with high generalization ability. Compared with a state-of-the-art string transformation synthesizer, EqFix solved 37% more cases and spent less than half of their synthesis time.作者: assail 時(shí)間: 2025-3-27 23:11
A Contract-Based Semantics and?Refinement for?Simulinkfive operations on contracts, which are sequential composition, parallel composition, feedback composition, variable renaming, and variable hiding. We then define the . relation among the Simulink diagrams.作者: 相互影響 時(shí)間: 2025-3-28 03:06
Decidability of?Liveness for?Concurrent Objects on?the?TSO Memory Modelins open. In this paper we address this problem for the Total Store Order (TSO) memory model, as found in the x86 architecture. We prove that lock-freedom, wait-freedom, deadlock-freedom and starvation-freedom are undecidable on TSO for a bounded number of processes, while obstruction-freedom is decidable.作者: 半球 時(shí)間: 2025-3-28 09:57 作者: coalition 時(shí)間: 2025-3-28 11:39
Basic Modes of Motion in Polymersand the physical. To address this, a modeling language for CPS based on shared variables is proposed. In this paper, we present an implementation of this language in SpaceEx. Thus, a bridge between our language and hybrid automata is established.作者: Peak-Bone-Mass 時(shí)間: 2025-3-28 17:13 作者: 向下五度才偏 時(shí)間: 2025-3-28 19:44 作者: 背景 時(shí)間: 2025-3-29 02:18 作者: nascent 時(shí)間: 2025-3-29 05:33 作者: Goblet-Cells 時(shí)間: 2025-3-29 10:47
Hariolf Grupp,Edo Albrecht,Knut Koschatzkyresponding mutation scores. Further, we combine the proposed technique with autoencoder for generating adversarial samples. In the evaluation phase, we demonstrate the practicability of the proposed technique based on three datasets.作者: 大看臺(tái) 時(shí)間: 2025-3-29 14:06 作者: 無彈性 時(shí)間: 2025-3-29 17:33
https://doi.org/10.1007/978-3-031-21213-0architecting; architecture verification and validation; artificial intelligence; automation; computation作者: 幸福愉悅感 時(shí)間: 2025-3-29 22:52
978-3-031-21212-3The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: 拱墻 時(shí)間: 2025-3-30 02:33
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/265730.jpg作者: Institution 時(shí)間: 2025-3-30 07:56
Conference proceedings 2022tober 2022..The 11 full papers and 3 short papers in this volume were carefully reviewed and selected from 29 submissions, and are presented with 3 abstracts of keynote speeches. They deal with latest research results and ideas on bridging the gap between formal methods and software engineering..作者: yohimbine 時(shí)間: 2025-3-30 09:04
Dependable Software Engineering. Theories, Tools, and Applications978-3-031-21213-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 剛開始 時(shí)間: 2025-3-30 13:27 作者: 束以馬具 時(shí)間: 2025-3-30 17:10
