Titlebook: Dependable Software Engineering. Theories, Tools, and Applications; 8th International Sy Wei Dong,Jean-Pierre Talpin Conference proceedings

心胸開闊

古代

Manifest

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

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

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

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

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.

相互影響

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.

半球

coalition

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.