{"title":"The Multiple-Asymmetric-Utility System Model: A Framework for Modeling Cyber-Human Systems","authors":"Douglas Eskins, W. Sanders","doi":"10.1109/QEST.2011.38","DOIUrl":"https://doi.org/10.1109/QEST.2011.38","url":null,"abstract":"Traditional cyber security modeling approaches either do not explicitly consider system participants or assume a fixed set of participant behaviors that are independent of the system. Increasingly, accumulated cyber security data indicate that system participants can play an important role in the creation or elimination of cyber security vulnerabilities. Thus, there is a need for cyber security analysis tools that take into account the actions and decisions of human participants. In this paper, we present a modeling approach for quantifying how participant decisions can affect system security. Specifically, we introduce a definition of a cyber-human system (CHS) and its elements, the opportunity-willingness-capability (OWC) ontology for classifying CHS elements with respect to system tasks, the human decision point (HDP) as a first-class system model element, and the multiple-asymmetric-utility system modeling framework for evaluating the effects of HDPs on a CHS. This modeling approach provides a structured and quantitative means of analyzing cyber security problems whose outcomes are influenced by human-system interactions.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"219 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":"121559359","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}
{"title":"Quantitative Evaluation of BFT Protocols","authors":"Raluca Halalai, T. Henzinger, Vasu Singh","doi":"10.1109/QEST.2011.40","DOIUrl":"https://doi.org/10.1109/QEST.2011.40","url":null,"abstract":"Byzantine Fault Tolerant (BFT) protocols aim to improve the reliability of distributed systems. They enable systems to tolerate arbitrary failures in a bounded number of nodes. BFT protocols are usually proven correct for certain safety and liveness properties. However, recent studies have shown that the performance of state-of-the-art BFT protocols decreases drastically in the presence of even a single malicious node. This motivates a formal quantitative analysis of BFT protocols to investigate their performance characteristics under different scenarios. We present HyPerf, a new hybrid methodology based on model checking and simulation techniques for evaluating the performance of BFT protocols. We build a transition system corresponding to a BFT protocol and systematically explore the set of behaviors allowed by the protocol. We associate certain timing information with different operations in the protocol, like cryptographic operations and message transmission. After an elaborate state exploration, we use the time information to evaluate the performance characteristics of the protocol using simulation techniques. We integrate our framework in Mace, a tool for building and verifying distributed systems. We evaluate the performance of PBFT using our framework. We describe two different use-cases of our methodology. For the benign operation of the protocol, we use the time information as random variables to compute the probability distribution of the execution times. In the presence of faults, we estimate the worst-case performance of the protocol for various attacks that can be employed by malicious nodes. Our results show the importance of hybrid techniques in systematically analyzing the performance of large-scale systems.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"9 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":"123393507","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}
E. LeMay, Michael D. Ford, K. Keefe, W. Sanders, Carol Muehrcke
{"title":"Model-based Security Metrics Using ADversary VIew Security Evaluation (ADVISE)","authors":"E. LeMay, Michael D. Ford, K. Keefe, W. Sanders, Carol Muehrcke","doi":"10.1109/QEST.2011.34","DOIUrl":"https://doi.org/10.1109/QEST.2011.34","url":null,"abstract":"System architects need quantitative security metrics to make informed trade-off decisions involving system security. The security metrics need to provide insight on weak points in the system defense, considering characteristics of both the system and its adversaries. To provide such metrics, we formally define the ADversary View Security Evaluation (ADVISE) method. Our approach is to create an executable state-based security model of a system and an adversary that represents how the adversary is likely to attack the system and the results of such an attack. The attack decision function uses information about adversary attack preferences and possible attacks against the system to mimic how the adversary selects the most attractive next attack step. The adversary's decision involves looking ahead some number of attack steps. System architects can use ADVISE to compare the security strength of system architecture variants and analyze the threats posed by different adversaries. We demonstrate the feasibility and benefits of ADVISE using a case study. To produce quantitative model-based security metrics, we have implemented the ADVISE method in a tool that facilitates user input of system and adversary data and automatically generates executable models.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"14 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":"126404493","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}
Parijat Dube, Seetharami R. Seelam, Yanbin Liu, Megumi Ito, Thomas Ling, M. Hack, L. Fong, G. Johnson, Michael H. Dawson, Li Zhang, Yuqing Gao
{"title":"A Tool for Scalable Profiling and Tracing of Java and Native Code Interactions","authors":"Parijat Dube, Seetharami R. Seelam, Yanbin Liu, Megumi Ito, Thomas Ling, M. Hack, L. Fong, G. Johnson, Michael H. Dawson, Li Zhang, Yuqing Gao","doi":"10.1109/QEST.2011.14","DOIUrl":"https://doi.org/10.1109/QEST.2011.14","url":null,"abstract":"Java workloads have two different execution spaces: one in JVM and the other in the native environment. Understanding workload activity in native and non-native (Java) spaces and its impact on the overall resource consumption of Java workloads can be very useful. For example, this knowledge can be exploited in code optimization and for efficient process level scheduling especially in emerging hybrid systems. Existing Java run time tracing tools are quite heavyweight and/or offer limited useful information for understanding Java and native space interactions. We developed an extremely lightweight tracing tool for enterprise Java workloads. The tool captures detailed per-thread statistics related to resource usage and activity in JVM and native spheres. Efficient design based on innovative thread and memory management principles enables us to achieve scalable monitoring with our tool on multi-core systems running enterprise workloads. The information captured by the tool is used to build workload profiles which can then be used for predictive performance of Java workloads in emerging systems and architectures.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"120 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":"123237843","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}
{"title":"SCOOP: A Tool for SymboliC Optimisations of Probabilistic Processes","authors":"Mark Timmer","doi":"10.1109/QEST.2011.27","DOIUrl":"https://doi.org/10.1109/QEST.2011.27","url":null,"abstract":"This paper presents SCOOP: a tool that symbolically optimises process-algebraic specifications of probabilistic processes. It takes specifications in the prCRL language (combining data and probabilities), which are linearised first to an intermediate format: the LPPE. On this format, optimisations such as dead-variable reduction and confluence reduction are applied automatically by SCOOP. That way, drastic state space reductions are achieved while never having to generate the complete state space, as data variables are unfolded only locally. The optimised state spaces are ready to be analysed by for instance CADP or PRISM.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"1998 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":"114191921","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}
{"title":"Sirio: A Framework for Simulation and Symbolic State Space Analysis of non-Markovian Models","authors":"L. Carnevali, L. Ridi, E. Vicario","doi":"10.1007/978-3-642-24270-0_30","DOIUrl":"https://doi.org/10.1007/978-3-642-24270-0_30","url":null,"abstract":"","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"514 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":"123062731","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}
E. Amparore, M. Beccuti, S. Donatelli, G. Franceschinis
{"title":"Probe Automata for Passage Time Specification","authors":"E. Amparore, M. Beccuti, S. Donatelli, G. Franceschinis","doi":"10.1109/QEST.2011.20","DOIUrl":"https://doi.org/10.1109/QEST.2011.20","url":null,"abstract":"Passage time distribution has drawn increasing attention over the past years as an important measure to define and verify service level agreements. The definition of passage time requires the specification of a condition to start/stop the computation, and possibly of a restriction on the system behavior to be considered between start and stop. Different characterizations have been defined in the past, either state-based, action-based or a mix of the two, either for Markov chains, or for stochastic Petri nets and process algebras. In this paper we propose probe automata as a way to specify passage time for GSPNs that allows one to select entering, goal, and forbidden states, as well as paths of interest starting from any reachable state. The specification is in terms of conditions over the current marking, the transition (sequence) being fired, as well as over the marking reached through the firing. Probe automata subsume previous definitions of passage time for GSPNs and for Tagged GSPNs, the extension of GSPNs that was defined in the past for computing passage time of a {em tagged token} in a GSPN.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"23 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":"132268245","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}
{"title":"Discrete-Time Verification and Control for Probabilistic Rectangular Hybrid Automata","authors":"J. Sproston","doi":"10.1109/QEST.2011.18","DOIUrl":"https://doi.org/10.1109/QEST.2011.18","url":null,"abstract":"Hybrid automata provide a modeling formalism for systems characterized by a combination of discrete and continuous components. Probabilistic rectangular automata generalize the class of rectangular hybrid automata with the possibility of representing random behavior of the discrete components of the system. We consider the following two problems regarding probabilistic rectangular automata: verification concerns the computation of the maximum probability with which the system can satisfy a certain omega-regular specification, control concerns the computation of a strategy which guides certain choices of the system in order to maximize the probability of satisfying a certain omega-regular specification. Our main contribution is to give algorithms for the verification and control problems for probabilistic rectangular automata in a semantics in which discrete control transitions can occur only at integer points in time. Additionally, we give algorithms for verification of omega-regular specifications of probabilistic timed automata, a subclass of probabilistic rectangular automata, with the usual dense-time semantics.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"174 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":"132362635","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}
{"title":"Forecasting Run-Times of Secure Two-Party Computation","authors":"Axel Schröpfer, F. Kerschbaum","doi":"10.1109/QEST.2011.33","DOIUrl":"https://doi.org/10.1109/QEST.2011.33","url":null,"abstract":"Secure computation (SC) are cryptographic protocols that enable multiple parties to perform a joint computation while retaining the privacy of their inputs. It is current practice to evaluate the performance of SC protocols using complexity approximations of computation and communication. Due to the disparate complexity measures and constants this approach fails at reliably predicting the performance. We contribute a performance model (PM) for forecasting run-times of secure two-party computations. We show the correctness of our PM by an empirical study on the problem of secure division which is relevant for many real world SCs, e.g., k-means clustering or supply chain optimization. We show that our PM can be used to make an optimal selection of an algorithm and cryptographic protocol combination, as well as to determine the implicit security tradeoffs. The predictions of our PM can be used to design or select more efficient or more secure protocols.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"1 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":"131038651","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}
{"title":"SPORTSBET: A Tool for the Quantitative Evaluation and Execution of Betting Exchange Trading Strategies","authors":"P. Tsirimpas, W. Knottenbelt","doi":"10.1109/QEST.2011.30","DOIUrl":"https://doi.org/10.1109/QEST.2011.30","url":null,"abstract":"Betting exchange markets, which offer person-to-person betting, have attracted increasing interest due to their similarities with financial markets and their growing economic importance. This paper presents SPORTSBET, an event-driven tool for the quantitative evaluation of betting exchange trading strategies. It was developed to specify, execute and back-test parameterised betting strategies for a wide range of sports. SPORTSBET allows the definition of betting strategies in an extended version of the UrbiScript language as sets of concurrent processes which make use of event-calculus-like operators. Strategy performance is quantified by synchronizing multiple real time or historical data streams with a dynamic market reconstruction.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"14 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":"129596128","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}