发布求助
文献互助 智能选刊 最新文献

2011 Eighth International Conference on Quantitative Evaluation of SysTems最新文献

筛选
英文 中文
A Tool: Quantitative Analyser for Programs 一种工具:程序定量分析仪
2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.25
C. Mu, D. Clark
{"title":"A Tool: Quantitative Analyser for Programs","authors":"C. Mu, D. Clark","doi":"10.1109/QEST.2011.25","DOIUrl":"https://doi.org/10.1109/QEST.2011.25","url":null,"abstract":"This paper presents a tool for analysing quantified information flow (QIF) for programs written in a core imperative language. The intended application is measuring leakage of secrets. The tool can provide either exact leakage or an upper bound depending on the trade off chosen by the user between exactitude and computation speed. Approximations are created via abstractions derived from partitions on the initial store. We outline the workings of the tool and summarise results derived from running the tool on a range of example programs with either concrete or abstract initial stores.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128206200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
GPA - A Tool for Fluid Scalability Analysis of Massively Parallel Systems 大规模并行系统的流体可扩展性分析工具
2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.26
Anton Stefanek, R. A. Hayden, Jeremy T. Bradley
{"title":"GPA - A Tool for Fluid Scalability Analysis of Massively Parallel Systems","authors":"Anton Stefanek, R. A. Hayden, Jeremy T. Bradley","doi":"10.1109/QEST.2011.26","DOIUrl":"https://doi.org/10.1109/QEST.2011.26","url":null,"abstract":"Recent ordinary differential equation (ODE) based techniques allow efficient analysis of Markovian population models with extremely large state spaces. In most cases of realistic scale, they provide the only alternative to stochastic simulation. Moreover, numerical solution of the ODEs is cheaper computationally than simulation by orders of magnitude. We present the Grouped PEPA Analyser (GPA) tool with new functionality to exploit computationally inexpensive fluid analysis techniques to allow the exploration of large numbers of system configurations in models with large state spaces. GPA provides an efficient implementation of the fluid analysis techniques for models described in a stochastic process algebra. It implements recently developed extensions allowing specifications of complex reward measures using combinations of state based, rate accumulated and impulse rewards. Combined with the ability to efficiently capture various passage time metrics, GPA can be used to solve optimisation problems with a reward objective function under different service level agreement type constraints.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"2 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131751298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Learning Probabilistic Automata for Model Checking 用于模型检查的学习概率自动机
2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.21
Hua Mao, Yingke Chen, M. Jaeger, Thomas D. Nielsen, K. Larsen, B. Nielsen
{"title":"Learning Probabilistic Automata for Model Checking","authors":"Hua Mao, Yingke Chen, M. Jaeger, Thomas D. Nielsen, K. Larsen, B. Nielsen","doi":"10.1109/QEST.2011.21","DOIUrl":"https://doi.org/10.1109/QEST.2011.21","url":null,"abstract":"Obtaining accurate system models for verification is a hard and time consuming process, which is seen by industry as a hindrance to adopt otherwise powerful model driven development techniques and tools. In this paper we pursue an alternative approach where an accurate high-level model can be automatically constructed from observations of a given black-box embedded system. We adapt algorithms for learning finite probabilistic automata from observed system behaviors. We prove that in the limit of large sample sizes the learned model will be an accurate representation of the data-generating system. In particular, in the large sample limit, the learned model and the original system will define the same probabilities for linear temporal logic (LTL) properties. Thus, we can perform PLTL model-checking on the learned model to infer properties of the system. We perform experiments learning models from system observations at different levels of abstraction. The experimental results show the learned models provide very good approximations for relevant properties of the original system.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121433420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 58
A Hybrid Approach for Large Cache Performance Studies 大型缓存性能研究的混合方法
2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.15
D. Daly, Parijat Dube, Kaoutar El Maghraoui, D. Poff, Li Zhang
{"title":"A Hybrid Approach for Large Cache Performance Studies","authors":"D. Daly, Parijat Dube, Kaoutar El Maghraoui, D. Poff, Li Zhang","doi":"10.1109/QEST.2011.15","DOIUrl":"https://doi.org/10.1109/QEST.2011.15","url":null,"abstract":"Recent technology trends are leading to the possibility of computer systems having last level caches significantly larger than those that exist today. Traditionally, cache effectiveness has been modeled through trace-driven simulation tools, however, these tools are not up to the task of modeling very large caches. Because of the limited length of available traces, the tools cannot capture behavior across long enough periods of time to adequately simulate a very large cache. We present mprofiler, a tool that characterizes the memory access pattern of workloads, and present a novel hybrid modeling technique that models cache behavior across a much larger time scale than previously possible. Our methodology combines memory access patterns captured by different tools (e.g., mprofiler) at different time scales and develops analytical techniques that allow spanning the required time frame and predicting the performance of very large caches.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122396085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Composition and Equivalence of Markovian and Non-Markovian Models 马尔可夫模型与非马尔可夫模型的组成与等价
2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.36
P. Buchholz, M. Telek
{"title":"Composition and Equivalence of Markovian and Non-Markovian Models","authors":"P. Buchholz, M. Telek","doi":"10.1109/QEST.2011.36","DOIUrl":"https://doi.org/10.1109/QEST.2011.36","url":null,"abstract":"Compositional modeling and the aggregation of components according to equivalence relations based on stochastic bisimulation are often used to handle the problem of state space explosion in Markov models. The paper presents a general class of equivalence relations between Markov models that include stochastic bisimulation or %basically lump ability as specific cases and proves the congruence property of the new equivalence with respect to the composition of components. It is shown that the equivalence relates Markovian and non-Markovian representations but requires some restrictions for the composition which are automatically observed if stochastic bisimulation is used as equivalence relation. Nevertheless, the approach offers the possibility of state space reduction beyond stochastic bisimulation without loosing the possibility of analyzing the resulting stochastic process by means of numerical methods.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128138861","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
APAC: A Tool for Reasoning about Abstract Probabilistic Automata APAC:一个抽象概率自动机的推理工具
2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.28
Benoît Delahaye, K. Larsen, Axel Legay, Mikkel L. Pedersen, A. Wąsowski
{"title":"APAC: A Tool for Reasoning about Abstract Probabilistic Automata","authors":"Benoît Delahaye, K. Larsen, Axel Legay, Mikkel L. Pedersen, A. Wąsowski","doi":"10.1109/QEST.2011.28","DOIUrl":"https://doi.org/10.1109/QEST.2011.28","url":null,"abstract":"We recently introduced Abstract Probabilistic Automata (APA), a new powerful abstraction formalism for probabilistic automata. Our theory is equipped with a series of aggressive abstraction techniques for state-space reduction as well as a specification theory for both logical and structural comparisons. This paper reports on the implementation of the approach in the Abstract Probabilistic Automata Checker toolset.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132181591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Fluid Analysis of Queueing in Two-Stage Random Environments 两阶段随机环境下排队的流体分析
2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.12
G. Casale, M. Tribastone
{"title":"Fluid Analysis of Queueing in Two-Stage Random Environments","authors":"G. Casale, M. Tribastone","doi":"10.1109/QEST.2011.12","DOIUrl":"https://doi.org/10.1109/QEST.2011.12","url":null,"abstract":"A large number of random environments leads to Markov processes where average-environment (AVG) and near-complete-decomposability (DEC) approximations suffer unacceptably large errors. This is problematic for queueing networks in particular, where state-space explosion hinders the application of numerical methods. In this paper we introduce blending, a novel fluid-based approximation for queueing models in random environments. The technique is here first introduced for random environments with two stages. Blending estimates the equilibrium of the model by iteratively evaluating transient-analysis sub problems for each of the two stages. Each sub problem is solved by means of a very small system of ordinary differential equations, making the approach scalable and simple to implement. Random environments supported by blending are either state-independent, as for models with breakdown and repair, or state-dependent, such as for Markov-modulated queues where the service phase changes only during busy periods. Comparative results with AVG and DEC approximations prove that blending tackles the limitations of existing methods for evaluating queues in random environments.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126805994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Quantifying Information Flow Using Min-Entropy 用最小熵量化信息流
2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.31
Geoffrey Smith
{"title":"Quantifying Information Flow Using Min-Entropy","authors":"Geoffrey Smith","doi":"10.1109/QEST.2011.31","DOIUrl":"https://doi.org/10.1109/QEST.2011.31","url":null,"abstract":"Quantitative theories of information flow are of growing interest, due to the fundamental importance of protecting confidential information from improper disclosure, together with the unavoidability of \"small\" leaks in practical systems. But while it is tempting to measure leakage using classic information-theoretic concepts like Shannon entropy and mutual information, these turn out not to provide very satisfactory security guarantees. As a result, several researchers have developed an alternative theory based on Renyi's min-entropy. In this theory, uncertainty is measured in terms of a random variable's vulnerability to being guessed in one try by an adversary, note that this is the complement of the Bayes Risk. In this paper, we survey the main theory of min-entropy leakage in deterministic and probabilistic systems, including comparisons with mutual information leakage, results on min-capacity, results on channels in cascade, and techniques for calculating min-entropy leakage in systems.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114940560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 70
Model Checking MDPs with a Unique Compact Invariant Set of Distributions 用唯一紧不变分布集检验mdp的模型
2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.22
Rohit Chadha, V. Korthikanti, Mahesh Viswanathan, G. Agha, YoungMin Kwon
{"title":"Model Checking MDPs with a Unique Compact Invariant Set of Distributions","authors":"Rohit Chadha, V. Korthikanti, Mahesh Viswanathan, G. Agha, YoungMin Kwon","doi":"10.1109/QEST.2011.22","DOIUrl":"https://doi.org/10.1109/QEST.2011.22","url":null,"abstract":"The semantics of Markov Decision Processes (MDPs), when viewed as transformers of probability distributions, can described as a labeled transition system over the probability distributions over the states of the MDP. The MDP can be seen as defining a set of executions, where each execution is a sequence of probability distributions. Reasoning about sequences of distributions allows one to express properties not expressible in logics like PCTL, examples include expressing bounds on transient rewards and expected values of random variables, as well as comparing the probability of being in one set of states at a given time with another set of states. With respect to such a semantics, the problem of checking that the MDP never reaches a bad distribution is undecidable~cite{qest10}. In this paper, we identify a special class of MDPs called emph{semi-regular} MDPs that have a unique non-empty, compact, invariant set of distributions, for which we show that checking any $omega$-regular property is decidable. Our decidability result also implies that for semi-regular probabilistic finite automata with isolated cut-points, the emptiness problem is decidable.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115161383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
COSMOS: A Statistical Model Checker for the Hybrid Automata Stochastic Logic COSMOS:混合自动机随机逻辑的统计模型检查器
2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.24
Paolo Ballarini, Hilal Djafri, M. Duflot, S. Haddad, N. Pekergin
{"title":"COSMOS: A Statistical Model Checker for the Hybrid Automata Stochastic Logic","authors":"Paolo Ballarini, Hilal Djafri, M. Duflot, S. Haddad, N. Pekergin","doi":"10.1109/QEST.2011.24","DOIUrl":"https://doi.org/10.1109/QEST.2011.24","url":null,"abstract":"This tool paper introduces cosmos, a statistical model checker for the Hybrid Automata Stochastic Logic (HASL). HASL employs Linear Hybrid Automata (LHA), a generalization of Deterministic Timed Automata (DTA), to describe relevant execution paths of a Discrete Event Stochastic Process (DESP), a class of stochastic models which includes, but is not limited to, Markov chains. As a result HASL verification turns out to be a unifying framework where sophisticated temporal reasoning is naturally blended with elaborate reward-based analysis. COSMOS takes as input a DESP (described in terms of a Generalized Stochastic Petri Net), an LHA and an expression $Z$ representing the quantity to be estimated. It returns a confidence interval estimation of $Z$. COSMOS is written in C++ and is freely available to the research community.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"88 30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129562901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 56
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信