{"title":"Verification in concurrent programming with Petri nets structural techniques","authors":"Kamel Barkaoui, Jean-François Pradat-Peyre","doi":"10.1109/HASE.1998.731604","DOIUrl":"https://doi.org/10.1109/HASE.1998.731604","url":null,"abstract":"The paper deals with verification of flow control in concurrent programs. We use the Ada language model as reference. After translation of Ada programs into Petri nets (named Ada nets for Ada programs), we show how one can fully exploit the relationship between the behavior of the concurrent program and the structure of the corresponding Petri net. Using the siphon structure, we specify some structural conditions for behavioral properties such as deadlock freeness and liveness that correct concurrent programs must satisfy. These conditions can be proved or disproved using efficient algorithms. We also provide a formal justification of guidelines (such as client/server paradigm) that programmers observe traditionally in order to build correct concurrent programs. Several examples are presented to show the effectiveness of using a structure theory of Petri nets for static analysis of concurrent programs.","PeriodicalId":340424,"journal":{"name":"Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133100779","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}
IV ManuelAparicio, Peter Herman, W. Stephens, Anuj K. Jain, Munindar P. Singh
{"title":"Agent information contracts within virtual private networks","authors":"IV ManuelAparicio, Peter Herman, W. Stephens, Anuj K. Jain, Munindar P. Singh","doi":"10.1109/HASE.1998.731634","DOIUrl":"https://doi.org/10.1109/HASE.1998.731634","url":null,"abstract":"Virtual enterprises are being built on an Internet backbone, for which security provisioning is an obvious first concern. However, additional services need provisioning as well. For instance, contracted arrangements for quality inspection, notification of delay, and other such coordinations can be provided by semi-autonomous agent-based services. We introduce information contracts, which specify the commitments of ContractAgents to each other. Based on human-readable contract templates with fill-in-the-black terms, ContractAgents manage the negotiation stage between user specialists and then operationalize and ensure these commitments during enactment. Building on the idea of an agent-based sphere of commitments (SoComs) to overcome weaknesses in extended transaction processing and traditional workflow management, we show how ContractAgents also need to be positioned within the security architecture of virtual private networks. The standardization of contracts, SoCom servers, and operationalized commitments can then provide a basis for compliance checks by trusted third parties and oversight authorities.","PeriodicalId":340424,"journal":{"name":"Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114950322","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":"Design for constraint violation detection in safety-critical systems","authors":"S. Subramanian, Sanjai Rayadurgam, W. Tsai","doi":"10.1109/HASE.1998.731602","DOIUrl":"https://doi.org/10.1109/HASE.1998.731602","url":null,"abstract":"In safety critical systems, certain safety constraints must be satisfied before an operation can be performed. Such constraints typically depend on the state of the system at the instant of invocation of the operation. Further, for a specific version in a family of related systems, its intended application and the individual user profiles may play a role in determining the constraints. To promote reuse while allowing customizability, a good design should decouple the operations from their associated constraints. Also, the increased flexibility should not entail significant execution time and memory overheads. The paper presents one such design of an object oriented framework for constraint verification and applies it to our motivational problem in the context of implantable cardiac devices. It also serves a broader objective of cataloging the experience gained in developing safety critical systems. Such a knowledge base will be of practical value to the developer community.","PeriodicalId":340424,"journal":{"name":"Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131240765","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":"Combining various solution techniques for dynamic fault tree analysis of computer systems","authors":"R. Manian, J. Dugan, D. Coppit, K. Sullivan","doi":"10.1109/HASE.1998.731591","DOIUrl":"https://doi.org/10.1109/HASE.1998.731591","url":null,"abstract":"Fault trees provide a conceptually simple modeling framework to represent system-level reliability in terms of interactions between component reliabilities. DIFtree (Dynamic Innovative Fault trees) effectively combines the best static fault tree solution technique (binary decision diagrams) with Markov solution techniques for dynamic fault trees. DIFtree includes advanced techniques for modeling coverage; coverage modeling has been shown to be critical to the analysis of fault-tolerant computer systems. DIFtree is based on a divide-and-conquer technique for modularizing the system-level fault tree into independent sub-trees; different solution techniques can be used for sub-trees. In this paper, we extend the DIFtree analysis capability to model several different distributions of time-to-failure, including fixed probabilities (no time component), exponential (constant hazard rate), Weibull (time-varying hazard rate) and log-normal. Our approach extends both the BDD and Markov analytical approaches and incorporates simulation as well.","PeriodicalId":340424,"journal":{"name":"Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117273379","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":"Specifying and verifying temporal behavior of high assurance systems using reachability tree logic","authors":"Stephen J. H. Yang, W. Chu, Jonathan Lee","doi":"10.1109/HASE.1998.731607","DOIUrl":"https://doi.org/10.1109/HASE.1998.731607","url":null,"abstract":"The paper presents our reachability tree logic (RTL) and its integration with temporal Petri nets to specify and verify the temporal behavior of high assurance systems. In addition, we demonstrate how to reduce the complexity of a model checking algorithm by using the reachability tree. We have implemented a specification and verification toolkit called NCUPN (National Central University Petri Nets toolkit) using Java. NCUPN is now available on the Internet via http://140.115.50.137.","PeriodicalId":340424,"journal":{"name":"Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133883044","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}
D. Olawsky, C. Payne, T. Sundquist, D. Apostal, T. Fine
{"title":"Using composition to design secure, fault-tolerant systems","authors":"D. Olawsky, C. Payne, T. Sundquist, D. Apostal, T. Fine","doi":"10.1109/HASE.1998.731592","DOIUrl":"https://doi.org/10.1109/HASE.1998.731592","url":null,"abstract":"Complex systems must be analyzed in smaller pieces. Analysis must support both bottom-up (composition) and top-down (refinement) development, and it must support the consideration of several critical properties, e.g. functional correctness, fault tolerance and security, as appropriate. We describe a mathematical framework, called the CSS (Composability for Secure Systems) framework, for performing composition and refinement analysis and discuss some lessons learned from its application. The framework is written and verified in the PVS specification language.","PeriodicalId":340424,"journal":{"name":"Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132013668","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":"In-parameter-order: a test generation strategy for pairwise testing","authors":"Yu Lei, K. Tai","doi":"10.1109/HASE.1998.731623","DOIUrl":"https://doi.org/10.1109/HASE.1998.731623","url":null,"abstract":"Pairwise testing (or 2-way testing) is a specification-based testing criterion, which requires that for each pair of input parameters of a system, every combination of valid values of these two parameters be covered by at least one test case. Empirical results show that pairwise testing is practical and effective for various types of software systems. We show that the problem of generating a minimum test set for pairwise testing is NP-complete. We propose a test generation strategy, called in-parameter-order (or IPO), for pairwise testing. For a system with two or more input parameters, the IPO strategy generates a pairwise test set for the first two parameters, extends the test set to generate a pairwise test set for the first three parameters, and continues to do so for each additional parameter. The IPO strategy allows the use of local optimization techniques for test generation and the reuse of existing tests when a system is extended with new parameters or new values of existing parameters. We present practical, IPO-based test generation algorithms. We describe the implementation of an IPO-based test generation tool and show some empirical results.","PeriodicalId":340424,"journal":{"name":"Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126840714","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":"Checking modification tolerance","authors":"M. Dal Cin","doi":"10.1109/HASE.1998.731589","DOIUrl":"https://doi.org/10.1109/HASE.1998.731589","url":null,"abstract":"We elaborate a relational framework which allows the modeling and analysis of unintended and fault-tolerant system behavior. The framework is based on the notions of concurrent finite state machines and on tolerance and error relations over the state set of these machines. The focus is on permanent errors which modify the transition structure of these machines.","PeriodicalId":340424,"journal":{"name":"Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127295592","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}