Deciding floating−point logic with abstract conflict driven clause learning

Deciding floating−point logic with abstract conflict driven clause learning

Show other versions (1)

Bibliografske podrobnosti
Main Authors:	Brain, M, D’Silva, V, Griggio, A, Haller, L, Kroening, D
Format:	Journal article
Izdano:	2013

Podobne knjige/članki

Deciding floating-point logic with abstract conflict driven clause learning
od: Brain, M, et al.
Izdano: (2014)

Deciding Floating−Point Logic with Systematic Abstraction
od: Haller, L, et al.
Izdano: (2012)

Interpolation−based verification of floating−point programs with abstract CDCL
od: Brain, M, et al.
Izdano: (2013)

Interpolation-based verification of floating-point programs with abstract CDCL
od: Brain, M, et al.
Izdano: (2013)

Abstract conflict driven learning.
od: D'Silva, V, et al.
Izdano: (2013)

Abstract Conflict Driven Learning
od: D'Silva, V, et al.
Izdano: (2013)

An Abstract Interpretation of DPLL(T)
od: Brain, M, et al.
Izdano: (2013)

An abstract interpretation of DPLL(T)
od: Brain, M, et al.
Izdano: (2013)

Numeric bounds analysis with conflict-driven learning
od: D'Silva, V, et al.
Izdano: (2012)

Deciding Bit−Vector Arithmetic with Abstraction
od: Bryant, R, et al.
Izdano: (2007)

Abstract Satisfaction
od: D'Silva, V, et al.
Izdano: (2014)

Logical abstract interpretation
od: D'Silva, V, et al.
Izdano: (2013)

Integrating Conflict Driven Clause Learning to Local Search
od: Gilles Audenard, et al.
Izdano: (2009-10-01)

Abstraction of Syntax
od: D'Silva, V, et al.
Izdano: (2013)

On the decidability of Metric Temporal Logic
od: Ouaknine, J, et al.
Izdano: (2005)

On decidability of pure hybrid logic
od: Stanislovas Norgėla
Izdano: (2012-12-01)

Initial limit Datalog: a new extensible class of decidable constrained Horn clauses
od: Cathcart Burn, T, et al.
Izdano: (2021)

The logical strength of Büchi's decidability theorem
od: Kolodziejczyk, L, et al.
Izdano: (2019)

The logical strength of Büchi's decidability theorem
od: Kolodziejczyk, L, et al.
Izdano: (2016)

Characterizing definability in decidable fixpoint logics
od: Benedikt, M, et al.
Izdano: (2017)

Fullness and Decidability in Continuous Propositional Logic
od: Xuanzhi Ren
Izdano: (2022-11-01)

Deciding KAT and Hoare Logic with Derivatives
od: Ricardo Almeida, et al.
Izdano: (2012-10-01)

Fixed points for multi-cycle path detection
od: D'Silva, V, et al.
Izdano: (2009)

Fixed Points in Multi−Cycle Path Detection
od: D'Silva, V, et al.
Izdano: (2015)

Classical propositional logic and decidability of variables in intuitionistic propositional logic
od: Hajime Ishihara
Izdano: (2014-08-01)

Deciding expressive description logics in the framework of resolution.
od: Hustadt, U, et al.
Izdano: (2008)

Definability and interpolation within decidable fixpoint logics
od: Benedikt, M, et al.
Izdano: (2019)

Safety metric temporal logic is fully decidable
od: Ouaknine, J, et al.
Izdano: (2006)

On decidability of a fragment of intuitionistic predicate logic
od: Jolanta Kaušilaitė, et al.
Izdano: (1999-12-01)

Some decidable classes of modal logic S5
od: Stasys Norgėla
Izdano: (1999-12-01)

The logical strength of B\"uchi's decidability theorem
od: Leszek Kołodziejczyk, et al.
Izdano: (2019-05-01)

Definability and Interpolation within Decidable Fixpoint Logics
od: Michael Benedikt, et al.
Izdano: (2019-09-01)

Decidability Preservation and Complexity Bounds for Combined Logics
od: Carlos Caleiro, et al.
Izdano: (2022-09-01)

Proving the Decidability of the PDLxPDL Product Logic
od: P. Balbiani, et al.
Izdano: (2009-07-01)

Building better bit-blasting for floating-point problems
od: Brain, M, et al.
Izdano: (2019)

Invertibility conditions for floating-point formulas
od: Brain, M, et al.
Izdano: (2019)

The Limits of Decidability for First Order Logic on CPDA Graphs
od: Broadbent, C
Izdano: (2012)

On the decidability of monadic second-order logic with arithmetic predicates
od: Berthé, V, et al.
Izdano: (2024)

Decidability of graph neural networks via logical characterizations
od: Benedikt, M, et al.
Izdano: (2024)

A step up in expressiveness of decidable fixpoint logics
od: Boom, M, et al.
Izdano: (2016)