Pub Date : 1999-11-17DOI: 10.1109/HASE.1999.809491
I. Yen, Biao Chen, I. Chen
Many multiple server systems are now being used for heavily accessed web services. Performance, availability, and real-time transaction processing are important requirements for many of these applications. In this paper, we apply the multi-invariant data structure (MIDS) concept for real-time transaction processing. We used the MIDS scheme to develop a highly available, reliable, real-time transaction processing algorithm. We show that with very little overhead compared to the two-phase commit protocol, we achieve non-blocking atomic transaction processing. Also, the algorithm is suitable for real-time processing since a task can be preempted at any point of execution without expensive recovery procedure.
{"title":"Real-time atomic transaction processing using multi-invariant data structure","authors":"I. Yen, Biao Chen, I. Chen","doi":"10.1109/HASE.1999.809491","DOIUrl":"https://doi.org/10.1109/HASE.1999.809491","url":null,"abstract":"Many multiple server systems are now being used for heavily accessed web services. Performance, availability, and real-time transaction processing are important requirements for many of these applications. In this paper, we apply the multi-invariant data structure (MIDS) concept for real-time transaction processing. We used the MIDS scheme to develop a highly available, reliable, real-time transaction processing algorithm. We show that with very little overhead compared to the two-phase commit protocol, we achieve non-blocking atomic transaction processing. Also, the algorithm is suitable for real-time processing since a task can be preempted at any point of execution without expensive recovery procedure.","PeriodicalId":369187,"journal":{"name":"Proceedings 4th IEEE International Symposium on High-Assurance Systems Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131231386","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}
Pub Date : 1999-11-17DOI: 10.1109/HASE.1999.809506
J. Was
Life is based on risk. If everything in life worked perfectly, the world would be boring. In fact, we'd probably have to create risks just to stay sane. Risk is a phenomenon that all living things must cope with, manage, and mitigate. The key is not to focus on total risk avoidance, but instead, intelligent risk management. Total risk avoidance is impossible. My position is that software's benefit to society outweighs the risks. Software is the great enabler for a higher "quality of life." Human casualties will inevitably occur as we continue to seek new methods and refine existing methods for high assurance software.
{"title":"A world without risks: let me out!","authors":"J. Was","doi":"10.1109/HASE.1999.809506","DOIUrl":"https://doi.org/10.1109/HASE.1999.809506","url":null,"abstract":"Life is based on risk. If everything in life worked perfectly, the world would be boring. In fact, we'd probably have to create risks just to stay sane. Risk is a phenomenon that all living things must cope with, manage, and mitigate. The key is not to focus on total risk avoidance, but instead, intelligent risk management. Total risk avoidance is impossible. My position is that software's benefit to society outweighs the risks. Software is the great enabler for a higher \"quality of life.\" Human casualties will inevitably occur as we continue to seek new methods and refine existing methods for high assurance software.","PeriodicalId":369187,"journal":{"name":"Proceedings 4th IEEE International Symposium on High-Assurance Systems Engineering","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133613145","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}
Pub Date : 1999-11-17DOI: 10.1109/HASE.1999.809477
D. Cailliau, R. Bellenger
In this work-in-progress paper we present the first step on the first attempt to design intrinsically reconfigurable software for single-processor instruments of scientific satellites. After disserting on the specifications particular of the space field for the reconfiguration, we argue that the most suitable reconfigurability level is overloading tasks and functions of the application. Dynamic to semi-dynamic reconfiguration will fulfill most of the common needs. We state that the reconfiguration of real-time embedded software for space-borne systems relies on an intrinsically reconfigurable software design and well-defined ground segment operations. A promising technique seems to be to design the reconfigurable parts of the software as a set of proxy-accessible objects. We present the first step in designing such software for the French astrophysical satellite Corot.
{"title":"The Corot instruments software: towards intrinsically reconfigurable real-time embedded processing software in space-borne instruments","authors":"D. Cailliau, R. Bellenger","doi":"10.1109/HASE.1999.809477","DOIUrl":"https://doi.org/10.1109/HASE.1999.809477","url":null,"abstract":"In this work-in-progress paper we present the first step on the first attempt to design intrinsically reconfigurable software for single-processor instruments of scientific satellites. After disserting on the specifications particular of the space field for the reconfiguration, we argue that the most suitable reconfigurability level is overloading tasks and functions of the application. Dynamic to semi-dynamic reconfiguration will fulfill most of the common needs. We state that the reconfiguration of real-time embedded software for space-borne systems relies on an intrinsically reconfigurable software design and well-defined ground segment operations. A promising technique seems to be to design the reconfigurable parts of the software as a set of proxy-accessible objects. We present the first step in designing such software for the French astrophysical satellite Corot.","PeriodicalId":369187,"journal":{"name":"Proceedings 4th IEEE International Symposium on High-Assurance Systems Engineering","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132624432","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}
Pub Date : 1999-11-17DOI: 10.1109/HASE.1999.809473
M. D. Cin, G. Huszerl, K. Kosmidis
Introduces a method to model embedded dependability-critical systems as an AND-composition of guarded Statecharts, which are special UML Statecharts. With guarded Statecharts, we can model the reactive behaviour of embedded systems so that their quantitative analysis can be performed. First, we present our motivation for using guarded Statecharts to express the interaction between the hardware and software components of embedded systems and to model faults and errors as state perturbations. Then we discuss how these models are transformed into stochastic reward nets that are amenable to a quantitative dependability analysis. Finally, our approach is illustrated by an example.
{"title":"Quantitative evaluation of dependability critical systems based on guarded Statechart models","authors":"M. D. Cin, G. Huszerl, K. Kosmidis","doi":"10.1109/HASE.1999.809473","DOIUrl":"https://doi.org/10.1109/HASE.1999.809473","url":null,"abstract":"Introduces a method to model embedded dependability-critical systems as an AND-composition of guarded Statecharts, which are special UML Statecharts. With guarded Statecharts, we can model the reactive behaviour of embedded systems so that their quantitative analysis can be performed. First, we present our motivation for using guarded Statecharts to express the interaction between the hardware and software components of embedded systems and to model faults and errors as state perturbations. Then we discuss how these models are transformed into stochastic reward nets that are amenable to a quantitative dependability analysis. Finally, our approach is illustrated by an example.","PeriodicalId":369187,"journal":{"name":"Proceedings 4th IEEE International Symposium on High-Assurance Systems Engineering","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115877634","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}
Pub Date : 1998-12-01DOI: 10.1109/HASE.1999.809501
V. Winter
This paper describes a modeling technique for single-agent reactive systems, that is influenced by the modeling paradigm of Parnas as well as by the synchronous paradigms of LUSTRE and ESTEREL. In this paradigm, single-agent reactive systems are modeled in a universe having a discrete clock. This discretization of time greatly reduces the temporal complexity of the model. We believe that the advantage of this reduction in temporal complexity is that the resulting model is in many ways better suited to automated software construction and analysis techniques (e.g., deductive synthesis, transformation, and verification) than models that are based on continuous representations of time.
{"title":"A synchronous paradigm for modeling stable reactive systems","authors":"V. Winter","doi":"10.1109/HASE.1999.809501","DOIUrl":"https://doi.org/10.1109/HASE.1999.809501","url":null,"abstract":"This paper describes a modeling technique for single-agent reactive systems, that is influenced by the modeling paradigm of Parnas as well as by the synchronous paradigms of LUSTRE and ESTEREL. In this paradigm, single-agent reactive systems are modeled in a universe having a discrete clock. This discretization of time greatly reduces the temporal complexity of the model. We believe that the advantage of this reduction in temporal complexity is that the resulting model is in many ways better suited to automated software construction and analysis techniques (e.g., deductive synthesis, transformation, and verification) than models that are based on continuous representations of time.","PeriodicalId":369187,"journal":{"name":"Proceedings 4th IEEE International Symposium on High-Assurance Systems Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128331684","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}
Pub Date : 1900-01-01DOI: 10.1109/HASE.1999.809505
B. Di Vito
Some observers believe it is the nature of software to be inherently unreliable. Others are more hopeful, but doubt we can ever analyze software systems sufficiently well to justify dependability. Both of these viewpoints are overly pessimistic. Although building a high consequence system is not a casual undertaking, emerging assurance technologies promise improved dependability. The decision to deploy such systems must consider these assurances as well as weigh the expected benefits against the residual risk of trusting a digital control mechanism. Increased functionality can be a powerful motivation while simultaneously enhancing operational safety itself. Formal methods can give us the strong assurances we need to follow this path.
{"title":"Software can be entrusted with high consequence functionality","authors":"B. Di Vito","doi":"10.1109/HASE.1999.809505","DOIUrl":"https://doi.org/10.1109/HASE.1999.809505","url":null,"abstract":"Some observers believe it is the nature of software to be inherently unreliable. Others are more hopeful, but doubt we can ever analyze software systems sufficiently well to justify dependability. Both of these viewpoints are overly pessimistic. Although building a high consequence system is not a casual undertaking, emerging assurance technologies promise improved dependability. The decision to deploy such systems must consider these assurances as well as weigh the expected benefits against the residual risk of trusting a digital control mechanism. Increased functionality can be a powerful motivation while simultaneously enhancing operational safety itself. Formal methods can give us the strong assurances we need to follow this path.","PeriodicalId":369187,"journal":{"name":"Proceedings 4th IEEE International Symposium on High-Assurance Systems Engineering","volume":"16 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":"122702622","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：