標(biāo)題: Titlebook: Computer Aided Verification; 27th International C Daniel Kroening,Corina S. P?s?reanu Conference proceedings 2015 Springer International Pu [打印本頁] 作者: Ensign 時間: 2025-3-21 16:09
書目名稱Computer Aided Verification影響因子(影響力)
作者: BRIDE 時間: 2025-3-21 23:14
On Automation of CTL* Verification for Infinite-State Systemsd uses an internal encoding which facilitates reasoning about the subtle interplay between the nesting of path and state temporal operators that occurs within .. proofs. A precondition synthesis strategy is then used over a program transformation which trades nondeterminism in the transition relatio作者: 不公開 時間: 2025-3-22 00:36
Algorithms for Model Checking HyperLTL and HyperCTL, free fragments of HyperLTL and HyperCTL. the automaton construction allows us to leverage existing model checking technology. Along several case studies, we demonstrate that the approach enables the verification of real hardware designs for properties that could not be checked before. We study infor作者: gruelling 時間: 2025-3-22 07:27 作者: plasma-cells 時間: 2025-3-22 11:51 作者: 揉雜 時間: 2025-3-22 13:10 作者: 揉雜 時間: 2025-3-22 17:34
Skipping Refinementefinement involves defining an abstract, high-level . system and a concrete, low-level . system. One then shows that every behavior allowed by the implementation is also allowed by the specification. Due to the difference in abstraction levels, it is often the case that the implementation requires m作者: intangibility 時間: 2025-3-22 22:31
Percentile Queries in Multi-dimensional Markov Decision Processesuire the analysis of trade-offs. In this paper, we study the complexity of percentile queries in such MDPs and give algorithms to synthesize strategies that enforce such constraints. Given a multi-dimensional weighted MDP and a quantitative payoff function?., thresholds . (one per dimension), and pr作者: LAY 時間: 2025-3-23 02:05
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs-payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, 作者: GOAD 時間: 2025-3-23 09:06
Counterexample Explanation by Learning Small Strategies in Markov Decision Processesly more complex. For instance, a set of erroneous traces with a sufficient cumulative probability mass can be used. Since these are too large objects to understand and manipulate, compact representations such as subchains have been considered. In the case of probabilistic systems with non-determinis作者: BYRE 時間: 2025-3-23 13:15 作者: 受人支配 時間: 2025-3-23 16:50 作者: Between 時間: 2025-3-23 19:40
,: A PRObabilistic ParamEter SYnthesis Toolhe model parameters) for reachability and expected reward objectives. Our tool outperforms state-of-the-art tools and supports the novel feature of conditional probabilities.?PROPhESY supports incremental automatic parameter synthesis (using SMT techniques) to determine “safe” and “unsafe” regions o作者: transdermal 時間: 2025-3-24 02:14
Effective Search-Space Pruning for Solvers of String Equations, Regular Expressions and Length Consttypically support a theory of string equations, the length function as well as the regular-expression membership predicate. These enable considerable expressive power, which comes at the cost of slow solving time, and in some cases even nontermination. We present two techniques, designed for word-ba作者: 相信 時間: 2025-3-24 04:57
Automata-Based Model Counting for String Constraintsvers are essential components of program analysis techniques for detecting and repairing vulnerabilities that are due to string manipulation errors. For quantitative and probabilistic program analyses, checking the satisfiability of a constraint is not sufficient, and it is necessary to count the nu作者: 財主 時間: 2025-3-24 08:42
https://doi.org/10.1007/978-3-319-21690-4artificial intelligence; automata; automata theory; concurrency; formal languages; formal methods; hardwar作者: Absenteeism 時間: 2025-3-24 10:41
978-3-319-21689-8Springer International Publishing Switzerland 2015作者: stress-test 時間: 2025-3-24 18:17
Grammatik von Aufstellungsformen, establishing trust, by designing JSCert in such a way as to provide a strong connection with the JavaScript standard, and by developing JSRef, a reference interpreter which was proved correct with respect to JSCert and tested using the standard Test262 test suite. In this paper, we assess the previ作者: 安撫 時間: 2025-3-24 20:15
Nachrichtentechnische Fachberichted uses an internal encoding which facilitates reasoning about the subtle interplay between the nesting of path and state temporal operators that occurs within .. proofs. A precondition synthesis strategy is then used over a program transformation which trades nondeterminism in the transition relatio作者: ANT 時間: 2025-3-25 00:15
https://doi.org/10.1007/978-3-663-04359-1free fragments of HyperLTL and HyperCTL. the automaton construction allows us to leverage existing model checking technology. Along several case studies, we demonstrate that the approach enables the verification of real hardware designs for properties that could not be checked before. We study infor作者: hemophilia 時間: 2025-3-25 05:42 作者: Gudgeon 時間: 2025-3-25 10:20
Digitale Schaltungen mit Transfluxorenentical contributor processes. Processes communicate through a shared, bounded-value register. While each operation on the register is atomic, there is no synchronization primitive to execute a sequence of operations atomically..We analyze the case in which processes are modeled by finite-state mach作者: FLEET 時間: 2025-3-25 12:32
https://doi.org/10.1007/978-3-663-04359-1ed by arithmetic conditions, the number of processes and faults is parameterized, and the algorithm code is parameterized due to conditions counting the number of received messages. Recently, we introduced a technique that first applies data and counter abstraction and then runs bounded model checki作者: Irrepressible 時間: 2025-3-25 18:35 作者: 現(xiàn)實 時間: 2025-3-25 23:03
Bestimmung des statischen Zustands,uire the analysis of trade-offs. In this paper, we study the complexity of percentile queries in such MDPs and give algorithms to synthesize strategies that enforce such constraints. Given a multi-dimensional weighted MDP and a quantitative payoff function?., thresholds . (one per dimension), and pr作者: 柔美流暢 時間: 2025-3-26 00:11
Systeme mit ?rtlich verteilten Parametern-payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, 作者: glomeruli 時間: 2025-3-26 04:40 作者: 逢迎白雪 時間: 2025-3-26 09:11 作者: deriver 時間: 2025-3-26 14:13
Triebwerks- und Kraftstoffregelsystem,s can often be large, exact or approximate state aggregation methods (such as lumping or bisimulation reduction) have been proposed to improve the scalability of the numerical schemes. However, none of the existing numerical techniques provides general, explicit bounds on the approximation error, a 作者: 索賠 時間: 2025-3-26 18:51 作者: corn732 時間: 2025-3-26 21:25 作者: aesthetician 時間: 2025-3-27 04:44 作者: Needlework 時間: 2025-3-27 08:36
Computer Aided Verification978-3-319-21690-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 不可知論 時間: 2025-3-27 11:05 作者: contrast-medium 時間: 2025-3-27 17:07
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233366.jpg作者: ODIUM 時間: 2025-3-27 18:15
Digitale Schaltungen mit Transfluxorenstate machines is PSPACE-complete, and undecidable for two pushdown machines..For finite-state machines, our proofs characterize infinite behaviors using existential abstraction and semilinear constraints. For pushdown machines, we show how contributor computations of high stack height can be simula作者: hypertension 時間: 2025-3-28 00:17 作者: GLUE 時間: 2025-3-28 02:05 作者: 彎曲道理 時間: 2025-3-28 09:02
F. Bitter,W. E. Adam,H. Geffers,R. Weller decision trees. There are three main consequent advantages of our approach. Firstly, it exploits the quantitative information on states, stressing the more important decisions. Secondly, it leads to a greater variability and degree of freedom in representing the strategies. Thirdly, the representat作者: collateral 時間: 2025-3-28 10:58
Triebwerks- und Kraftstoffregelsystem,can be used in conjunction with time uniformisation techniques, is evaluated on two models of chemical reaction networks, a signalling pathway and a prokaryotic gene expression network: it demonstrates marked improvement in accuracy without performance degradation, particularly when compared to know作者: hankering 時間: 2025-3-28 15:20
Stochastische Verhaltensanalyse, Z3str2, for the quantifier-free theory of string equations, the regular-expression membership predicate and linear arithmetic over the length function. We report on a series of experiments over four sets of challenging real-world benchmarks, where we compared Z3str2 with five different string solve作者: 青春期 時間: 2025-3-28 19:06 作者: 類型 時間: 2025-3-29 01:18 作者: 皺痕 時間: 2025-3-29 05:35
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time ., when the output is ., as compared to the previously best known algorithm with running time .. Third, for the minimum initi作者: Synchronism 時間: 2025-3-29 09:35
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes decision trees. There are three main consequent advantages of our approach. Firstly, it exploits the quantitative information on states, stressing the more important decisions. Secondly, it leads to a greater variability and degree of freedom in representing the strategies. Thirdly, the representat作者: 駁船 時間: 2025-3-29 14:25 作者: 蠟燭 時間: 2025-3-29 15:48
Effective Search-Space Pruning for Solvers of String Equations, Regular Expressions and Length Const Z3str2, for the quantifier-free theory of string equations, the regular-expression membership predicate and linear arithmetic over the length function. We report on a series of experiments over four sets of challenging real-world benchmarks, where we compared Z3str2 with five different string solve作者: 匍匐 時間: 2025-3-29 23:29
0302-9743 Conference on Computer Aided Verification, CAV 2015, held in San Francisco, CA, USA, in July 2015..The total of 58 full and 11 short papers presented in the proceedings was carefully reviewed and selected from 252 submissions. The papers were organized in topical sections named: model checking and r作者: SPURN 時間: 2025-3-30 00:40
On Automation of CTL* Verification for Infinite-State Systemsn for nondeterminism explicit in variables predicting future outcomes when necessary. We show the viability of our approach in practice using examples drawn from device drivers and various industrial examples.作者: indignant 時間: 2025-3-30 06:39 作者: Devastate 時間: 2025-3-30 12:00 作者: BABY 時間: 2025-3-30 14:12
0302-9743 efinements; quantitative reasoning; software analysis; lightning talks; interpolation, IC3/PDR, and Invariants; SMT techniques and applications; HW verification; synthesis; termination; and concurrency..978-3-319-21689-8978-3-319-21690-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 盤旋 時間: 2025-3-30 18:53 作者: Incommensurate 時間: 2025-3-30 21:30
https://doi.org/10.1007/978-3-663-04359-1ger counters in SMT. We introduce a new form of offline partial order reduction that exploits acceleration and the structure of the FTDAs. This aggressively prunes the execution space to be explored by the solver. In this way, we verified safety of seven FTDAs that were out of reach before.作者: Ornament 時間: 2025-3-31 02:36
