首页 > 最新文献

2014 Formal Methods in Computer-Aided Design (FMCAD)最新文献

英文 中文
Under-approximate flowpipes for non-linear continuous systems 非线性连续系统的欠近似流管
Pub Date : 2014-10-21 DOI: 10.1109/FMCAD.2014.6987596
Xin Chen, S. Sankaranarayanan, E. Ábrahám
We propose an approach for computing under- as well as over-approximations for the reachable sets of continuous systems which are defined by non-linear Ordinary Differential Equations (ODEs). Given a compact and connected initial set of states, described by a system of polynomial inequalities, we compute under-approximations of the set of states reachable over time. Our approach is based on a simple yet elegant technique to obtain an accurate Taylor model over-approximation for a backward flowmap based on well-known techniques to over-approximate the forward map. Next, we show that this over-approximation can be used to yield both over- and under-approximations for the forward reachable sets. Based on the result, we are able to conclude "may" as well as "must" reachability to prove properties or conclude the existence of counterexamples. A prototype of the approach is implemented and its performance is evaluated over a reasonable number of benchmarks.
本文提出了一种计算非线性常微分方程定义的连续系统可达集的欠逼近和过逼近的方法。给定一个由多项式不等式系统描述的紧致且连通的初始状态集,我们计算随时间可达的状态集的欠逼近。我们的方法是基于一种简单而优雅的技术来获得精确的泰勒模型过逼近后向流程图,该技术基于众所周知的过逼近前向流程图的技术。接下来,我们证明了这种过近似可以用于前向可达集的过近似和欠近似。根据结果,我们可以得出“可能”和“必须”的可达性来证明性质或得出反例的存在性。实现了该方法的原型,并在合理数量的基准测试上评估了其性能。
{"title":"Under-approximate flowpipes for non-linear continuous systems","authors":"Xin Chen, S. Sankaranarayanan, E. Ábrahám","doi":"10.1109/FMCAD.2014.6987596","DOIUrl":"https://doi.org/10.1109/FMCAD.2014.6987596","url":null,"abstract":"We propose an approach for computing under- as well as over-approximations for the reachable sets of continuous systems which are defined by non-linear Ordinary Differential Equations (ODEs). Given a compact and connected initial set of states, described by a system of polynomial inequalities, we compute under-approximations of the set of states reachable over time. Our approach is based on a simple yet elegant technique to obtain an accurate Taylor model over-approximation for a backward flowmap based on well-known techniques to over-approximate the forward map. Next, we show that this over-approximation can be used to yield both over- and under-approximations for the forward reachable sets. Based on the result, we are able to conclude \"may\" as well as \"must\" reachability to prove properties or conclude the existence of counterexamples. A prototype of the approach is implemented and its performance is evaluated over a reasonable number of benchmarks.","PeriodicalId":363683,"journal":{"name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128613362","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}
引用次数: 41
Patient-specific models from inter-patient biological models and clinical records 患者特异性模型来自患者间生物学模型和临床记录
Pub Date : 2014-10-21 DOI: 10.1109/FMCAD.2014.6987615
E. Tronci, Toni Mancini, Ivano Salvo, S. Sinisi, F. Mari, I. Melatti, A. Massini, Francesco Davi, T. Dierkes, R. Ehrig, S. Röblitz, B. Leeners, T. Kruger, M. Egli, F. Ille
One of the main goals of systems biology models in a health-care context is to individualise models in order to compute patient-specific predictions for the time evolution of species (e.g., hormones) concentrations. In this paper we present a statistical model checking based approach that, given an inter-patient model and a few clinical measurements, computes a value for the model parameter vector (model individualisation) that, with high confidence, is a global minimum for the function evaluating the mismatch between the model predictions and the available measurements. We evaluate effectiveness of the proposed approach by presenting experimental results on using the GynCycle model (describing the feedback mechanisms regulating a number of reproductive hormones) to compute patient-specific predictions for the time evolution of blood concentrations of E2 (Estradiol), P4 (Progesterone), FSH (Follicle-Stimulating Hormone) and LH (Luteinizing Hormone) after a certain number of clinical measurements.
在卫生保健环境中,系统生物学模型的主要目标之一是使模型个性化,以便计算特定于患者的物种(例如激素)浓度的时间进化预测。在本文中,我们提出了一种基于统计模型检查的方法,该方法给定患者间模型和一些临床测量,计算模型参数向量(模型个性化)的值,该值具有高置信度,是评估模型预测与可用测量之间不匹配的函数的全局最小值。我们通过使用gyyncycle模型(描述调节多种生殖激素的反馈机制)计算特定患者在一定数量的临床测量后血液中E2(雌二醇)、P4(黄体酮)、FSH(促卵泡激素)和LH(黄体生成素)浓度的时间演变的实验结果来评估所提出方法的有效性。
{"title":"Patient-specific models from inter-patient biological models and clinical records","authors":"E. Tronci, Toni Mancini, Ivano Salvo, S. Sinisi, F. Mari, I. Melatti, A. Massini, Francesco Davi, T. Dierkes, R. Ehrig, S. Röblitz, B. Leeners, T. Kruger, M. Egli, F. Ille","doi":"10.1109/FMCAD.2014.6987615","DOIUrl":"https://doi.org/10.1109/FMCAD.2014.6987615","url":null,"abstract":"One of the main goals of systems biology models in a health-care context is to individualise models in order to compute patient-specific predictions for the time evolution of species (e.g., hormones) concentrations. In this paper we present a statistical model checking based approach that, given an inter-patient model and a few clinical measurements, computes a value for the model parameter vector (model individualisation) that, with high confidence, is a global minimum for the function evaluating the mismatch between the model predictions and the available measurements. We evaluate effectiveness of the proposed approach by presenting experimental results on using the GynCycle model (describing the feedback mechanisms regulating a number of reproductive hormones) to compute patient-specific predictions for the time evolution of blood concentrations of E2 (Estradiol), P4 (Progesterone), FSH (Follicle-Stimulating Hormone) and LH (Luteinizing Hormone) after a certain number of clinical measurements.","PeriodicalId":363683,"journal":{"name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125361753","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}
引用次数: 38
On interpolants and variable assignments 关于插值和变量赋值
Pub Date : 2014-10-21 DOI: 10.1109/FMCAD.2014.6987604
Pavel Jancík, J. Kofroň, Simone Rollini, N. Sharygina
Craig interpolants are widely used in program verification as a means of abstraction. In this paper, we (i) introduce Partial Variable Assignment Interpolants (PVAIs) as a generalization of Craig interpolants. A variable assignment focuses computed interpolants by restricting the set of clauses taken into account during interpolation. PVAIs can be for example employed in the context of DAG interpolation, in order to prevent unwanted out-of-scope variables to appear in interpolants. Furthermore, we (ii) present a way to compute PVAIs for propositional logic based on an extension of the Labeled Interpolation Systems, and (iii) analyze the strength of computed interpolants and prove the conditions under which they have the path interpolation property.
克雷格插值作为一种抽象的方法被广泛应用于程序验证中。在本文中,我们(i)引入了部分变量分配插值(PVAIs)作为克雷格插值的推广。变量赋值通过限制内插过程中考虑的子句集来集中计算内插。例如,pvai可以在DAG插值的上下文中使用,以防止不需要的范围外变量出现在插值中。此外,我们(ii)提出了一种基于标记插值系统的扩展来计算命题逻辑的pvis的方法,(iii)分析了计算插值的强度并证明了它们具有路径插值性质的条件。
{"title":"On interpolants and variable assignments","authors":"Pavel Jancík, J. Kofroň, Simone Rollini, N. Sharygina","doi":"10.1109/FMCAD.2014.6987604","DOIUrl":"https://doi.org/10.1109/FMCAD.2014.6987604","url":null,"abstract":"Craig interpolants are widely used in program verification as a means of abstraction. In this paper, we (i) introduce Partial Variable Assignment Interpolants (PVAIs) as a generalization of Craig interpolants. A variable assignment focuses computed interpolants by restricting the set of clauses taken into account during interpolation. PVAIs can be for example employed in the context of DAG interpolation, in order to prevent unwanted out-of-scope variables to appear in interpolants. Furthermore, we (ii) present a way to compute PVAIs for propositional logic based on an extension of the Labeled Interpolation Systems, and (iii) analyze the strength of computed interpolants and prove the conditions under which they have the path interpolation property.","PeriodicalId":363683,"journal":{"name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124261709","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}
引用次数: 8
Using interval constraint propagation for pseudo-Boolean constraint solving 区间约束传播法求解伪布尔约束
Pub Date : 2014-10-21 DOI: 10.1109/FMCAD.2014.6987614
Karsten Scheibler, B. Becker
This work is motivated by (1) a practical application which automatically generates test patterns for integrated circuits and (2) the observation that off-the-shelf state-of-the-art pseudo-Boolean solvers have difficulties in solving instances with huge pseudo-Boolean constraints as created by our application. Derived from the SMT solver iSAT3 we present the solver iSAT3p that on the one hand allows the efficient handling of huge pseudo-Boolean constraints with several thousand summands and large integer coefficients. On the other hand, experimental results demonstrate that at the same time iSAT3p is competitive or even superior to other solvers on standard pseudo-Boolean benchmark families.
这项工作的动机是:(1)自动生成集成电路测试模式的实际应用;(2)观察到现成的最先进的伪布尔求解器在解决由我们的应用程序创建的具有巨大伪布尔约束的实例时存在困难。在SMT求解器iSAT3的基础上,我们提出了iSAT3p求解器,它一方面可以有效地处理具有数千求和和大整数系数的巨大伪布尔约束。另一方面,实验结果同时表明,iSAT3p在标准伪布尔基准族上与其他求解器具有竞争力,甚至优于其他求解器。
{"title":"Using interval constraint propagation for pseudo-Boolean constraint solving","authors":"Karsten Scheibler, B. Becker","doi":"10.1109/FMCAD.2014.6987614","DOIUrl":"https://doi.org/10.1109/FMCAD.2014.6987614","url":null,"abstract":"This work is motivated by (1) a practical application which automatically generates test patterns for integrated circuits and (2) the observation that off-the-shelf state-of-the-art pseudo-Boolean solvers have difficulties in solving instances with huge pseudo-Boolean constraints as created by our application. Derived from the SMT solver iSAT3 we present the solver iSAT3p that on the one hand allows the efficient handling of huge pseudo-Boolean constraints with several thousand summands and large integer coefficients. On the other hand, experimental results demonstrate that at the same time iSAT3p is competitive or even superior to other solvers on standard pseudo-Boolean benchmark families.","PeriodicalId":363683,"journal":{"name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122639007","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
Infinite-state backward exploration of Boolean broadcast programs 布尔广播节目的无限状态反向探索
Pub Date : 2014-10-21 DOI: 10.1109/FMCAD.2014.6987608
Peizun Liu, T. Wahl
Assertion checking for non-recursive unbounded-thread Boolean programs can be performed in principle by converting the program into an infinite-state transition system such as a Petri net and subjecting the system to a coverability check, for which sound and complete algorithms exist. Said conversion adds, however, an additional heavy burden to these already expensive algorithms, as the number of system states is exponential in the size of the program. Our solution to this problem avoids the construction of a Petri net and instead applies the coverability algorithm directly to the Boolean program. A challenge is that, in the presence of advanced communication primitives such as broadcasts, the coverability algorithm proceeds backwards, requiring a backward execution of the program. The benefit of avoiding the up-front transition system construction is that "what you see is what you pay": only system states backward-reachable from the target state are generated, often resulting in dramatic savings. We demonstrate this using Boolean programs constructed by the SatAbs predicate abstraction engine.
原则上,可以通过将程序转换为无限状态转换系统(如Petri网)并对系统进行可覆盖性检查来执行非递归无界线程布尔程序的断言检查,因为存在可靠和完整的算法。然而,上述转换给这些已经很昂贵的算法增加了额外的沉重负担,因为系统状态的数量与程序的大小呈指数级增长。我们的解决方案避免了构造Petri网,而是将可覆盖性算法直接应用于布尔程序。一个挑战是,在存在高级通信原语(如广播)的情况下,可覆盖性算法向后进行,需要向后执行程序。避免预先转换系统构造的好处是“所见即所得”:只生成从目标状态向后可达的系统状态,这通常会带来巨大的节省。我们使用由SatAbs谓词抽象引擎构造的布尔程序来演示这一点。
{"title":"Infinite-state backward exploration of Boolean broadcast programs","authors":"Peizun Liu, T. Wahl","doi":"10.1109/FMCAD.2014.6987608","DOIUrl":"https://doi.org/10.1109/FMCAD.2014.6987608","url":null,"abstract":"Assertion checking for non-recursive unbounded-thread Boolean programs can be performed in principle by converting the program into an infinite-state transition system such as a Petri net and subjecting the system to a coverability check, for which sound and complete algorithms exist. Said conversion adds, however, an additional heavy burden to these already expensive algorithms, as the number of system states is exponential in the size of the program. Our solution to this problem avoids the construction of a Petri net and instead applies the coverability algorithm directly to the Boolean program. A challenge is that, in the presence of advanced communication primitives such as broadcasts, the coverability algorithm proceeds backwards, requiring a backward execution of the program. The benefit of avoiding the up-front transition system construction is that \"what you see is what you pay\": only system states backward-reachable from the target state are generated, often resulting in dramatic savings. We demonstrate this using Boolean programs constructed by the SatAbs predicate abstraction engine.","PeriodicalId":363683,"journal":{"name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133907409","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}
引用次数: 12
Towards Pareto-optimal parameter synthesis for monotonie cost functions 单调代价函数的帕累托最优参数合成
Pub Date : 2014-10-21 DOI: 10.1109/FMCAD.2014.6987591
Benjamin Bittner, M. Bozzano, A. Cimatti, M. Gario, A. Griggio
Designers are often required to explore alternative solutions, trading off along different dimensions (e.g., power consumption, weight, cost, reliability, response time). Such exploration can be encoded as a problem of parameter synthesis, i.e., finding a parameter valuation (representing a design solution) such that the corresponding system satisfies a desired property. In this paper, we tackle the problem of parameter synthesis with multi-dimensional cost functions by finding solutions that are in the Pareto front: in the space of best trade-offs possible. We propose several algorithms, based on IC3, that interleave in various ways the search for parameter valuations that satisfy the property, and the optimization with respect to costs. The most effective one relies on the reuse of inductive invariants and on the extraction of unsatisfiable cores to accelerate convergence. Our experimental evaluation shows the feasibility of the approach on practical benchmarks from diagnosability synthesis and product-line engineering, and demonstrates the importance of a tight integration between model checking and cost optimization.
设计师经常需要探索替代解决方案,在不同的维度(例如,功耗、重量、成本、可靠性、响应时间)上进行权衡。这种探索可以被编码为一个参数综合问题,即,找到一个参数估值(代表一个设计解决方案),使相应的系统满足期望的属性。在本文中,我们通过寻找帕累托前沿的解决方案来解决多维成本函数的参数综合问题:在可能的最佳权衡空间中。我们提出了几种基于IC3的算法,以各种方式交错搜索满足属性的参数估值,以及关于成本的优化。最有效的方法是通过重用归纳不变量和提取不满意的核来加速收敛。我们的实验评估表明了该方法在可诊断性综合和产品线工程的实际基准上的可行性,并证明了模型检查和成本优化之间紧密集成的重要性。
{"title":"Towards Pareto-optimal parameter synthesis for monotonie cost functions","authors":"Benjamin Bittner, M. Bozzano, A. Cimatti, M. Gario, A. Griggio","doi":"10.1109/FMCAD.2014.6987591","DOIUrl":"https://doi.org/10.1109/FMCAD.2014.6987591","url":null,"abstract":"Designers are often required to explore alternative solutions, trading off along different dimensions (e.g., power consumption, weight, cost, reliability, response time). Such exploration can be encoded as a problem of parameter synthesis, i.e., finding a parameter valuation (representing a design solution) such that the corresponding system satisfies a desired property. In this paper, we tackle the problem of parameter synthesis with multi-dimensional cost functions by finding solutions that are in the Pareto front: in the space of best trade-offs possible. We propose several algorithms, based on IC3, that interleave in various ways the search for parameter valuations that satisfy the property, and the optimization with respect to costs. The most effective one relies on the reuse of inductive invariants and on the extraction of unsatisfiable cores to accelerate convergence. Our experimental evaluation shows the feasibility of the approach on practical benchmarks from diagnosability synthesis and product-line engineering, and demonstrates the importance of a tight integration between model checking and cost optimization.","PeriodicalId":363683,"journal":{"name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134086342","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
Turbo-charging Lemmas on demand with don't care reasoning 涡轮增压引理随叫随到,不在乎推理
Pub Date : 2014-10-21 DOI: 10.1109/FMCAD.2014.6987611
Aina Niemetz, Mathias Preiner, Armin Biere
Lemmas on demand is an abstraction/refinement technique for procedures deciding Satisfiability Modulo Theories (SMT), which iteratively refines full candidate models of the formula abstraction until convergence. In this paper, we introduce a dual propagation-based technique for optimizing lemmas on demand by extracting partial candidate models via don't care reasoning on full candidate models. Further, we compare our approach to a justification-based approach similar to techniques employed in the context of model checking. We implemented both optimizations in our SMT solver Boolector and provide an extensive experimental evaluation, which shows that by enhancing lemmas on demand with don't care reasoning, the number of lemmas generated, and consequently the solver runtime, is reduced considerably.
随需引理是一种决定可满足模理论(SMT)过程的抽象/改进技术,它迭代地改进公式抽象的全候选模型直到收敛。本文介绍了一种基于对偶传播的引理优化技术,该技术通过对全候选模型的不关心推理提取部分候选模型来实现引理的按需优化。此外,我们将我们的方法与基于证明的方法进行比较,该方法类似于模型检查上下文中使用的技术。我们在我们的SMT求解器Boolector中实现了这两种优化,并提供了一个广泛的实验评估,该评估表明,通过使用不关心推理的方法按需增强引理,生成的引理数量和求解器运行时间大大减少。
{"title":"Turbo-charging Lemmas on demand with don't care reasoning","authors":"Aina Niemetz, Mathias Preiner, Armin Biere","doi":"10.1109/FMCAD.2014.6987611","DOIUrl":"https://doi.org/10.1109/FMCAD.2014.6987611","url":null,"abstract":"Lemmas on demand is an abstraction/refinement technique for procedures deciding Satisfiability Modulo Theories (SMT), which iteratively refines full candidate models of the formula abstraction until convergence. In this paper, we introduce a dual propagation-based technique for optimizing lemmas on demand by extracting partial candidate models via don't care reasoning on full candidate models. Further, we compare our approach to a justification-based approach similar to techniques employed in the context of model checking. We implemented both optimizations in our SMT solver Boolector and provide an extensive experimental evaluation, which shows that by enhancing lemmas on demand with don't care reasoning, the number of lemmas generated, and consequently the solver runtime, is reduced considerably.","PeriodicalId":363683,"journal":{"name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132220665","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
Faster temporal reasoning for infinite-state programs 对无限状态程序进行更快的时间推理
Pub Date : 2014-10-21 DOI: 10.1109/FMCAD.2014.6987598
B. Cook, Heidy Khlaaf, Nir Piterman
In this paper, we describe a new symbolic model checking procedure for CTL verification of infinite-state programs. Our procedure exploits the natural decomposition of the state space given by the control-flow graph in combination with the nesting of temporal operators to optimize reasoning performed during symbolic model checking. An experimental evaluation against competing tools demonstrates that our approach not only gains orders-of-magnitude performance improvement, but also allows for scalability of temporal reasoning for larger programs.
本文描述了一种新的用于无限状态程序CTL验证的符号模型检验方法。我们的过程利用控制流图给出的状态空间的自然分解,结合时间算子的嵌套来优化符号模型检查期间执行的推理。针对竞争工具的实验评估表明,我们的方法不仅获得了数量级的性能改进,而且还允许更大程序的时间推理的可伸缩性。
{"title":"Faster temporal reasoning for infinite-state programs","authors":"B. Cook, Heidy Khlaaf, Nir Piterman","doi":"10.1109/FMCAD.2014.6987598","DOIUrl":"https://doi.org/10.1109/FMCAD.2014.6987598","url":null,"abstract":"In this paper, we describe a new symbolic model checking procedure for CTL verification of infinite-state programs. Our procedure exploits the natural decomposition of the state space given by the control-flow graph in combination with the nesting of temporal operators to optimize reasoning performed during symbolic model checking. An experimental evaluation against competing tools demonstrates that our approach not only gains orders-of-magnitude performance improvement, but also allows for scalability of temporal reasoning for larger programs.","PeriodicalId":363683,"journal":{"name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114708930","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}
引用次数: 11
Response property checking via distributed state space exploration 通过分布式状态空间探索进行响应属性检查
Pub Date : 2014-10-21 DOI: 10.1109/FMCAD.2014.6987590
B. Bingham, M. Greenstreet
A response property is a simple liveness property that, given state predicates p and q, asserts "whenever a p-state is visited, a g-state will be visited in the future". This paper presents an efficient and scalable implementation for explicit-state model of checking response properties on systems with strongly- and weakly-fair actions, using a network of machines. Our approach is a novel twist on the One-Way-Catch-Them-Young (OWCTY) algorithm. Although OWCTY has a worst-case time complexity of O(n2m) where n is the number of states of the model, and m is the number of fair actions, we show that in practice, the run-time is a very small multiple of n. This allows our approach to handle large models with a large number of fairness constraints. Our implementation builds upon PREACH, a distributed, explicit-state model checking tool. We demonstrate the effectiveness of our approach by applying it to several standard benchmarks on some real-world, proprietary, architectural models.
响应属性是一个简单的活动属性,给定状态谓词p和q,断言“无论何时访问p状态,将来都会访问g状态”。本文利用机器网络,提出了一种有效的、可扩展的用于检测强公平和弱公平系统响应特性的显式状态模型。我们的方法是对单向捕获年轻(OWCTY)算法的一种新颖的扭曲。尽管OWCTY的最坏情况时间复杂度为O(n2m),其中n是模型的状态数,m是公平行为的数量,但我们表明,在实践中,运行时间是n的非常小的倍数。这允许我们的方法处理具有大量公平约束的大型模型。我们的实现建立在一个分布式的、显式状态模型检查工具——传道之上。我们通过将该方法应用于一些真实世界的、专有的、体系结构模型上的几个标准基准来演示该方法的有效性。
{"title":"Response property checking via distributed state space exploration","authors":"B. Bingham, M. Greenstreet","doi":"10.1109/FMCAD.2014.6987590","DOIUrl":"https://doi.org/10.1109/FMCAD.2014.6987590","url":null,"abstract":"A response property is a simple liveness property that, given state predicates p and q, asserts \"whenever a p-state is visited, a g-state will be visited in the future\". This paper presents an efficient and scalable implementation for explicit-state model of checking response properties on systems with strongly- and weakly-fair actions, using a network of machines. Our approach is a novel twist on the One-Way-Catch-Them-Young (OWCTY) algorithm. Although OWCTY has a worst-case time complexity of O(n2m) where n is the number of states of the model, and m is the number of fair actions, we show that in practice, the run-time is a very small multiple of n. This allows our approach to handle large models with a large number of fairness constraints. Our implementation builds upon PREACH, a distributed, explicit-state model checking tool. We demonstrate the effectiveness of our approach by applying it to several standard benchmarks on some real-world, proprietary, architectural models.","PeriodicalId":363683,"journal":{"name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126220301","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
Challenges in bit-precise reasoning 位精确推理的挑战
Pub Date : 2014-10-21 DOI: 10.1109/FMCAD.2014.6987584
Armin Biere
Summary form only given. Bit-precise reasoning (BPR) precisely captures the semantics of systems down to each individual bit and thus is essential to many verification and synthesis tasks for both hardware and software systems. As an instance of Satisfiabiliy Modulo Theories (SMT), BPR is in essence about word-level decision procedures for the theory of bit-vectors. In practice, quantiers and other theory extensions, such as reasoning about arrays, are important too. In the first part of the tutorial we gave a brief overview on basic techniques for bit-precise reasoning and then covered more recent theoretical results, including complexity classification results. We discussed challenges in developping an efficient SMT solver for bit-vectors, like our award winning SMT solver Boolector, and in particular presented examples, for which current techniques fail. Finally, we reviewed the state-of-the-art in word-level model checking, and argued why it is necessary to put more effort in this direction of research.
只提供摘要形式。比特精确推理(BPR)精确地捕获系统的语义直到每个单独的位,因此对于硬件和软件系统的许多验证和综合任务都是必不可少的。作为可满足模理论(SMT)的一个实例,业务流程再造实质上是位向量理论的字级决策过程。在实践中,量子数和其他理论扩展,如关于数组的推理,也很重要。在本教程的第一部分中,我们简要概述了位精确推理的基本技术,然后介绍了最新的理论结果,包括复杂度分类结果。我们讨论了为位向量开发有效的SMT求解器所面临的挑战,比如我们获奖的SMT求解器Boolector,并特别介绍了当前技术无法解决的问题。最后,我们回顾了词级模型检验的最新进展,并论证了为什么有必要在这一研究方向上投入更多的努力。
{"title":"Challenges in bit-precise reasoning","authors":"Armin Biere","doi":"10.1109/FMCAD.2014.6987584","DOIUrl":"https://doi.org/10.1109/FMCAD.2014.6987584","url":null,"abstract":"Summary form only given. Bit-precise reasoning (BPR) precisely captures the semantics of systems down to each individual bit and thus is essential to many verification and synthesis tasks for both hardware and software systems. As an instance of Satisfiabiliy Modulo Theories (SMT), BPR is in essence about word-level decision procedures for the theory of bit-vectors. In practice, quantiers and other theory extensions, such as reasoning about arrays, are important too. In the first part of the tutorial we gave a brief overview on basic techniques for bit-precise reasoning and then covered more recent theoretical results, including complexity classification results. We discussed challenges in developping an efficient SMT solver for bit-vectors, like our award winning SMT solver Boolector, and in particular presented examples, for which current techniques fail. Finally, we reviewed the state-of-the-art in word-level model checking, and argued why it is necessary to put more effort in this direction of research.","PeriodicalId":363683,"journal":{"name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","volume":"228 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132414410","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
期刊
2014 Formal Methods in Computer-Aided Design (FMCAD)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1