Sciweavers

103 search results - page 14 / 21
» The Barcelogic SMT Solver
Sort
View
FMCAD
2008
Springer
13 years 9 months ago
Scaling Up the Formal Verification of Lustre Programs with SMT-Based Techniques
We present a general approach for verifying safety properties of Lustre programs automatically. Key aspects of the approach are the choice of an expressive first-order logic in wh...
George Hagen, Cesare Tinelli
CADE
2010
Springer
13 years 8 months ago
Multi-Prover Verification of Floating-Point Programs
Abstract. In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral proper...
Ali Ayad, Claude Marché
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
14 years 5 hour ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...
CADE
2010
Springer
13 years 8 months ago
Bugs, Moles and Skeletons: Symbolic Reasoning for Software Development
Abstract. Symbolic reasoning is in the core of many software development tools such as: bug-finders, test-case generators, and verifiers. Of renewed interest is the use of symbolic...
Leonardo Mendonça de Moura, Nikolaj Bj&osla...
CADE
2009
Springer
14 years 8 months ago
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
Albert Rubio, Cristina Borralleras, Enric Rodr&iac...