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

Electron. Commun. Eur. Assoc. Softw. Sci. Technol.最新文献

筛选
英文 中文
First-order logic for safety verification of hedge rewriting systems 套期改写系统安全验证的一阶逻辑
Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Pub Date : 2015-11-25 DOI: 10.14279/tuj.eceasst.72.1020
A. Lisitsa
{"title":"First-order logic for safety verification of hedge rewriting systems","authors":"A. Lisitsa","doi":"10.14279/tuj.eceasst.72.1020","DOIUrl":"https://doi.org/10.14279/tuj.eceasst.72.1020","url":null,"abstract":"In this paper we deal with verification of safety properties of hedge rewriting systems and their generalizations. The verification problem is translated to a purely logical problem of finding a finite countermodel for a first-order formula, which is further tackled by a generic finite model finding procedure. We show that the proposed approach is at least as powerful as the methods using regular invariants. At the same time the finite countermodel method is shown to be efficient and applicable to the wide range of systems, including the protocols operating on unranked trees.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115088244","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
Computing Bounds for Counter Automata 计数器自动机的边界计算
Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Pub Date : 2015-11-25 DOI: 10.14279/tuj.eceasst.72.1016
Maximilien Colange, Dimitri Racordon, Didier Buchs
{"title":"Computing Bounds for Counter Automata","authors":"Maximilien Colange, Dimitri Racordon, Didier Buchs","doi":"10.14279/tuj.eceasst.72.1016","DOIUrl":"https://doi.org/10.14279/tuj.eceasst.72.1016","url":null,"abstract":"Qualitative formal verification, that seeks Boolean answers about the behavior of a system, is often insufficient for practical purposes. Observing quantitative information is of greater interest, e.g. for the calibration of a battery or a real-time scheduler. Historically, the focus has been on quantities in continuous domain, but recent years showed a renewed interest for discrete quantitative domains. Counter Automata (CA) is a quantitative extension of classical omega-automata. Recently a nice theory has been developed for them that extends the qualitative setting, with counterparts in terms of logics, automata and algebraic structure. We propose an adaptation, with plenty of practical applications,  of this formalism to express properties over discrete quantitative domains. The behavior of a Counter Automaton defines a function from infinite words to integers. Finding the bounds of such a function over a given set of words can be seen as an extension of qualitative universal and existential model-checking. Although the problem of determining whether such bounds are finite have already been addressed, efficient algorithms to compute their exact values still lack.  We propose an non-naive method for the computation of the exact values of these bounds. It relies on a generalization of the emptiness problem of omega-automata. To solve this generalized emptiness problem, we propose an algorithm that extends emptiness check algorithms based on SCC enumeration.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127788402","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
Estimating Rewards & Rare Events in Nondeterministic Systems 非确定性系统中的奖励估计与罕见事件
Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Pub Date : 2015-11-25 DOI: 10.14279/tuj.eceasst.72.1023
Axel Legay, Sean Sedwards, Louis-Marie Traonouez
{"title":"Estimating Rewards & Rare Events in Nondeterministic Systems","authors":"Axel Legay, Sean Sedwards, Louis-Marie Traonouez","doi":"10.14279/tuj.eceasst.72.1023","DOIUrl":"https://doi.org/10.14279/tuj.eceasst.72.1023","url":null,"abstract":"Exhaustive verification can quantify critical behaviour arising from concurrency in nondeterministic models. Rare events typically entail no additional challenge, but complex systems are generally intractable. Recent work on Markov decision processes allows the extremal probabilities of a property to be estimated using Monte Carlo techniques, offering the potential to handle much larger models. Here we present algorithms to estimate extremal rewards and consider the challenges posed by rarity. We find that rewards require a different interpretation of confidence and that reachability rewards require the introduction of an auxiliary hypothesis test. We show how importance sampling can significantly improve estimation when probabilities are low, but find it is not a panacea for rare schedulers.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114776939","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}
引用次数: 7
Graph Transformation with Symbolic Attributes via Monadic Coalgebra Homomorphisms 基于一元协代数同态的符号属性图变换
Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Pub Date : 2015-09-06 DOI: 10.14279/tuj.eceasst.71.999
Wolfram Kahl
{"title":"Graph Transformation with Symbolic Attributes via Monadic Coalgebra Homomorphisms","authors":"Wolfram Kahl","doi":"10.14279/tuj.eceasst.71.999","DOIUrl":"https://doi.org/10.14279/tuj.eceasst.71.999","url":null,"abstract":"We show how a coalgebraic approach leads to more natural representations of many kinds of graph structures that in the algebraic approach are frequently dealt with using ad-hoc constructions. For the case of symbolically attributed graphs, we demonstrate how using substituting coalgebra homomorphisms in double-pushout rewriting steps yields a powerful and easily understandable transformation mechanism.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128728089","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
A Unification Algorithm for GP 2 GP 2的统一算法
Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Pub Date : 2015-09-06 DOI: 10.14279/tuj.eceasst.71.1002
Ivaylo Hristakiev, D. Plump
{"title":"A Unification Algorithm for GP 2","authors":"Ivaylo Hristakiev, D. Plump","doi":"10.14279/tuj.eceasst.71.1002","DOIUrl":"https://doi.org/10.14279/tuj.eceasst.71.1002","url":null,"abstract":"The graph programming language GP 2 allows to apply sets of rule schemata (or “attributed” rules) non-deterministically. To analyse conflicts of pro- grams statically, graphs labelled with expressisons are overlayed to construct critical pairs of rule applications. Each overlay induces a system of equations whose solu- tions represent different conflicts. We present a rule-based unification algorithm for GP expressions that is terminating, sound and complete. For every input equation, the algorithm generates a finite set of substitutions. Soundness means that each of these substitutions solves the input equation. Since GP labels are lists constructed by concatenation, unification modulo associativity and unit law is required. This prob- lem, which is also known as word unification, is infinitary in general but becomes finitary due to GP’s rule schema syntax and the assumption that rule schemata are left-linear. Our unification algorithm is complete in that every solution of an input equation is an instance of some substitution in the generated set.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125523708","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
Analysis of Petri Nets with Context-Free Structure Changes 具有上下文无关结构变化的Petri网分析
Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Pub Date : 2015-09-06 DOI: 10.14279/tuj.eceasst.71.1003
Nils Erik Flick, Björn Engelmann
{"title":"Analysis of Petri Nets with Context-Free Structure Changes","authors":"Nils Erik Flick, Björn Engelmann","doi":"10.14279/tuj.eceasst.71.1003","DOIUrl":"https://doi.org/10.14279/tuj.eceasst.71.1003","url":null,"abstract":"Structure-changing Petri nets are Petri nets with transition replacement rules. In this paper, we investigate the restricted class of structure-changing workflow nets and show that two different reachability properties (concrete and abstract reachability) and word membership in the language of labelled firing sequences are decidable, while a language-based notion of correctness (containment of the language of labelled firing sequences in a regular language) is undecidable.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114400977","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
More on Graph Rewriting With Contextual Refinement 更多关于使用上下文细化的图重写
Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Pub Date : 2015-09-06 DOI: 10.14279/tuj.eceasst.71.1001
B. Hoffmann
{"title":"More on Graph Rewriting With Contextual Refinement","authors":"B. Hoffmann","doi":"10.14279/tuj.eceasst.71.1001","DOIUrl":"https://doi.org/10.14279/tuj.eceasst.71.1001","url":null,"abstract":"In GRGEN , a graph rewrite generator tool, rules have the outstanding feature that variables in their pattern and replacement graphs may be refined with meta-rules based on contextual hyperedge replacement grammars. A refined rule may delete, copy, and transform subgraphs of unbounded size and of variable shape. In this paper, we show that rules with contextual refinement can be transformed to stan- dard graph rewrite rules that perform the refinement incrementally, and are applied according to a strategy called residual rewriting. With this transformation, it is possi- ble to state precisely whether refinements can be determined in finitely many steps or not, and whether refinements are unique for every form of refined pattern or not.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123948362","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}
引用次数: 3
Preface to the proceedings of FMIS 2013 FMIS 2013论文集前言
Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Pub Date : 2015-04-05 DOI: 10.14279/tuj.eceasst.69.966.986
Judy Bowen, S. Reeves
{"title":"Preface to the proceedings of FMIS 2013","authors":"Judy Bowen, S. Reeves","doi":"10.14279/tuj.eceasst.69.966.986","DOIUrl":"https://doi.org/10.14279/tuj.eceasst.69.966.986","url":null,"abstract":"","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"273 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132928815","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
Distributed Verification of Rare Properties using Importance Splitting Observers 使用重要性分割观察器的稀有性质的分布式验证
Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Pub Date : 2015-02-06 DOI: 10.14279/tuj.eceasst.72.1024
Cyrille Jégourel, Axel Legay, Sean Sedwards, Louis-Marie Traonouez
{"title":"Distributed Verification of Rare Properties using Importance Splitting Observers","authors":"Cyrille Jégourel, Axel Legay, Sean Sedwards, Louis-Marie Traonouez","doi":"10.14279/tuj.eceasst.72.1024","DOIUrl":"https://doi.org/10.14279/tuj.eceasst.72.1024","url":null,"abstract":"Rare properties remain a challenge for statistical model checking (SMC) due to the quadratic scaling of variance with rarity. We address this with a variance reduction framework based on lightweight importance splitting observers. These expose the model-property automaton to allow the construction of score functions for high performance algorithms. \u0000The confidence intervals defined for importance splitting make it appealing for SMC, but optimising its performance in the standard way makes distribution inefficient. We show how it is possible to achieve equivalently good results in less time by distributing simpler algorithms. We first explore the challenges posed by importance splitting and present an algorithm optimised for distribution. We then define a specific bounded time logic that is compiled into memory-efficient observers to monitor executions. Finally, we demonstrate our framework on a number of challenging case studies.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131195375","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}
引用次数: 13
The GPUVerify Method: a Tutorial Overview GPUVerify方法:教程概述
Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Pub Date : 2014-11-25 DOI: 10.14279/tuj.eceasst.70.986
A. Donaldson
{"title":"The GPUVerify Method: a Tutorial Overview","authors":"A. Donaldson","doi":"10.14279/tuj.eceasst.70.986","DOIUrl":"https://doi.org/10.14279/tuj.eceasst.70.986","url":null,"abstract":"I present a tutorial overview demonstrating the key technique used by GPUVerify, a static verification tool for graphics processing unit (GPU) kernels.  The technique is a method for translating a massively parallel GPU kernel into a sequential program such that correctness of the sequential program implies data race-freedom of the parallel kernel.","PeriodicalId":115235,"journal":{"name":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol.","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115165442","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}
引用次数: 2
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信