Automated Technology for Verification and Analysis最新文献_第9页

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility 具有长度约束的二次字方程，计数器系统和具有可整除性的Presburger算法

Automated Technology for Verification and Analysis Pub Date : 2018-05-17 DOI: 10.46298/lmcs-17(4:4)2021

A. Lin, R. Majumdar

{"title":"Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility","authors":"A. Lin, R. Majumdar","doi":"10.46298/lmcs-17(4:4)2021","DOIUrl":"https://doi.org/10.46298/lmcs-17(4:4)2021","url":null,"abstract":"Word equations are a crucial element in the theoretical foundation of\u0000constraint solving over strings. A word equation relates two words over string\u0000variables and constants. Its solution amounts to a function mapping variables\u0000to constant strings that equate the left and right hand sides of the equation.\u0000While the problem of solving word equations is decidable, the decidability of\u0000the problem of solving a word equation with a length constraint (i.e., a\u0000constraint relating the lengths of words in the word equation) has remained a\u0000long-standing open problem. We focus on the subclass of quadratic word\u0000equations, i.e., in which each variable occurs at most twice. We first show\u0000that the length abstractions of solutions to quadratic word equations are in\u0000general not Presburger-definable. We then describe a class of counter systems\u0000with Presburger transition relations which capture the length abstraction of a\u0000quadratic word equation with regular constraints. We provide an encoding of the\u0000effect of a simple loop of the counter systems in the existential theory of\u0000Presburger Arithmetic with divisibility (PAD). Since PAD is decidable (NP-hard\u0000and is in NEXP), we obtain a decision procedure for quadratic words equations\u0000with length constraints for which the associated counter system is flat (i.e.,\u0000all nodes belong to at most one cycle). In particular, we show a decidability\u0000result (in fact, also an NP algorithm with a PAD oracle) for a recently\u0000proposed NP-complete fragment of word equations called regular-oriented word\u0000equations, when augmented with length constraints. We extend this decidability\u0000result (in fact, with a complexity upper bound of PSPACE with a PAD oracle) in\u0000the presence of regular constraints.","PeriodicalId":335085,"journal":{"name":"Automated Technology for Verification and Analysis","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129170000","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}

引用次数: 29

Accelerated Model Checking of Parametric Markov Chains 参数马尔可夫链的加速模型检验

Automated Technology for Verification and Analysis Pub Date : 2018-05-15 DOI: 10.1007/978-3-030-01090-4_18

Paul Gainer, E. M. Hahn, S. Schewe

引用次数: 19

EthIR: A Framework for High-Level Analysis of Ethereum Bytecode EthIR:以太坊字节码的高级分析框架

Automated Technology for Verification and Analysis Pub Date : 2018-05-10 DOI: 10.1007/978-3-030-01090-4_30

E. Albert, Pablo Gordillo, B. Livshits, A. Rubio, Ilya Sergey

引用次数: 96

Lazy Abstraction-Based Controller Synthesis 基于惰性抽象的控制器合成

Automated Technology for Verification and Analysis Pub Date : 2018-04-08 DOI: 10.1007/978-3-030-31784-3_2

Kyle Hsu, R. Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck

引用次数: 2

Maximum Realizability for Linear Temporal Logic Specifications 线性时序逻辑规范的最大可实现性

Automated Technology for Verification and Analysis Pub Date : 2018-04-02 DOI: 10.1007/978-3-030-01090-4_27

Rayna Dimitrova, Mahsa Ghasemi, U. Topcu

引用次数: 17

Synthesis in pMDPs: A Tale of 1001 Parameters pMDPs的合成:1001个参数的故事

Automated Technology for Verification and Analysis Pub Date : 2018-03-05 DOI: 10.1007/978-3-030-01090-4_10

Murat Cubuktepe, N. Jansen, Sebastian Junges, J. Katoen, U. Topcu

引用次数: 39

Enhancing Symbolic Execution of Heap-based Programs with Separation Logic for Test Input Generation 用分离逻辑增强基于堆程序的符号执行，用于测试输入生成

Automated Technology for Verification and Analysis Pub Date : 2017-12-16 DOI: 10.1007/978-3-030-31784-3_12

Long H. Pham, Quang Loc Le, Quoc-Sang Phan, Jun Sun, S. Qin

引用次数: 18

May-Happen-in-Parallel Analysis with Returned Futures 可能发生的平行分析与回归期货

Automated Technology for Verification and Analysis Pub Date : 2017-10-03 DOI: 10.1007/978-3-319-68167-2_3

E. Albert, S. Genaim, Pablo Gordillo

引用次数: 2

Concurrent Program Verification with Invariant-Guided Underapproximation 不变量引导下的欠逼近并发程序验证

Automated Technology for Verification and Analysis Pub Date : 2017-10-03 DOI: 10.1007/978-3-319-68167-2_17

Sumanth Prabhu, P. Schrammel, M. Srivas, Michael Tautschnig, Anand Yeolekar

引用次数: 3

Fixing the State Budget: Approximation of Regular Languages with Small DFAs 固定国家预算:用小dfa逼近正规语言

Automated Technology for Verification and Analysis Pub Date : 2017-10-03 DOI: 10.1007/978-3-319-68167-2_5

G. Gange, P. Ganty, Peter James Stuckey

引用次数: 5