Sci. Ann. Comput. Sci.最新文献_第8页

Faithful Modeling of Product Lines with Kripke Structures and Modal Logic 基于Kripke结构和模态逻辑的产品线忠实建模

Sci. Ann. Comput. Sci. Pub Date : 1900-01-01 DOI: 10.7561/SACS.2016.1.69

Z. Diskin, Aliakbar Safilian, T. Maibaum, Shoham Ben-David

引用次数: 3

Qualifications of Instruction Sequence Failures, Faults and Defects: Dormant, Effective, Detected, Temporary, and Permanent 指令序列故障、错误和缺陷的资格:休眠、有效、检测、临时和永久

Sci. Ann. Comput. Sci. Pub Date : 1900-01-01 DOI: 10.7561/SACS.2021.1.1

J. Bergstra

{"title":"Qualifications of Instruction Sequence Failures, Faults and Defects: Dormant, Effective, Detected, Temporary, and Permanent","authors":"J. Bergstra","doi":"10.7561/SACS.2021.1.1","DOIUrl":"https://doi.org/10.7561/SACS.2021.1.1","url":null,"abstract":"Starting out from the survey of instruction sequence faults from [6] program faults are classified according to the conventional criteria of being dormant, effective, detected, temporary, and permanent. Being retrospectively approved is introduced as an additional qualification. For this theoretical investigation the context is simplified by contemplating instruction sequences as a theoretical model for programs, and by assuming that instruction sequences are supposed to compute total transformations on finite bit sequences of a fixed length only. The main conclusion which can be drawn from this work concerns the notion of dormancy. First of all it is noticed that the unconventional notion of a dormant failure is both plausible and amenable to a straightforward and convincing definition. The conventional notion of a dormant fault, however, is much harder to grasp and the definition of a dormant fault which is provided in the paper may be disputed. The notion of a dormant fault seems to admit no convincing intuition. All faults are defects but not the other way around. The idea of a fault exclusively depends on an instruction sequence and a specification of which it is considered to be a candidate implementation. In the presence of a design, however, in addition to faults, the notion of a deviation from design (DFD) defect arises, which constitutes a class of defects many of which are not faults. For DFD defects the notion of dormancy admits a straightforward and convincing definition.","PeriodicalId":394919,"journal":{"name":"Sci. Ann. Comput. Sci.","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":"129702803","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

Model Checking Delay Differential Equations Against Metric Interval Temporal Logic 时延微分方程在度量区间时间逻辑下的模型检验

Sci. Ann. Comput. Sci. Pub Date : 1900-01-01 DOI: 10.7561/SACS.2017.1.77

P. N. Mosaad, M. Fränzle, Bai Xue

{"title":"Model Checking Delay Differential Equations Against Metric Interval Temporal Logic","authors":"P. N. Mosaad, M. Fränzle, Bai Xue","doi":"10.7561/SACS.2017.1.77","DOIUrl":"https://doi.org/10.7561/SACS.2017.1.77","url":null,"abstract":"Delay differential equations (DDEs) play an important role in the modeling of dynamic processes. Delays arise in contemporary control schemes like networked distributed control and can cause deterioration of control performance, invalidating both stability and safety properties. This induces an interest in DDE especially in the area of modeling and verification of embedded control. In this article, we present an approach aiming at automatic safety verification of a simple class of DDEs against requirements expressed in a linear-time temporal logic. As requirements specification language, we exploit metric interval temporal logic (MITL) with a continuous-time semantics evaluating signals over metric spaces. We employ an over-approximation method based on interval Taylor series to enclose the solution of the DDE and thereby reduce the continuous-time verification problem for MITL formulae to a discrete-time problem over sequences of Taylor coefficients. We encode sufficient conditions for satisfaction as SMT formulae over polynomial arithmetic and use the iSAT3 SMT solver in its bounded model-checking mode for discharging the resulting proof obligations, thus proving satisfaction of time-bounded MITL specifications by the trajectories induced by a DDE. In contrast to our preliminary work in [44], we can verify arbitrary time-bounded MITL formulae, including nesting of modalities, rather than just invariance properties.","PeriodicalId":394919,"journal":{"name":"Sci. Ann. Comput. Sci.","volume":"24 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":"128945840","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}

引用次数: 0

Quasi-Algebras versus Regular Algebras - Part I 拟代数与正则代数-第一部分

Sci. Ann. Comput. Sci. Pub Date : 1900-01-01 DOI: 10.7561/SACS.2015.1.89

A. Iorgulescu

引用次数: 3

On Safety Properties and Their Monitoring 安全属性及其监测

Sci. Ann. Comput. Sci. Pub Date : 1900-01-01 DOI: 10.7561/SACS.2012.2.327

Grigore Roşu

引用次数: 16

Derived-Term Automata of Multitape Expressions with Composition 复合多带表达式的派生项自动机

Sci. Ann. Comput. Sci. Pub Date : 1900-01-01 DOI: 10.7561/SACS.2017.2.137

A. Demaille

引用次数: 3

Simulation and Verification in a Process Calculus for Spatially-Explicit Ecological Models 空间显式生态模型过程演算的模拟与验证

Sci. Ann. Comput. Sci. Pub Date : 1900-01-01 DOI: 10.7561/SACS.2013.1.119

A. Philippou, Mauricio Toro, Margarita Antonaki

引用次数: 29

UC and EUC Weak Bit-Commitments Using Seal-Once Tamper-Evidence UC和EUC使用一次签名篡改证据的弱比特承诺

Sci. Ann. Comput. Sci. Pub Date : 1900-01-01 DOI: 10.7561/SACS.2013.2.191

Ioana Boureanu, S. Vaudenay

{"title":"UC and EUC Weak Bit-Commitments Using Seal-Once Tamper-Evidence","authors":"Ioana Boureanu, S. Vaudenay","doi":"10.7561/SACS.2013.2.191","DOIUrl":"https://doi.org/10.7561/SACS.2013.2.191","url":null,"abstract":"Based on tamper-evident devices, i.e., a type of distinguishable, sealed envelopes, we put forward weak bit-commitment protocols which are UC-secure. These commitments are weak in that it is legitimate that a party could cheat. Unlike in several similar lines of work, in our case, the party is not obliged to cheat, but he has ability to cheat if and when needed. The empowered party is the sender, i.e., the protocols are also sender-strong. We motivate the construction of such primitives at both theoretical and practical levels. Such protocols complete the picture of existent receiver-strong weak bit-commitments based on tamper-evidence. We also show that existent receiver-strong protocols of the kind are not EUC-secure, i.e., they are only UC-secure. Further, we put forward a second formalisation of tamper-evident distinguishable envelopes which renders those protocols and the protocols herein EUC-secure. We finally draw most implication-relations between the tamper-evident devices, our weak sender-strong commitments, the existent weak receiver-strong commitments, as well as standard commitments. The mechanisms at the foundation of these primitives are lightweight and the protocols yielded are end-to-end humanly verifiable.","PeriodicalId":394919,"journal":{"name":"Sci. Ann. Comput. Sci.","volume":"144 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":"123256117","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}

引用次数: 0

A Calculus of Evolving Objects 演化物体的演算

Sci. Ann. Comput. Sci. Pub Date : 1900-01-01 DOI: 10.7892/BORIS.37161

M. Dezani-Ciancaglini, P. Giannini, Oscar Nierstrasz

{"title":"A Calculus of Evolving Objects","authors":"M. Dezani-Ciancaglini, P. Giannini, Oscar Nierstrasz","doi":"10.7892/BORIS.37161","DOIUrl":"https://doi.org/10.7892/BORIS.37161","url":null,"abstract":"The demands of developing modern, highly dynamic applications have led to an increasing interest in dynamic programming languages and mechanisms. Not only applications must evolve over time, but the object models themselves may need to be adapted to the requirements of different run-time contexts. Class-based models and prototype-based models, for example, may need to co-exist to meet the demands of dynamically evolving applications. Multi-dimensional dispatch, fine-grained and dynamic software composition, and run-time evolution of behaviour are further examples of diverse mechanisms which may need to co-exist in a dynamically evolving run-time environment How can we model the semantics of these highly dynamic features, yet still offer some reasonable safety guarantees? To this end we present an original calculus in which objects can adapt their behaviour at run-time to changing contexts. Both objects and environments are represented by first-class mappings between variables and values. Message sends are dynamically resolved to method calls. Variables may be dynamically bound, making it possible to model a variety of dynamic mechanisms within the same calculus. Despite the highly dynamic nature of the calculus, safety properties are assured by a type assignment system.","PeriodicalId":394919,"journal":{"name":"Sci. Ann. Comput. Sci.","volume":"53 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":"117143008","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}

引用次数: 9

Dynamic Chromatic Number of Bipartite Graphs 二部图的动态色数

Sci. Ann. Comput. Sci. Pub Date : 1900-01-01 DOI: 10.7561/SACS.2016.2.249

S. Saqaeeyan, Esmaiel Mollaahamdi

引用次数: 3