63 search results - page 3 / 13 » Predicate Abstraction via Symbolic Decision Procedures |
163
click to vote
FOCS
2005
IEEE
16 years 5 days ago
2005
IEEE
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...
184
click to vote
TACAS
2005
Springer
16 years 19 hour ago
2005
Springer
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,...
192
click to vote
JAR
2006
15 years 6 months ago
2006
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...
191
click to vote
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
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...
167
click to vote
CAD
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. This paper reports a geometric constraint solving approach based on symbolic computation. With this approach, we can compute robust numerical solutions for a set of equat...