-
1
Modular SMT-Based Verification of Rule-Based Hardware Designs
Published 2022“…This thesis aims to make hardware verification easier by leveraging the rule-level abstraction for verification using SMT-based verification, e.g. bounded and unbounded model checking. …”
Get full text
Thesis -
2
-
3
Synthesis of domain specific CNF encoders for bit-vector solvers
Published 2016Get full text
Thesis -
4
Polite Combination of Algebraic Datatypes
Published 2022“…Abstract Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its latest stable version, the SMT-LIB standard defines a theory of algebraic datatypes, which is currently supported by several mainstream SMT solvers. …”
Get full text
Article -
5
-
6
Sterol and genomic analyses validate the sponge biomarker hypothesis
Published 2016“…Using a molecular clock approach, we demonstrate that the relevant sponge SMT duplication event overlapped with the appearance of 24-isopropylcholestanes in the Neoproterozoic, but that the algal SMT duplication event occurred later in the Phanerozoic. …”
Get full text
Get full text
Get full text
Article -
7
-
8
Trigger Selection Strategies to Stabilize Program Verifiers
Published 2016“…SMT-based program verifiers often suffer from the so-called butterfly effect, in which minor modifications to the program source cause significant instabilities in verification times, which in turn may lead to spurious verification failures and a degraded user experience. …”
Get full text
Get full text
Article -
9
Trigger Selection Strategies to Stabilize Program Verifiers
Published 2021“…SMT-based program verifiers often suffer from the so-called butterfly effect, in which minor modifications to the program source cause significant instabilities in verification times, which in turn may lead to spurious verification failures and a degraded user experience. …”
Get full text
Get full text
Article -
10
-
11
CONSTRAINING THE STRUCTURE OF SAGITTARIUS A*'s ACCRETION FLOW WITH MILLIMETER VERY LONG BASELINE INTERFEROMETRY CLOSURE PHASES
Published 2015“…We find that the accretion flow models are capable of producing a wide variety of closure phases on the SMT-CARMA-JCMT triangle and thus not all models are consistent with the recent observations. …”
Get full text
Article -
12
Results and Analysis of SyGuS-Comp'15
Published 2018“…In this year's competition we added two specialized tracks: a track for conditional linear arithmetic, where the grammar need not be specified and is implicitly assumed to be that of the LIA logic of SMT-LIB, and a track for invariant synthesis problems, with special constructs conforming to the structure of an invariant synthesis problem. …”
Get full text
Get full text
Article -
13
Proteomic responses of oceanic Synechococcus WH8102 to phosphate and zinc scarcity and cadmium additions
Published 2014“…Similar trends in alkaline phosphate (ALP) and SmtA suggest the possibility of a Zn supply system to provide Zn to ALP that involves SmtA. …”
Get full text
Article -
14
Multiple sulfur isotopes discriminate organoclastic and methane-based sulfate reduction by sub-seafloor pyrite formation
Published 2021“…This is consistent with the slowly migrating sulfate–methane transition (SMT) in slope sediments inferred from sulfur and iron speciation, carbon isotope ratios of carbonates, and magnetic susceptibility data. …”
Get full text
Article -
15
Delta-Decision Procedures for Exists-Forall Problems over the Reals
Published 2021“…We propose δ -complete decision procedures for solving satisfiability of nonlinear SMT problems over real numbers that contain universal quantification and a wide range of nonlinear functions. …”
Get full text
Article -
16
SyGuS-Comp 2017: Results and Analysis
Published 2021“…Such a synthesis problem can be formally defined in SyGuS-IF, a language that is built on top of SMT-LIB. The Syntax-Guided Synthesis Competition (SyGuS-Comp) is an effort to facilitate, bring together and accelerate research and development of efficient solvers for SyGuS by providing a platform for evaluating different synthesis techniques on a comprehensive set of benchmarks. …”
Get full text
Article -
17
Alloy*: A Higher-Order Relational Constraint Solver
Published 2014“…Some tasks, however, most notably those involving synthesis, are inherently higher order; these are typically handled by embedding a first-order solver (such as a SAT or SMT solver) in a domain-specific algorithm. Using strategies similar to those used in such algorithms, we show how to extend a first-order solver (in this case Kodkod, a model finder for relational logic used as the engine of the Alloy Analyzer) so that it can handle quantifications over higher-order structures. …”
Get full text
-
18
Stepwise refinement of heap-manipulating code in Chalice
Published 2016“…This paper describes a system with automated tool support for refinement, powered by a state-of-the-art verification engine that uses an SMT solver. Unlike previous refinement systems, users of the presented system interact only via declarations in the programming language. …”
Get full text
Get full text
Article -
19
A fully verified container library
Published 2018“…Keywords: Deductive verification; SMT; Object-oriented software; Containers; AutoProof…”
Get full text
Get full text
Article -
20
SyGuS-Comp 2016: Results and Analysis
Published 2021“…Such a synthesis problem can be formally defined in SyGuS-IF, a language that is built on top of SMT-LIB. The Syntax-Guided Synthesis Competition (SyGuS-Comp) is an effort to facilitate, bring together and accelerate research and development of efficient solvers for SyGuS by providing a platform for evaluating different synthesis techniques on a comprehensive set of benchmarks. …”
Get full text
Article