2017 Formal Methods in Computer Aided Design (FMCAD)

2-6 Oct. 2017

Filter Results

Displaying Results 1 - 25 of 41
  • [Front cover]

    Publication Year: 2017, Page(s): C1
    Request permission for commercial reuse | |PDF file iconPDF (386 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2017, Page(s): 1
    Request permission for commercial reuse | |PDF file iconPDF (14 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2017, Page(s):1 - 2
    Request permission for commercial reuse | |PDF file iconPDF (26 KB)
    Freely Available from IEEE
  • Organization committee

    Publication Year: 2017, Page(s):1 - 3
    Request permission for commercial reuse | |PDF file iconPDF (24 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2017, Page(s):1 - 2
    Request permission for commercial reuse | |PDF file iconPDF (33 KB)
    Freely Available from IEEE
  • How formal analysis and verification add security to blockchain-based systems

    Publication Year: 2017, Page(s):1 - 4
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (505 KB) | HTML iconHTML

    Blockchain is an integrated technology to ensure keeping record and process transactions with decentralized manner. It is thought as the foundation of future decentralized ecosystem, and collects much attention. However, the maturity of this technology including security of the fundamental protocol and its applications is not enough, thus we need more research on the security evaluation and verifi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbolic security analysis using the Tamarin prover

    Publication Year: 2017, Page(s): 5
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (15 KB) | HTML iconHTML

    In this talk I will present the Tamarin Prover, an analysis tool for symbolic security analysis of systems. A prime example of systems that fall within its scope are security protocols that are executed in the presence of an active attacker. Tamarins state-of-the-art analysis of such systems requires dealing with unbounded replication of processes, loops, the prolific behaviour of the attacker, an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coalition, intrigue, ambush, destruction and pride: Herding cats can be challenging

    Publication Year: 2017, Page(s): 6
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (44 KB) | HTML iconHTML

    Herding cats can lead to coalition (of cheetahs), intrigue (of kittens), ambush (of tigers), destruction (of wild cats) or pride (of lions). In this tutorial, I will present the cat language to write consistency models as a set of constraints on the executions of concurrent programs. A cat model can be executed within the herd tool [3], which I will use during the tutorial. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated formal reasoning about AWS systems

    Publication Year: 2017, Page(s): 7
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (15 KB)

    Automatic and semiautomatic formal verification tools are now being developed and used within Amazon Web Services (AWS) to find proofs that prove or disprove desired properties of key AWS components. In this session, we outline these efforts and discuss how tools are used to play and then replay found proofs of desired properties when software artifacts or networks are modified, thus helping provi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal methods in industrial dependable systems design — The TTTech example

    Publication Year: 2017, Page(s): 8
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (15 KB)

    Over the last decades the field of dependable computer systems has gained tremendous significance in our modern society. We rely on the dependability of automobiles, railways, airplanes, medical devices, critical infrastructures, like the electrical grid or industrial production facilities, and many more. These dependable systems frequently implement non-trivial mechanisms, for example, to coordin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hardware model checking competition 2017

    Publication Year: 2017, Page(s): 9
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (26 KB) | HTML iconHTML

    The Hardware Model Checking Competition (HWMCC) 2017 affiliated to the International Conference on Formal Methods in Computer Aided Design (FMCAD) in 2017 in Vienna was the 9th competitive event for hardware model checkers we organized. After HWMCC'15 affiliated with FMCAD'15 in Austin, the competition took a break in 2016. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The FMCAD 2017 graduate student forum

    Publication Year: 2017, Page(s): 10
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (38 KB) | HTML iconHTML

    The FMCAD Student Forum provides a platform for graduate students at any career stage to introduce their research to the wider Formal Methods community, and solicit feedback. In 2017, the event took place in Vienna, Austria, as integral part of the FMCAD conference. Thirteen students were invited to give a short talk and present a poster illustrating their work. The presentations covered a broad r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • goSAT: Floating-point satisfiability as global optimization

    Publication Year: 2017, Page(s):11 - 14
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (723 KB) | HTML iconHTML

    We introduce goSAT, a fast and publicly available SMT solver for the theory of floating-point arithmetic. We build on the recently proposed XSat solver [1] which casts the satisfiability problem to a corresponding global optimization problem. Compared to XSat, goSAT is an integrated tool combining JIT compilation of SMT formulas and NLopt, a feature-rich mathematical optimization backend. We evalu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On sound relative error bounds for floating-point arithmetic

    Publication Year: 2017, Page(s):15 - 22
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (121 KB) | HTML iconHTML

    State-of-the-art static analysis tools for verifying finite-precision code compute worst-case absolute error bounds on numerical errors. These are, however, often not a good estimate of accuracy as they do not take into account the magnitude of the computed values. Relative errors, which compute errors relative to the value's magnitude, are thus preferable. While today's tools do report relative e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Column-wise verification of multipliers using computer algebra

    Publication Year: 2017, Page(s):23 - 30
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (143 KB) | HTML iconHTML

    Verifying arithmetic circuits, and most prominently multipliers, is an important problem but in practice still requires substantial manual effort. Recent work tries to solve this issue using techniques from computer algebra. The most effective approach uses polynomial reasoning over pseudo boolean polynomials. In this paper we give a rigorous formalization of this approach and present a new column... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient generation of all minimal inductive validity cores

    Publication Year: 2017, Page(s):31 - 38
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (490 KB) | HTML iconHTML

    Symbolic model checkers can construct proofs of safety properties over complex models, but when a proof succeeds, the results do not generally provide much insight to the user. Recently, proof cores (alternately, for inductive model checkers, Inductive Validity Cores (IVCs)) were introduced to trace a property to a minimal set of model elements necessary for proof. Minimal IVCs facilitate several ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Duality-based interpolation for quantifier-free equalities and uninterpreted functions

    Publication Year: 2017, Page(s):39 - 46
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (605 KB) | HTML iconHTML

    Interpolating, i.e., computing safe over-approximations for a system represented by a logical formula, is at the core of symbolic model-checking. One of the central tools in modeling programs is the use of the equality logic and uninterpreted functions (EUF), but certain aspects of its interpolation, such as size and the logical strength, are still relatively little studied. In this paper we prese... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving linear arithmetic with SAT-based model checking

    Publication Year: 2017, Page(s):47 - 54
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (564 KB) | HTML iconHTML

    We present LIAMC, a novel decision procedure for (quantifier-free) linear arithmetic over both integers modulo 2N (LIAn) and integers (LIA). There is no need to explain our motivation to design a new efficient decision procedure for the widely used LIA logic. A LIAn decision procedure can be extremely useful in the context of software (SW) verification. SW verifica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ZSstrS: A string solver with theory-aware heuristics

    Publication Year: 2017, Page(s):55 - 59
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (91 KB) | HTML iconHTML

    We present a new string SMT solver, Z3str3, that is faster than its competitors Z3str2, Norn, CVC4, S3, and S3P over a majority of three industrial-strength benchmarks, namely, Kaluza, PISA, and IBM AppScan. Z3str3 supports string equations, linear arithmetic over length function, and regular language membership predicate. The key algorithmic innovation behind the efficiency of Z3str3 is a techniq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verification of a lazy cache coherence protocol against a weak memory model

    Publication Year: 2017, Page(s):60 - 67
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (152 KB) | HTML iconHTML

    In this paper, we verify a modern lazy cache coherence protocol, TSO-CC, against the memory consistency model it was designed for, TSO. We achieve this by first showing a weak simulation relation between TSO-CC (with a fixed number of processors) and a novel finite-state operational model which exhibits the laziness of TSO-CC and satisfies TSO. We then extend this by an existing parameterisation t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Safety verification of phaser programs

    Publication Year: 2017, Page(s):68 - 75
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (188 KB) | HTML iconHTML

    We address the problem of statically checking control state reachability (as in possibility of assertion violations, race conditions or runtime errors) and plain reachability (as in deadlock-freedom) of phaser programs. Phasers are a modern non-trivial synchronization construct that supports dynamic parallelism with runtime registration and deregistration of spawned tasks. They allow for collectiv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning to prove safety over parameterised concurrent systems

    Publication Year: 2017, Page(s):76 - 83
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (156 KB) | HTML iconHTML

    We revisit the classic problem of proving safety over parameterised concurrent systems, i.e., an infinite family of finite-state concurrent systems that are represented by some finite (symbolic) means. An example of such an infinite family is a dining philosopher protocol with any number n of processes (n being the parameter that defines the infinite family). Regular model checking is a well-known... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lasso detection using partial-state caching

    Publication Year: 2017, Page(s):84 - 91
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (182 KB) | HTML iconHTML

    We study the problem of finding liveness violations in real-world asynchronous and distributed systems. Unlike a safety property, which asserts that certain bad states should never occur during execution, a liveness property states that a program should not remain in a bad state for an infinitely long period of time. Checking for liveness violations is essential to ensure that a system will always... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact quantitative probabilistic model checking through rational search

    Publication Year: 2017, Page(s):92 - 99
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (178 KB) | HTML iconHTML

    Model checking of systems formalized using probabilistic models such as discrete time Markov chains (DTMCs) and Markov decision processes (MDPs) can be reduced to computing constrained reachability properties. Linear programming methods to compute reachability probabilities for DTMCs and MDPs do not scale to large models. Thus, model checking tools often employ iterative methods to approximate rea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sampling invariants from frequency distributions

    Publication Year: 2017, Page(s):100 - 107
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (220 KB) | HTML iconHTML

    We present a new SMT-based, probabilistic, syntax-guided method to discover numerical inductive invariants. The core idea is to initialize frequency distributions from the program's source code, then repeatedly sample lemmas from those distributions, and terminate when the conjunction of learned lemmas becomes a safe invariant. The sampling process gets further optimized by priority distributions ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.