Sciweavers

Share
65 search results - page 3 / 13
» Predicate Abstraction via Symbolic Decision Procedures
Sort
View
FOCS
2005
IEEE
10 years 5 months ago
Safraless Decision Procedures
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
Orna Kupferman, Moshe Y. Vardi
TACAS
2005
Springer
120views Algorithms» more  TACAS 2005»
10 years 5 months ago
SATABS: SAT-Based Predicate Abstraction for ANSI-C
SAT-based Predicate Abstraction for ANSI-C Edmund Clarke1 Daniel Kroening2 Natasha Sharygina1,3 Karen Yorav4 1 Carnegie Mellon University, School of Computer Science 2 ETH Zuerich,...
Edmund M. Clarke, Daniel Kroening, Natasha Sharygi...
JAR
2006
103views more  JAR 2006»
9 years 11 months ago
A Framework for Verifying Bit-Level Pipelined Machines Based on Automated Deduction and Decision Procedures
We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem proving systems such as AC...
Panagiotis Manolios, Sudarshan K. Srinivasan
CADE
2015
Springer
4 years 7 months ago
Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers
We prove decidability of univariate real algebra extended with predicates for rational and integer powers, i.e., “xn ∈ Q” and “xn ∈ Z.” Our decision procedure combines ...
Grant Olney Passmore
ATVA
2006
Springer
162views Hardware» more  ATVA 2006»
10 years 3 months ago
Predicate Abstraction of Programs with Non-linear Computation
e Abstraction of Programs With Non-linear Computation Songtao Xia1 Ben Di Vito2 Cesar Munoz3 1 NASA Postdoc at NASA Langley Research Center, Hampton, VA 2 NASA Langley Research Cen...
Songtao Xia, Ben Di Vito, César Muño...
books