Acta Informatica最新文献_第5页

Constrained polynomial zonotopes 约束多项式带拓扑

IF 0.6 4区计算机科学

Acta Informatica Pub Date : 2023-05-05 DOI: 10.1007/s00236-023-00437-5

Niklas Kochdumper, Matthias Althoff

引用次数: 16

HIV Never Sleeps: Evidence to Support Early Antiretroviral Treatment. HIV永不眠:支持早期抗逆转录病毒治疗的证据

4区计算机科学

Acta Informatica Pub Date : 2023-05-01 DOI: 10.4049/jimmunol.2300035

Barton F Haynes

引用次数: 0

On the undecidability and descriptional complexity of synchronized regular expressions 同步正则表达式的不可判定性和描述复杂性

IF 0.6 4区计算机科学

Acta Informatica Pub Date : 2023-04-10 DOI: 10.1007/s00236-023-00439-3

Jingnan Xie, Harry B. Hunt III

{"title":"On the undecidability and descriptional complexity of synchronized regular expressions","authors":"Jingnan Xie, Harry B. Hunt III","doi":"10.1007/s00236-023-00439-3","DOIUrl":"10.1007/s00236-023-00439-3","url":null,"abstract":"<div>In Freydenberger (Theory Comput Syst 53(2):159–193, 2013. https://doi.org/10.1007/s00224-012-9389-0), Freydenberger shows that the set of invalid computations of an extended Turing machine can be recognized by a synchronized regular expression [as defined in Della Penna et al. (Acta Informatica 39(1):31–70, 2003. https://doi.org/10.1007/s00236-002-0099-y)]. Therefore, the widely discussed predicate “(={0,1}^*)” is not recursively enumerable for synchronized regular expressions (SRE). In this paper, we employ a stronger form of non-recursive enumerability called productiveness and show that the set of invalid computations of a deterministic Turing machine on a single input can be recognized by a synchronized regular expression. Hence, for a polynomial-time decidable subset of SRE, where each expression generates either ({0, 1}^*) or ({0, 1}^* -{w}) where (w in {0, 1}^*), the predicate “(={0,1}^*)” is productive. This result can be easily applied to other classes of language descriptors due to the simplicity of the construction in its proof. This result also implies that many computational problems, especially promise problems, for SRE are productive. These problems include language class comparison problems (e.g., does a given synchronized regular expression generate a context-free language?), and equivalence and containment problems of several types (e.g., does a given synchronized regular expression generate a language equal to a fixed unbounded regular set?). In addition, we study the descriptional complexity of SRE. A generalized method for studying trade-offs between SRE and many classes of language descriptors is established.</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"60 3","pages":"257 - 278"},"PeriodicalIF":0.6,"publicationDate":"2023-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-023-00439-3.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44264085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Toward a theory of program repair 走向程序修复理论

IF 0.6 4区计算机科学

Acta Informatica Pub Date : 2023-03-27 DOI: 10.1007/s00236-023-00438-4

Besma Khaireddine, Aleksandr Zakharchenko, Matias Martinez, Ali Mili

{"title":"Toward a theory of program repair","authors":"Besma Khaireddine, Aleksandr Zakharchenko, Matias Martinez, Ali Mili","doi":"10.1007/s00236-023-00438-4","DOIUrl":"10.1007/s00236-023-00438-4","url":null,"abstract":"<div>To repair a program does not mean to make it (absolutely) correct; it only means to make it more-correct than it was originally. This is not a mundane academic distinction: given that programs typically have about a dozen faults per KLOC, it is important for program repair methods and tools to be designed in such a way that they map an incorrect program into a more-correct, albeit still potentially incorrect, program. Yet in the absence of a concept of relative correctness, many program repair methods and tools resort to approximations of absolute correctness; since these methods and tools are often validated against programs with a single fault, making them absolutely correct is indistinguishable from making them more-correct; this has contributed to conceal/obscure the absence of (and the need for) relative correctness. In this paper, we propose a theory of program repair based on a concept of relative correctness. We aspire to encourage researchers in program repair to explicitly specify what concept of relative correctness their method or tool is based upon; and to validate their method or tool by proving that it does enhance relative correctness, as defined.</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"60 3","pages":"209 - 255"},"PeriodicalIF":0.6,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41562782","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On partial information retrieval: the unconstrained 100 prisoner problem 关于部分信息检索：无约束的100名囚犯问题

IF 0.6 4区计算机科学

Acta Informatica Pub Date : 2022-12-30 DOI: 10.1007/s00236-022-00436-y

Ivano Lodato, Snehal M. Shekatkar, Tian An Wong

引用次数: 0

Decentralized runtime verification of message sequences in message-based systems 基于消息的系统中消息序列的分散运行时验证

IF 0.6 4区计算机科学

Acta Informatica Pub Date : 2022-10-10 DOI: 10.1007/s00236-022-00435-z

Mahboubeh Samadi, Fatemeh Ghassemi, Ramtin Khosravi

{"title":"Decentralized runtime verification of message sequences in message-based systems","authors":"Mahboubeh Samadi, Fatemeh Ghassemi, Ramtin Khosravi","doi":"10.1007/s00236-022-00435-z","DOIUrl":"10.1007/s00236-022-00435-z","url":null,"abstract":"<div>Message-based systems are usually distributed in nature, and distributed components collaborate via asynchronous message passing. In some cases, particular ordering among the messages may lead to violation of the desired properties such as data confidentiality. Due to the absence of a global clock and usage of off-the-shelf components, such unwanted orderings can be neither statically inspected nor verified by revising their codes at design time. We propose a choreography-based runtime verification algorithm that given an automata-based specification of unwanted message sequences detects the formation of the unwanted sequences. Our algorithm is fully decentralized in the sense that each component is equipped with a monitor, as opposed to having a centralized monitor, and also the specification of the unwanted sequences is decomposed among monitors. In this way, when a component sends a message, its monitor inspects if there is a possibility for the formation of unwanted message sequences. As there is no global clock in message-based systems, monitors cannot determine the exact ordering among messages. In such cases, they decide conservatively and declare a sequence formation even if that sequence has not been formed. We prevent such conservative declarations in our algorithm as much as possible and then characterize its operational guarantees. We evaluate the efficiency and scalability of our algorithm in terms of the communication overhead, the memory consumption, and the latency of the result declaration through simulation.</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"60 2","pages":"145 - 178"},"PeriodicalIF":0.6,"publicationDate":"2022-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46797326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Exploration of k-edge-deficient temporal graphs 缺k边时间图的探索

IF 0.6 4区计算机科学

Acta Informatica Pub Date : 2022-08-27 DOI: 10.1007/s00236-022-00421-5

Thomas Erlebach, Jakob T. Spooner

{"title":"Exploration of k-edge-deficient temporal graphs","authors":"Thomas Erlebach, Jakob T. Spooner","doi":"10.1007/s00236-022-00421-5","DOIUrl":"10.1007/s00236-022-00421-5","url":null,"abstract":"<div>A temporal graph with lifetime L is a sequence of L graphs (G_1, ldots ,G_L), called layers, all of which have the same vertex set V but can have different edge sets. The underlying graph is the graph with vertex set V that contains all the edges that appear in at least one layer. The temporal graph is always connected if each layer is a connected graph, and it is k-edge-deficient if each layer contains all except at most k edges of the underlying graph. For a given start vertex s, a temporal exploration is a temporal walk that starts at s, traverses at most one edge in each layer, and visits all vertices of the temporal graph. We show that always-connected, k-edge-deficient temporal graphs with sufficient lifetime can always be explored in (O(kn log n)) time steps. We also construct always-connected, k-edge-deficient temporal graphs for which any exploration requires (varOmega (n log k)) time steps. For always-connected, 1-edge-deficient temporal graphs, we show that O(n) time steps suffice for temporal exploration.</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 4","pages":"387 - 407"},"PeriodicalIF":0.6,"publicationDate":"2022-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-022-00421-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42775206","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Properties of graphs specified by a regular language 由常规语言指定的图的属性

IF 0.6 4区计算机科学

Acta Informatica Pub Date : 2022-08-12 DOI: 10.1007/s00236-022-00427-z

Volker Diekert, Henning Fernau, Petra Wolf

{"title":"Properties of graphs specified by a regular language","authors":"Volker Diekert, Henning Fernau, Petra Wolf","doi":"10.1007/s00236-022-00427-z","DOIUrl":"10.1007/s00236-022-00427-z","url":null,"abstract":"<div>Traditionally, graph algorithms get a single graph as input, and then they should decide if this graph satisfies a certain property (varPhi ). What happens if this question is modified in a way that we get a possibly infinite family of graphs as an input, and the question is if there is a graph satisfying (varPhi ) in the family? We approach this question by using formal languages for specifying families of graphs, in particular by regular sets of words. We show that certain graph properties can be decided by studying the syntactic monoid of the specification language L if a certain torsion condition is satisfied. This condition holds trivially if L is regular. More specifically, we use a natural binary encoding of finite graphs over a binary alphabet (varSigma ), and we define a regular set (mathbb {G}subseteq varSigma ^*) such that every nonempty word (win mathbb {G}) defines a finite and nonempty graph. Also, graph properties can then be syntactically defined as languages over (varSigma ). Then, we ask whether the automaton (mathcal {A}) specifies some graph satisfying a certain property (varPhi ). Our structural results show that we can answer this question for all “typical” graph properties. In order to show our results, we split L into a finite union of subsets and every subset of this union defines in a natural way a single finite graph F where some edges and vertices are marked. The marked graph in turn defines an infinite graph (F^infty ) and therefore the family of finite subgraphs of (F^infty ) where F appears as an induced subgraph. This yields a geometric description of all graphs specified by L based on splitting L into finitely many pieces; then using the notion of graph retraction, we obtain an easily understandable description of the graphs in each piece.</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 4","pages":"357 - 385"},"PeriodicalIF":0.6,"publicationDate":"2022-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-022-00427-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41686213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Preface to Klaus-Jörn Lange Festschrift 克劳斯-约恩-兰格艺术节序言

IF 0.6 4区计算机科学

Acta Informatica Pub Date : 2022-08-09 DOI: 10.1007/s00236-022-00426-0

Henning Fernau, Markus Holzer, Petra Wolf

引用次数: 0

On the decidability of finding a positive ILP-instance in a regular set of ILP-instances 关于在正则ILP实例集中找到正ILP实例的判定性

IF 0.6 4区计算机科学

Acta Informatica Pub Date : 2022-08-04 DOI: 10.1007/s00236-022-00429-x

Petra Wolf

{"title":"On the decidability of finding a positive ILP-instance in a regular set of ILP-instances","authors":"Petra Wolf","doi":"10.1007/s00236-022-00429-x","DOIUrl":"10.1007/s00236-022-00429-x","url":null,"abstract":"<div>The regular intersection emptiness problem for a decision problem P (({{textit{int}}_{{mathrm {Reg}}}})(P)) is to decide whether a potentially infinite regular set of encoded P-instances contains a positive one. Since ({{textit{int}}_{{mathrm {Reg}}}})(P) is decidable for some NP-complete problems and undecidable for others, its investigation provides insights in the nature of NP-complete problems. Moreover, the decidability of the ({{textit{int}}_{{mathrm {Reg}}}})-problem is usually achieved by exploiting the regularity of the set of instances; thus, it also establishes a connection to formal language and automata theory. We consider the ({{textit{int}}_{{mathrm {Reg}}}})-problem for the well-known NP-complete problem Integer Linear Programming (ILP). It is shown that any DFA that describes a set of ILP-instances (in a natural encoding) can be reduced to a finite core of instances that contains a positive one if and only if the original set of instances did. This result yields the decidability of ({{textit{int}}_{{mathrm {Reg}}}})(ILP).</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 4","pages":"505 - 519"},"PeriodicalIF":0.6,"publicationDate":"2022-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-022-00429-x.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41604344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0