Approximate Counting in SMT and Value Estimation for Probabilistic Programs
Abstract elided by the publisher.
1,553 papers · page 38 of 78
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
In this paper we introduce the first known tool for symbolically proving fair-CTL properties of infinite-state integer programs. Our solution is based on a reduction to existing techniques for fairness-free CTL model checking via the use of infinite non-deterministic branching to…
Abstract elided by the publisher.
Abstract elided by the publisher.
In this paper we introduce syntMaskFT, a tool that synthesizes fault-tolerant programs from specifications written in a fragment of branching time logic with deontic operators, designed for specifying fault-tolerant systems. The tool focuses on producing masking tolerant programs…
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
The behaviour of gene regulatory networks GRNs is typically analysed using simulation-based statistical testing-like methods. In this paper, we demonstrate that we can replace this approach by a formal verification-like method that gives higher assurance and scalability. We focus…
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Ultimate Automizer is a software verification tool that is able to analyze reachability of an error label, memory safety, and termination of C programs. For all three tasks, our tool follows an automatabased approach where interpolation is used to compute proofs for traces. The i…
Abstract elided by the publisher.
Abstract elided by the publisher.