標(biāo)題: Titlebook: Dependable Software Engineering: Theories, Tools, and Applications; Second International Martin Fr?nzle,Deepak Kapur,Naijun Zhan Conference [打印本頁] 作者: Tamoxifen 時(shí)間: 2025-3-21 17:37
書目名稱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é)科排名
作者: 急急忙忙 時(shí)間: 2025-3-21 22:38 作者: Indict 時(shí)間: 2025-3-22 03:58 作者: 陰謀小團(tuán)體 時(shí)間: 2025-3-22 07:51 作者: BUST 時(shí)間: 2025-3-22 09:52 作者: 急性 時(shí)間: 2025-3-22 16:58
Lines of Developments of Synergeticsance. We observe that model-checking such requirements for probabilistic timed automata can be reduced to checking reward-bounded properties on Markov decision processes. This is traditionally implemented by unfolding the model according to the bound, or by solving a sequence of linear programs. Nei作者: 急性 時(shí)間: 2025-3-22 17:48
https://doi.org/10.1007/978-3-642-67592-8ition of its requirement specification. In this paper, we present an approach that, given a Java program and a partial requirement specification written using the Java Modeling Language, constructs a semantic slice. In the slice, the parts of the program irrelevant w.r.t. the partial requirements ar作者: LIEN 時(shí)間: 2025-3-23 00:13
Lines of Developments of Synergeticsworse, parameterizing model checking by memory consistency models, that is, to make the model checker as flexible as we can supply definitions of memory consistency models as an input, intensifies state explosion. This paper explores specific reasons for state explosion in model checking with multip作者: 蕨類 時(shí)間: 2025-3-23 02:46 作者: 無能力之人 時(shí)間: 2025-3-23 07:58
https://doi.org/10.1007/978-3-642-67592-8 ., the schedulability analysis is decidable. However in reality, it is difficult to calculate the WCET of a complex task, even after it is abstracted to a formal model, e.g., .. This paper proposes a schedulability analysis method without the information of the WCET, by introducing a model named ..作者: MUTED 時(shí)間: 2025-3-23 13:14 作者: flutter 時(shí)間: 2025-3-23 16:32 作者: 幻想 時(shí)間: 2025-3-23 19:14 作者: 橫截,橫斷 時(shí)間: 2025-3-24 00:46 作者: 泰然自若 時(shí)間: 2025-3-24 05:54 作者: chastise 時(shí)間: 2025-3-24 08:06
Overview of Collisional Stellar Dynamics.) framework. Our algorithm extends the persistent set partial order reduction by taking into account system symmetries, and further combines it with lazy predicate abstraction. We have implemented the new verification algorithm in our model checker for .. The experimental evaluation shows that for 作者: 油膏 時(shí)間: 2025-3-24 11:35
Transport Mechanisms at the Magnetopausex engineering systems. In order to facilitate the formal analysis of FT based analyses, a higher-order-logic formalization of FTs has been recently proposed. However, this formalization is quite limited in terms of handling large systems and transformation of FT models into their corresponding Relia作者: harbinger 時(shí)間: 2025-3-24 15:22
Astrophysics and Space Science Libraryla is translated to an almost fully partitioned Büchi automaton which is then composed with the parametric Markov chain. We then reduce the problem to solving an optimisation problem, allowing to decide the satisfaction of the formula using an SMT solver. The algorithm works also for interval Markov作者: Intact 時(shí)間: 2025-3-24 19:04
The Configuration of Dayside Merginged. Formal modeling of such business processes with resource constraints and multiple instances is hard because of the interplay among stochastic behavior, concurrency, real-time and resource contention. In this setting, statistical techniques are easier to use and more scalable than numerical metho作者: 魅力 時(shí)間: 2025-3-25 00:07
https://doi.org/10.1007/978-3-319-47677-3bisimulation; higher-order logic; model checking; quantum programming; software model checking; algorithm作者: Ataxia 時(shí)間: 2025-3-25 06:02
978-3-319-47676-6Springer International Publishing AG 2016作者: CROAK 時(shí)間: 2025-3-25 09:35
Martin Fr?nzle,Deepak Kapur,Naijun ZhanIncludes supplementary material: 作者: 宣傳 時(shí)間: 2025-3-25 15:30
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/265731.jpg作者: 星球的光亮度 時(shí)間: 2025-3-25 19:12 作者: Pigeon 時(shí)間: 2025-3-25 21:15
Place Bisimulation and Liveness for Open Petri Nets, extend Petri nets to model open systems. In Open Petri Nets, the way of interaction is achieved by composing nets. Some places with labels, called open or external, are considered as an interface with environment. Every external places are both input and output ones. Two such open Petri nets can be作者: 現(xiàn)存 時(shí)間: 2025-3-26 02:08
Divergence Detection for CCSL Specification via Clock Causality Chain,ms (MARTE), has now evolved beyond the time specification of MARTE, and has become a full-fledged domain specific modeling language widely used in many domains. A CCSL specification is a set of constraints, which symbolically represents a set of valid clock schedules, where a schedule represents the作者: Nuance 時(shí)間: 2025-3-26 05:06 作者: URN 時(shí)間: 2025-3-26 08:53
GPU-Accelerated Steady-State Computation of Large Probabilistic Boolean Networks,r small PBNs, efficient numerical methods can be successfully applied to perform the computation with the use of Markov chain state transition matrix underlying the studied networks. However, for large PBNs, numerical methods suffer from the state-space explosion problem since the state-space size i作者: BARGE 時(shí)間: 2025-3-26 15:06 作者: TRACE 時(shí)間: 2025-3-26 18:57 作者: 催眠 時(shí)間: 2025-3-26 23:25
Computing Specification-Sensitive Abstractions for Program Verification,ition of its requirement specification. In this paper, we present an approach that, given a Java program and a partial requirement specification written using the Java Modeling Language, constructs a semantic slice. In the slice, the parts of the program irrelevant w.r.t. the partial requirements ar作者: isotope 時(shí)間: 2025-3-27 03:56
Reducing State Explosion for Software Model Checking with Relaxed Memory Consistency Models,worse, parameterizing model checking by memory consistency models, that is, to make the model checker as flexible as we can supply definitions of memory consistency models as an input, intensifies state explosion. This paper explores specific reasons for state explosion in model checking with multip作者: 枯燥 時(shí)間: 2025-3-27 06:06
Identifying XML Schema Constraints Using Temporal Logic,onstraints of XML Schema. The traditional methods for identifying constraints is to develop corresponding algorithms based on the type of constraints. It is inflexible because the constraints may be changed as new Twig pattern optimizing rules are found. Since the constraints of XML Schema mainly de作者: Surgeon 時(shí)間: 2025-3-27 12:38 作者: 熄滅 時(shí)間: 2025-3-27 13:43
Importance Sampling for Stochastic Timed Automata, in stochastic timed automata. By means of symbolic exploration, our framework first identifies states that cannot reach the goal. A state-wise change of measure is then applied on-the-fly during simulations, ensuring that dead ends are never reached. The change of measure is guaranteed by construct作者: 舊式步槍 時(shí)間: 2025-3-27 18:08
Semipositivity in Separation Logic with Two Variables,decidable, where it was shown that even with only two variables, if the use of negations is unrestricted, then they can be nested with separating implication in a complex way to get the undecidability result. In this paper, we revisit the decidability and complexity issues of first-order separation 作者: Loathe 時(shí)間: 2025-3-28 00:48
Distributed Computation of Fixed Points on Dependency Graphs,checking questions, boolean equation systems and other problems can be reduced to fixed-point computations on dependency graphs. We develop a novel distributed algorithm for computing such fixed points, prove its correctness and provide an efficient, open-source implementation of the algorithm. The 作者: fibula 時(shí)間: 2025-3-28 04:46 作者: Flagging 時(shí)間: 2025-3-28 09:56 作者: CLAIM 時(shí)間: 2025-3-28 11:28 作者: 戰(zhàn)役 時(shí)間: 2025-3-28 16:06 作者: 重疊 時(shí)間: 2025-3-28 22:47
An Efficient Synthesis Algorithm for Parametric Markov Chains Against Linear Time Properties,la is translated to an almost fully partitioned Büchi automaton which is then composed with the parametric Markov chain. We then reduce the problem to solving an optimisation problem, allowing to decide the satisfaction of the formula using an SMT solver. The algorithm works also for interval Markov作者: LATE 時(shí)間: 2025-3-28 23:41 作者: 膽小懦夫 時(shí)間: 2025-3-29 04:02 作者: 水土 時(shí)間: 2025-3-29 10:55 作者: Myocarditis 時(shí)間: 2025-3-29 12:38 作者: geriatrician 時(shí)間: 2025-3-29 19:15 作者: 投射 時(shí)間: 2025-3-29 23:41
Mortimer H. Appley,Richard Trumbullclock set built by our proposed algorithm can be used to decide whether the given specification is divergence-freedom or not. The approach is illustrated on one example for architecture-driven analysis.作者: 漸變 時(shí)間: 2025-3-30 03:23
Richard Trumbull,Mortimer H. Appleyecent developments of general purpose graphics processing units (GPUs) provide possibilities to massively parallelise the simulation process. In this work, we propose a?. to accelerate the computation of steady-state probabilities in large PBNs with the use of GPUs. To maximise the computation effic作者: 單獨(dú) 時(shí)間: 2025-3-30 05:37 作者: outskirts 時(shí)間: 2025-3-30 09:34
The Configuration of Dayside Mergingic agents communicating among each other in fixed-duration real-time. Our methodology admits statistical analysis of business processes with provable error bounds. We also illustrate a number of real-life scenarios that can be modeled and verified using this approach.作者: 鄙視 時(shí)間: 2025-3-30 16:24
Dependable Software Engineering: Theories, Tools, and ApplicationsSecond International作者: GROWL 時(shí)間: 2025-3-30 17:40
Lines of Developments of Synergeticse practical performance and scalability of all techniques on a number of case studies from the literature. We show that state elimination can significantly reduce runtime for large models or high bounds.作者: 幻影 時(shí)間: 2025-3-31 00:31
Lines of Developments of Synergeticsying protocols of concurrent copying garbage collection algorithms. To the best of our knowledge, this is the first model checking of the concurrent copying protocols under relaxed memory consistency models.作者: 兵團(tuán) 時(shí)間: 2025-3-31 04:26 作者: CRANK 時(shí)間: 2025-3-31 07:54
Dynamics of Pattern Motion Computation well-known CWB tool. Even though the fixed-point computation, being a P-complete problem, is difficult to parallelize in theory, we achieve significant speed-ups in the performance as demonstrated on a Linux cluster with several hundreds of cores.作者: Insensate 時(shí)間: 2025-3-31 11:38 作者: Pepsin 時(shí)間: 2025-3-31 13:58 作者: Antagonist 時(shí)間: 2025-3-31 19:44
Transport Mechanisms at the Magnetopause are in turn used to formalize other commonly used FT gates, i.e., NAND, NOR, XOR, Inhibit, Comparator and majority Voting, and the formal verification of their failure probability expressions. For illustration purposes, we present a formal failure analysis of a communication gateway software for the next generation air traffic management system.作者: 招致 時(shí)間: 2025-3-31 22:16 作者: Cabg318 時(shí)間: 2025-4-1 02:13
Reducing State Explosion for Software Model Checking with Relaxed Memory Consistency Models,ying protocols of concurrent copying garbage collection algorithms. To the best of our knowledge, this is the first model checking of the concurrent copying protocols under relaxed memory consistency models.作者: Bernstein-test 時(shí)間: 2025-4-1 07:13
Identifying XML Schema Constraints Using Temporal Logic,ed to parent and ancestor nodes, we made some modifications to Computational Tree Logic(CTL) with backward temporal operators, and developed model checking algorithms for automatically identifying XML Schema constraints. Compared with traditional methods, our method is more flexibility.作者: 異常 時(shí)間: 2025-4-1 12:42 作者: 遭遇 時(shí)間: 2025-4-1 15:41
A Complete Approximation Theory for Weighted Transition Systems,entify a complete axiomatization for this logic, thus solving a long-standing open problem in this field. All our results are proven for a class of WTSs without the image-finiteness restriction, a fact that makes this development general and robust.作者: FECT 時(shí)間: 2025-4-1 21:38
Zephyrus2: On the Fly Deployment Optimization Using SMT and CP Technologies,ve problems involving hundreds of components to be deployed on hundreds of virtual machines . This significant speed-up, combined with an improved specification format, enables Zephyrus2 to interactively support on the fly decision making.作者: IRATE 時(shí)間: 2025-4-1 23:06
Formalization of Fault Trees in Higher-Order Logic: A Deep Embedding Approach, are in turn used to formalize other commonly used FT gates, i.e., NAND, NOR, XOR, Inhibit, Comparator and majority Voting, and the formal verification of their failure probability expressions. For illustration purposes, we present a formal failure analysis of a communication gateway software for the next generation air traffic management system.作者: parasite 時(shí)間: 2025-4-2 05:58 作者: 否決 時(shí)間: 2025-4-2 09:10
https://doi.org/10.1007/978-3-642-67592-8r-approximation of the WCET. The system may still be unschedulable under the approximation. A further schedulability checking is then performed by encoding to the reachability problem of .. The methodology is thus sound and complete.作者: Immobilize 時(shí)間: 2025-4-2 14:45 作者: 出沒 時(shí)間: 2025-4-2 17:24
Schedulability Analysis of Timed Regular Tasks by Under-Approximation on WCET,r-approximation of the WCET. The system may still be unschedulable under the approximation. A further schedulability checking is then performed by encoding to the reachability problem of .. The methodology is thus sound and complete.
