標(biāo)題: Titlebook: Automated Technology for Verification and Analysis; 12th International S Franck Cassez,Jean-Fran?ois Raskin Conference proceedings 2014 Spr [打印本頁] 作者: 滲漏 時(shí)間: 2025-3-21 17:10
書目名稱Automated Technology for Verification and Analysis影響因子(影響力)
書目名稱Automated Technology for Verification and Analysis影響因子(影響力)學(xué)科排名
書目名稱Automated Technology for Verification and Analysis網(wǎng)絡(luò)公開度
書目名稱Automated Technology for Verification and Analysis網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Automated Technology for Verification and Analysis被引頻次
書目名稱Automated Technology for Verification and Analysis被引頻次學(xué)科排名
書目名稱Automated Technology for Verification and Analysis年度引用
書目名稱Automated Technology for Verification and Analysis年度引用學(xué)科排名
書目名稱Automated Technology for Verification and Analysis讀者反饋
書目名稱Automated Technology for Verification and Analysis讀者反饋學(xué)科排名
作者: 能夠支付 時(shí)間: 2025-3-21 23:48
Booster: An Acceleration-Based Verification Framework for Array Programs,hniques, like Lazy Abstraction with Interpolants (extended to arrays). The new acceleration features are the key for scaling-up in the verification of programs with arrays, allowing . to efficiently generate required quantified safe inductive invariants attesting the safety of the input code.作者: 演繹 時(shí)間: 2025-3-22 02:15 作者: DAUNT 時(shí)間: 2025-3-22 07:29 作者: 增強(qiáng) 時(shí)間: 2025-3-22 11:18
Quantitative Verification of Weighted Kripke Structures,l research topic over the last twenty years. Following several recent works, we study model checking for (one-dimensional) weighted Kripke structures with positive and negative weights, and temporal logics constraining the total and/or average weight. We prove decidability when only accumulated weig作者: LURE 時(shí)間: 2025-3-22 13:50 作者: ablate 時(shí)間: 2025-3-22 20:01 作者: Nausea 時(shí)間: 2025-3-22 21:15
Test Coverage Estimation Using Threshold Accepting,ided by a coverage measure defined using the star discrepancy notion. An important ingredient in this algorithm is a procedure for dynamically estimating the coverage, which is done based on a box partition of the continuous state space. The goal of this estimation is to identify the areas in the st作者: Confess 時(shí)間: 2025-3-23 02:09 作者: 灌溉 時(shí)間: 2025-3-23 08:09
Fast Debugging of PRISM Models,and understandable counterexamples. In the context of probabilistic systems, path- and subsystem-based counterexamples at the state-space level can be of limited use in debugging. As many probabilistic systems are described in a guarded command language like the one used by the popular model checker作者: acquisition 時(shí)間: 2025-3-23 13:21
ACME: Automata with Counters, Monoids and Equivalence,n automaton and computes its stabilization monoid, which is a generalization of its transition monoid..Using the stabilization monoid, one can solve many problems: determine whether a .-automaton (which is a special kind of automata with counters) is limited, whether two .-automata are equivalent, a作者: Notorious 時(shí)間: 2025-3-23 16:54
Modelling and Analysis of Markov Reward Automata,ts, and memory usage. This paper introduces Markov reward automata, an extension of Markov automata that allows the modelling of systems incorporating . (or .) in addition to nondeterminism, discrete probabilistic choice and continuous stochastic timing. Rewards come in two flavours: action rewards,作者: 向宇宙 時(shí)間: 2025-3-23 20:18 作者: 充滿人 時(shí)間: 2025-3-23 23:17 作者: Blood-Vessels 時(shí)間: 2025-3-24 04:59
Liveness Analysis for Parameterised Boolean Equation Systems,ally are systems of mutually recursive fixed point equations ranging over first-order logic formulae. Our method detects parameters that are not live by analysing a control flow graph of a PBES, and it subsequently eliminates such parameters. We show that a naive approach to constructing a control f作者: CHOP 時(shí)間: 2025-3-24 06:43
Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata, determinization or any of its variants. This leads to smaller automata. There are several outputs of the tool: firstly, deterministic Rabin automata, which are the standard input for probabilistic model checking, e.g. for the probabilistic model-checker .; secondly, deterministic . Rabin automata, 作者: inundate 時(shí)間: 2025-3-24 11:42
The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems,-free languages are used to under-approximate the behaviors of recursive programs. Ginsburg and Spanier have shown in 1966 that a bounded language . is context-free if, and only if, its Parikh image is a stratifiable semilinear set. However, the question whether a semilinear set is stratifiable, her作者: aneurysm 時(shí)間: 2025-3-24 16:22 作者: persistence 時(shí)間: 2025-3-24 21:48 作者: CAMP 時(shí)間: 2025-3-25 02:59 作者: Proclaim 時(shí)間: 2025-3-25 03:59 作者: RAFF 時(shí)間: 2025-3-25 09:19
Test Coverage Estimation Using Threshold Accepting,e in each exploration step is, on one hand, computationally costly, and on the other hand, not always a good choice since this may make the system try to expand in the directions which are not reachable (due to the controllability of the system). Instead of considering all the boxes in the partition作者: Preserve 時(shí)間: 2025-3-25 14:32 作者: 承認(rèn) 時(shí)間: 2025-3-25 19:31
A. J. Dolman,A. Verhagen,C. A. Roversties in MDPs. In contrast with other related techniques, our approach is not restricted to time-bounded (finite-horizon) or discounted properties, nor does it assume any particular properties of the MDP. We also show how our methods extend to LTL objectives. We present experimental results showing t作者: Offensive 時(shí)間: 2025-3-25 21:19
Global Environmental Change and Land Usee in each exploration step is, on one hand, computationally costly, and on the other hand, not always a good choice since this may make the system try to expand in the directions which are not reachable (due to the controllability of the system). Instead of considering all the boxes in the partition作者: insipid 時(shí)間: 2025-3-26 01:29
Acceleration of Affine Hybrid Transformations,ng the data transformations that label these cycles, by reasoning about the geometrical features of the corresponding system of linear constraints. This approach is complete over Multiple Counters Systems (MCS), and is able to accelerate hybrid transformations that are out of scope of existing techniques.作者: detach 時(shí)間: 2025-3-26 06:12
A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol, of nodes. We exploit the mechanization to analyse several improvements of AODV and show that Isabelle/HOL can re-establish most proof obligations automatically and identify exactly the steps that are no longer valid.作者: 提名的名單 時(shí)間: 2025-3-26 11:55
Fast Debugging of PRISM Models, ., a technique identifying a subset of critical commands has recently been proposed. Based on repeatedly solving .?instances, our novel approach to computing a minimal critical command set achieves a speed-up of up to five orders of magnitude over the previously existing technique.作者: FANG 時(shí)間: 2025-3-26 12:47
Liveness Analysis for Parameterised Boolean Equation Systems,low graph, needed for the analysis, may suffer from an exponential blow-up, and we define an approximate analysis that avoids this problem. The effectiveness of our techniques is evaluated using a number of case studies.作者: 捏造 時(shí)間: 2025-3-26 18:41
Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata,which can also be used for probabilistic model checking and are sometimes by orders of magnitude smaller. We also link our tool to . and show that this leads to a?significant speed-up of probabilistic LTL model checking, especially with the generalized Rabin automata.作者: 惡意 時(shí)間: 2025-3-26 23:31
Impacts of Climate Change on Tourismems no modern first-order theorem prover can solve. We illustrate this by running the . theorem prover with extensionality resolution on a number of set theory and array problems. Extensionality resolution helps . to solve problems from the TPTP library of first-order problems that were never solved before by any prover.作者: 錫箔紙 時(shí)間: 2025-3-27 04:06 作者: 審問,審訊 時(shí)間: 2025-3-27 08:07
Extensional Crisis and Proving Identity,ems no modern first-order theorem prover can solve. We illustrate this by running the . theorem prover with extensionality resolution on a number of set theory and array problems. Extensionality resolution helps . to solve problems from the TPTP library of first-order problems that were never solved before by any prover.作者: 蘑菇 時(shí)間: 2025-3-27 13:31 作者: 沙漠 時(shí)間: 2025-3-27 17:17 作者: Obvious 時(shí)間: 2025-3-27 20:02
Franz Prettenthaler,Judith K?berlard functions: the expected cumulative reward until a goal is reached, the expected cumulative reward until a certain time bound, and the long-run average reward. We have implemented these algorithms in the SCOOP/IMCA tool chain and show their feasibility via several case studies.作者: 使人入神 時(shí)間: 2025-3-28 00:59 作者: maladorit 時(shí)間: 2025-3-28 04:03 作者: FLAIL 時(shí)間: 2025-3-28 06:36
Modelling and Analysis of Markov Reward Automata,ard functions: the expected cumulative reward until a goal is reached, the expected cumulative reward until a certain time bound, and the long-run average reward. We have implemented these algorithms in the SCOOP/IMCA tool chain and show their feasibility via several case studies.作者: obviate 時(shí)間: 2025-3-28 12:49
Deciding Entailments in Inductive Separation Logic with Tree Automata,For practical purposes, we leverage from recent advances in automata theory, such as inclusion checking for non-deterministic TA avoiding explicit determinization. We implemented our method and present promising preliminary experimental results.作者: 簡潔 時(shí)間: 2025-3-28 17:21
0302-9743 held in Sydney, Australia, in November 2014..The 29 revised papers presented in this volume were carefully reviewed and selected from 76 submissions. They show current research on theoretical and practical aspects of automated analysis, verification and synthesis by providing an international forum作者: tangle 時(shí)間: 2025-3-28 18:58 作者: Accolade 時(shí)間: 2025-3-29 01:43 作者: Liability 時(shí)間: 2025-3-29 07:02
Suzana Alcinova Monevska,Pece Ristevskiany problems: determine whether a .-automaton (which is a special kind of automata with counters) is limited, whether two .-automata are equivalent, and whether a probabilistic leaktight automaton has value 1.作者: 外貌 時(shí)間: 2025-3-29 10:33 作者: 彈藥 時(shí)間: 2025-3-29 13:00
Quantitative Verification of Weighted Kripke Structures,with positive and negative weights, and temporal logics constraining the total and/or average weight. We prove decidability when only accumulated weight is constrained, while allowing average-weight constraints alone already is undecidable.作者: LUDE 時(shí)間: 2025-3-29 16:16
ACME: Automata with Counters, Monoids and Equivalence,any problems: determine whether a .-automaton (which is a special kind of automata with counters) is limited, whether two .-automata are equivalent, and whether a probabilistic leaktight automaton has value 1.作者: Aura231 時(shí)間: 2025-3-29 23:07 作者: incite 時(shí)間: 2025-3-30 01:05 作者: 受人支配 時(shí)間: 2025-3-30 07:52
R. W. A. Hutjes,P. Kabat,A. J. Dolmanng the data transformations that label these cycles, by reasoning about the geometrical features of the corresponding system of linear constraints. This approach is complete over Multiple Counters Systems (MCS), and is able to accelerate hybrid transformations that are out of scope of existing techniques.作者: Mercurial 時(shí)間: 2025-3-30 10:41
A. J. Dolman,A. Verhagen,C. A. Rovers of nodes. We exploit the mechanization to analyse several improvements of AODV and show that Isabelle/HOL can re-establish most proof obligations automatically and identify exactly the steps that are no longer valid.作者: obnoxious 時(shí)間: 2025-3-30 14:11
D?enan Zulum,?eljko Majstorovi? ., a technique identifying a subset of critical commands has recently been proposed. Based on repeatedly solving .?instances, our novel approach to computing a minimal critical command set achieves a speed-up of up to five orders of magnitude over the previously existing technique.作者: OGLE 時(shí)間: 2025-3-30 19:14
Global Environmental Changes in South Asialow graph, needed for the analysis, may suffer from an exponential blow-up, and we define an approximate analysis that avoids this problem. The effectiveness of our techniques is evaluated using a number of case studies.作者: 割公牛膨脹 時(shí)間: 2025-3-31 00:46 作者: 不斷的變動 時(shí)間: 2025-3-31 02:47
Conference proceedings 2014ydney, Australia, in November 2014..The 29 revised papers presented in this volume were carefully reviewed and selected from 76 submissions. They show current research on theoretical and practical aspects of automated analysis, verification and synthesis by providing an international forum for inter作者: Commonwealth 時(shí)間: 2025-3-31 06:09 作者: 高原 時(shí)間: 2025-3-31 11:39 作者: 易發(fā)怒 時(shí)間: 2025-3-31 14:20 作者: 晚間 時(shí)間: 2025-3-31 18:34 作者: 音的強(qiáng)弱 時(shí)間: 2025-4-1 01:11
Global Environmental Change and Land Usel research topic over the last twenty years. Following several recent works, we study model checking for (one-dimensional) weighted Kripke structures with positive and negative weights, and temporal logics constraining the total and/or average weight. We prove decidability when only accumulated weig作者: Incommensurate 時(shí)間: 2025-4-1 03:19 作者: Free-Radical 時(shí)間: 2025-4-1 08:11 作者: 事物的方面 時(shí)間: 2025-4-1 11:22
Global Environmental Change and Land Useided by a coverage measure defined using the star discrepancy notion. An important ingredient in this algorithm is a procedure for dynamically estimating the coverage, which is done based on a box partition of the continuous state space. The goal of this estimation is to identify the areas in the st作者: Dissonance 時(shí)間: 2025-4-1 18:16
Suzana Alcinova Monevska,Pece Ristevskithe synthesis of strategies ensuring safety, time-bounded or cost-bounded reachability objectives. Assuming a randomized environment, the (priced) timed game essentially defines an infinite-state Markov (reward) decision proces. In this setting the objective is classically to find a strategy that wi作者: 預(yù)防注射 時(shí)間: 2025-4-1 20:17
D?enan Zulum,?eljko Majstorovi?and understandable counterexamples. In the context of probabilistic systems, path- and subsystem-based counterexamples at the state-space level can be of limited use in debugging. As many probabilistic systems are described in a guarded command language like the one used by the popular model checker
