2016 Formal Methods in Computer-Aided Design (FMCAD)最新文献_第4页

Minimal unsatisfiable core extraction for SMT SMT的最小不满意芯提取

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2016-10-03 DOI: 10.1109/FMCAD.2016.7886661

Ofer Guthmann, O. Strichman, Anna Trostanetski

引用次数: 25

Formal verification of division and square root implementations, an Oracle report 正式验证除法和平方根的实现，一个Oracle报告

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2016-10-03 DOI: 10.1109/FMCAD.2016.7886673

D. Rager, J. Ebergen, D. Nadezhin, Austin Lee, C. Chau, Benjamin Selfridge

引用次数: 8

Lazy sequentialization for TSO and PSO via shared memory abstractions 通过共享内存抽象实现TSO和PSO的延迟排序

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2016-10-03 DOI: 10.5555/3077629.3077662

Ermenegildo Tomasco, Truc L. Nguyen, Omar Inverso, B. Fischer, S. L. Torre, G. Parlato

引用次数: 29

Formal verification for computer security: Lessons learned and future directions 计算机安全的正式验证:经验教训和未来方向

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2016-10-03 DOI: 10.1109/FMCAD.2016.7886647

D. Song

引用次数: 1

Accurate ICP-based floating-point reasoning 精确的基于icp的浮点推理

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2016-10-03 DOI: 10.1109/FMCAD.2016.7886677

Karsten Scheibler, Felix Neubauer, Ahmed Mahdi, M. Fränzle, Tino Teige, Tom Bienmüller, D. Fehrer, B. Becker

{"title":"Accurate ICP-based floating-point reasoning","authors":"Karsten Scheibler, Felix Neubauer, Ahmed Mahdi, M. Fränzle, Tino Teige, Tom Bienmüller, D. Fehrer, B. Becker","doi":"10.1109/FMCAD.2016.7886677","DOIUrl":"https://doi.org/10.1109/FMCAD.2016.7886677","url":null,"abstract":"In scientific and technical software, floating-point arithmetic is often used to approximate arithmetic on physical quantities natively modeled as reals. Checking properties for such programs (e.g. proving unreachability of code fragments) requires accurate reasoning over floating-point arithmetic. Currently, most of the SMT-solvers addressing this problem class rely on bit-blasting. Recently, methods based on reasoning in interval lattices have been lifted from the reals were they traditionally have been successful) to the floating-point numbers. The approach presented in this paper follows the latter line of interval-based reasoning, but extends it by including bitwise integer operations and cast operations between integer and floating-point arithmetic. Such operations have hitherto been omitted, as they tend to define sets not concisely representable in interval lattices, and were consequently considered the domain of bit-blasting approaches. By adding them to interval-based reasoning, the full range of basic data types and operations of C programs is supported. Furthermore, we propose techniques in order to mitigate the problem of aliasing during interval reasoning. The experimental results confirm the efficacy of the proposed techniques. Our approach outperforms solvers relying on bit-blasting","PeriodicalId":6479,"journal":{"name":"2016 Formal Methods in Computer-Aided Design (FMCAD)","volume":"70 1","pages":"177-184"},"PeriodicalIF":0.0,"publicationDate":"2016-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86248052","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}

引用次数: 21

Understanding evolution through algorithms 通过算法理解进化

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2016-10-03 DOI: 10.1109/FMCAD.2016.7886648

C. Papadimitriou

引用次数: 0

On ∃ ∀ ∃! solving: A case study on automated synthesis of magic card tricks ∃∀!解决:一个自动合成魔术卡片技巧的案例研究

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2016-10-03 DOI: 10.1109/FMCAD.2016.7886664

Susmit Jha, Vasumathi Raman, S. Seshia

{"title":"On ∃ ∀ ∃! solving: A case study on automated synthesis of magic card tricks","authors":"Susmit Jha, Vasumathi Raman, S. Seshia","doi":"10.1109/FMCAD.2016.7886664","DOIUrl":"https://doi.org/10.1109/FMCAD.2016.7886664","url":null,"abstract":"In formal synthesis, the goal is to find a composition of components from a finite library such that the composition satisfies a given logical specification. In this paper, we consider the problem of synthesizing magic card tricks from component actions, where some of the actions depend on non-deterministic choices made by the audience. This problem can be naturally represented as a quantified logical formula of the form: Exists a composition, Forall nondeterministic choices, Uniquely-Exists intermediate and final outputs satisfying a logical specification, that is, an (∃∀∃!) satisfiability problem. We present a novel approach to solve this problem that exploits the unique-existence of intermediate and final outputs for any given composition and choice values. We illustrate how several popular magic card tricks can be recovered using this approach. These tricks evolved through human ingenuity over decades, but we demonstrate that formal synthesis can generate a number of novel variants of these tricks within minutes. In contrast, a direct encoding to quantified SMT problem fails to find a solution in hours.","PeriodicalId":6479,"journal":{"name":"2016 Formal Methods in Computer-Aided Design (FMCAD)","volume":"167 1","pages":"81-84"},"PeriodicalIF":0.0,"publicationDate":"2016-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80522994","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

Categorical semantics of digital circuits 数字电路的范畴语义

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2016-10-03 DOI: 10.1109/FMCAD.2016.7886659

D. Ghica, A. Jung

{"title":"Categorical semantics of digital circuits","authors":"D. Ghica, A. Jung","doi":"10.1109/FMCAD.2016.7886659","DOIUrl":"https://doi.org/10.1109/FMCAD.2016.7886659","url":null,"abstract":"This paper proposes a categorical theory of digital circuits based on monoidal categories and graph rewriting. The main goal of this paper is conceptual: to fill a foundational gap in reasoning about digital circuits, which is currently almost exclusively semantic (simulations). The level of abstraction we target is circuits with discrete signal levels, discrete time, and explicit delays, which is appropriate for modelling a range of components such as boolean gates or transistors working in saturation mode. We start with an algebraic signature consisting of the basic electronic components of a given class of circuits and extend it gradually (and in a free way) with further algebraic structure (representing circuit combinations, delays, and feedback), while quotienting it with a notion of equivalence corresponding to input-output observability. Using well-known results about the correspondence between free monoidal categories and graph-like structures we can develop, in a principled way, a graph rewriting system which is shown to be useful in reasoning about such circuits. We illustrate the power of our system by reasoning equationally about a challenging class of circuits: combinational circuits with feedback.","PeriodicalId":6479,"journal":{"name":"2016 Formal Methods in Computer-Aided Design (FMCAD)","volume":"2370 1","pages":"41-48"},"PeriodicalIF":0.0,"publicationDate":"2016-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86570354","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}

引用次数: 21

Modular specification and verification of a cache-coherent interface 缓存一致性接口的模块化规范和验证

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2016-10-03 DOI: 10.1109/FMCAD.2016.7886668

K. McMillan

引用次数: 14

Property-directed k-induction Property-directed k-induction

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2016-10-01 DOI: 10.1109/FMCAD.2016.7886665

Dejan Jovanovic, B. Dutertre

引用次数: 43