標題: Titlebook: Dependable Software Engineering. Theories, Tools, and Applications; 6th International Sy Jun Pang,Lijun Zhang Conference proceedings 2020 S [打印本頁] 作者: 美麗動人 時間: 2025-3-21 17:49
書目名稱Dependable Software Engineering. Theories, Tools, and Applications影響因子(影響力)
書目名稱Dependable Software Engineering. Theories, Tools, and Applications影響因子(影響力)學科排名
書目名稱Dependable Software Engineering. Theories, Tools, and Applications網(wǎng)絡公開度
書目名稱Dependable Software Engineering. Theories, Tools, and Applications網(wǎng)絡公開度學科排名
書目名稱Dependable Software Engineering. Theories, Tools, and Applications被引頻次
書目名稱Dependable Software Engineering. Theories, Tools, and Applications被引頻次學科排名
書目名稱Dependable Software Engineering. Theories, Tools, and Applications年度引用
書目名稱Dependable Software Engineering. Theories, Tools, and Applications年度引用學科排名
書目名稱Dependable Software Engineering. Theories, Tools, and Applications讀者反饋
書目名稱Dependable Software Engineering. Theories, Tools, and Applications讀者反饋學科排名
作者: 蠟燭 時間: 2025-3-21 20:59
https://doi.org/10.1007/978-4-431-54553-8mula . can be equivalently transformed into a 2-way (or, stuttering) alternating finite automaton with . states. Subsequently, one can convert it to a 1-way nondeterministic finite automaton with . states.作者: 全部 時間: 2025-3-22 02:49
The Use-it-Wisely (UIW) Approach the CSP models. We have implemented our technique on MPI-SV and evaluated it on 10 real-world MPI programs . deadlock freedom. The experimental results demonstrate the effectiveness of our verification method.作者: olfction 時間: 2025-3-22 07:42 作者: 吞沒 時間: 2025-3-22 09:52 作者: altruism 時間: 2025-3-22 14:19
Symbolic Verification of MPI Programs with Non-deterministic Synchronizations, the CSP models. We have implemented our technique on MPI-SV and evaluated it on 10 real-world MPI programs . deadlock freedom. The experimental results demonstrate the effectiveness of our verification method.作者: altruism 時間: 2025-3-22 20:56
https://doi.org/10.1007/978-4-431-54511-8ignificantly less prone to exponential increase of time required by . to detect violations: in very large systems both “wide” and “narrow” violations are found up?to 600 times faster and for extremely large systems when . timeouts, our heuristics are successful in finding violations.作者: facetious 時間: 2025-3-22 23:55
Determinants of Cultural Evolutionary Ratesbling its solution via off-the-shelf SMT solvers. We implement the algorithm and provide the first tool . for the reachability problem of OCA. The experimental results demonstrate the efficacy of our approach.作者: PALSY 時間: 2025-3-23 03:18 作者: ADORE 時間: 2025-3-23 06:48
Computing Linear Arithmetic Representation of Reachability Relation of One-Counter Automata,bling its solution via off-the-shelf SMT solvers. We implement the algorithm and provide the first tool . for the reachability problem of OCA. The experimental results demonstrate the efficacy of our approach.作者: 和平 時間: 2025-3-23 12:08 作者: 中古 時間: 2025-3-23 16:36
https://doi.org/10.1007/978-981-15-6430-7xpressiveness, and we can derive coarse-grained judgments from fine-grained ones. In comparison, the fine-grained logic is more useful for fine-grained specifications. We use a toy language to demonstrate our results and formalize all definitions and proofs in Coq (.).作者: Microaneurysm 時間: 2025-3-23 20:01
https://doi.org/10.1007/978-4-431-54553-8l checking, and identifying which SDD operations form a performance bottleneck..Experiments on 707 benchmarks, written in various specification languages, show that SDD often use an order of magnitude less memory than BDDs, at the expense of a smaller slowdown in runtime performance.作者: TIGER 時間: 2025-3-23 23:23
Reentrancy? Yes. Reentrancy Bug? No.,xpressiveness, and we can derive coarse-grained judgments from fine-grained ones. In comparison, the fine-grained logic is more useful for fine-grained specifications. We use a toy language to demonstrate our results and formalize all definitions and proofs in Coq (.).作者: 排他 時間: 2025-3-24 04:26 作者: Statins 時間: 2025-3-24 07:38 作者: 競選運動 時間: 2025-3-24 13:15
Simo-Pekka Leino,Susanna Aromaa,Kaj Helinller-NN and barrier-NN simultaneously, achieving verification-in-the-loop synthesis. We provide a prototype tool . with a number of case studies. Preliminary experiment results confirm the feasibility and efficacy of our approach.作者: 不能強迫我 時間: 2025-3-24 15:35
Conference proceedings 2020 November 2020. ..The 10 full and 1 short paper included in this volume were carefully reviewed and selected from 20 submissions. They deal with latest research results and ideas on bridging the gap between formal methods and software engineering.?.作者: temperate 時間: 2025-3-24 22:11 作者: 有抱負者 時間: 2025-3-25 00:51 作者: 的是兄弟 時間: 2025-3-25 04:03
Modelling and Implementation of Unmanned Aircraft Collision Avoidance,mportant and valuable. An ideal collision avoidance system gives the aircraft an optimal strategy for choosing flight actions to avoid collision risks when it detects other aircraft nearby. Currently the general approach to generating collision avoidance logics is to model the problem as a partially作者: outset 時間: 2025-3-25 08:20 作者: 控訴 時間: 2025-3-25 14:30
Computing Linear Arithmetic Representation of Reachability Relation of One-Counter Automata,shown to be NP-complete when the integers in the OCA are encoded in binary. In this paper, we study the problem of computing the reachability relation of OCA. We show that, for each OCA, an existential Presburger arithmetic (EPA) formula of polynomial size can be computed in polynomial time to repre作者: Cytokines 時間: 2025-3-25 18:23
Compiling FL, on Finite Words,mulas (FL for short) is the core part of PSL, which has once been an industrial standard of specification language accepted by IEEE, and has now been adopted in SystemVerilog. We in this paper present a variant of FL, called FL., whose semantics is defined w.r.t. finite words. In comparison to the o作者: 的’ 時間: 2025-3-25 23:19
Symbolic Model Checking with Sentential Decision Diagrams,BDD). The SDD data structure can be up?to exponentially more succinct than BDDs, using a generalized notion of variable order called a variable tree (“vtree”). We also contribute to the practice of SDDs, giving a novel heuristic for constructing a vtree that minimizes SDD size in the context of mode作者: 臥虎藏龍 時間: 2025-3-26 03:52
Probably Approximately Correct Interpolants Generation,y correct (PAC) learning. The computed interpolant is termed as a PAC interpolant with respect to a violation level . and confidence level .: with at least . confidence, the probability that the PAC interpolant is a true interpolant is larger than .. Unlike classical interpolants which are used to j作者: 恃強凌弱 時間: 2025-3-26 05:28 作者: Canvas 時間: 2025-3-26 10:24
Learning Safe Neural Network Controllers with Barrier Certificates,rs are based on neural networks (NNs). To certify the safety property we utilize barrier functions, which are also represented by NNs. We train controller-NN and barrier-NN simultaneously, achieving verification-in-the-loop synthesis. We provide a prototype tool . with a number of case studies. Prel作者: 一小塊 時間: 2025-3-26 15:24
Software Defect-Proneness Prediction with Package Cohesion and Coupling Metrics Based on Complex Neifficult for programmers to be thoughtful when modifying code, increasing the risk of defects. In an object-oriented software system, packages take the role of a middle tier that aggregates classes and limits class access. However, as the software system evolves, the logic and correctness of package作者: 殘忍 時間: 2025-3-26 17:22 作者: Munificent 時間: 2025-3-27 00:43 作者: ATP861 時間: 2025-3-27 02:07 作者: ORE 時間: 2025-3-27 06:47
https://doi.org/10.1007/978-4-431-54511-8m walks. Our memory-less heuristics . (RET) and . (RCF) provide efficient and highly scalable methods for counterexample detection. Both RET and RCF operate on concrete states and are relieved from expensive computations of symbolic abstractions. We compare the most promising variants of RET and RCF作者: 神化怪物 時間: 2025-3-27 10:23
Determinants of Cultural Evolutionary Ratesshown to be NP-complete when the integers in the OCA are encoded in binary. In this paper, we study the problem of computing the reachability relation of OCA. We show that, for each OCA, an existential Presburger arithmetic (EPA) formula of polynomial size can be computed in polynomial time to repre作者: Lacerate 時間: 2025-3-27 13:41
https://doi.org/10.1007/978-4-431-54553-8mulas (FL for short) is the core part of PSL, which has once been an industrial standard of specification language accepted by IEEE, and has now been adopted in SystemVerilog. We in this paper present a variant of FL, called FL., whose semantics is defined w.r.t. finite words. In comparison to the o作者: 曲解 時間: 2025-3-27 20:22
https://doi.org/10.1007/978-4-431-54553-8BDD). The SDD data structure can be up?to exponentially more succinct than BDDs, using a generalized notion of variable order called a variable tree (“vtree”). We also contribute to the practice of SDDs, giving a novel heuristic for constructing a vtree that minimizes SDD size in the context of mode作者: Awning 時間: 2025-3-28 00:10 作者: 政府 時間: 2025-3-28 02:09
The Use-it-Wisely (UIW) Approachentations of message passing operations, which introduces non-deterministic synchronizations that challenge the correctness of MPI programs. We present in this paper a symbolic method for verifying the MPI programs with non-deterministic synchronizations. Insides the method, we propose a path-level 作者: multiply 時間: 2025-3-28 09:32 作者: 開花期女 時間: 2025-3-28 13:58
G?ran Granholm,Stefan N. Gr?sserifficult for programmers to be thoughtful when modifying code, increasing the risk of defects. In an object-oriented software system, packages take the role of a middle tier that aggregates classes and limits class access. However, as the software system evolves, the logic and correctness of package作者: gerontocracy 時間: 2025-3-28 16:52
Dependable Software Engineering. Theories, Tools, and Applications978-3-030-62822-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: vascular 時間: 2025-3-28 21:44 作者: majestic 時間: 2025-3-29 00:21 作者: 占線 時間: 2025-3-29 03:44
Jean Mulder,Cara Penry WilliamsThis paper reports on recent research advances in supervisor synthesis, as well as industrial applications and future research challenges, especially in the context of a research project funded by Rijkswaterstaat, responsible for the construction and maintenance of infrastructure in the Netherlands.作者: 摻假 時間: 2025-3-29 10:02 作者: 同步左右 時間: 2025-3-29 11:41
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/265726.jpg
