229 search results - page 6 / 46 » Bilateral Algorithms for Symbolic Abstraction |
TPHOL
2003
IEEE
14 years 29 days ago
2003
IEEE
Abstract. Model checking and theorem proving are two complementary approaches to formal verification. In this paper we show how binary decision diagram (BDD) based symbolic model ...
AAECC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Starting with Karr's structural theorem for summation --the discrete version of Liouville's structural theorem for integration-- we work out crucial properties ...
FMSD
2008
13 years 7 months ago
2008
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
IPPS
1995
IEEE
13 years 11 months ago
1995
IEEE
Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6 . In previous work we have introduced an algorithm calle...
LCPC
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6]. In previous work we have introduced an algorithm calle...