1737 search results - page 82 / 348 » On Interpolation in Existence Logics |
181
click to vote
EUROPAR
2004
Springer
15 years 11 months ago
2004
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...
151
click to vote
ISSRE
2003
IEEE
15 years 11 months ago
2003
IEEE
A large number of coverage criteria to generate tests from logical expressions have been proposed. Although there have been large variations in the terminology, the articulation o...
189
click to vote
ITCC
2002
IEEE
15 years 11 months ago
2002
IEEE
: Since modern programmable devices contain embedded memory blocks, there exists a possibility to implement Finite State Machines (FSM) using such blocks. The size of the memory av...
152
click to vote
SEKE
2001
Springer
15 years 10 months ago
2001
Springer
ct 7 Applying finite-state verification techniques to software systems looks attractive because they are capable of detecting very subtle 8 defects in the logic design of these s...
198
click to vote
CC
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...