788 search results - page 111 / 158 » Symbolic Equivalence Checking |
CSL
1995
Springer
13 years 11 months ago
1995
Springer
In this paper we propose to extend the current capabilities of automated reasoning systems by making use of techniques from integer programming. We describe the architecture of an ...
CSR
2010
Springer
13 years 11 months ago
2010
Springer
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
AAAI
2008
13 years 10 months ago
2008
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
FORTE
2010
13 years 9 months ago
2010
Abstract. Separation logic is a popular specification language for imperative programs where the heap can only be mentioned through pointsto assertions. However, separation logic&#...
ENTCS
2010
13 years 7 months ago
2010
Program debugging is an extremely time-consuming process, and it takes up a large portion of software development time. In practice, debugging is still very much of an art, with t...