2752 search results - page 255 / 551 » Rounding to an Integral Program |
158
click to vote
SEKE
2001
Springer
15 years 11 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...
175
click to vote
CP
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. This paper describes the architecture and implementation of a constraint-based framework for rapid prototyping of distributed applications such as virtual simulations, co...
170
click to vote
TPHOL
1999
IEEE
15 years 11 months ago
1999
IEEE
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
131
click to vote
ECOOP
1998
Springer
15 years 10 months ago
1998
Springer
Binary component adaptation (BCA) allows components to be adapted and evolved in binary form and on-the-fly (during program loading). BCA rewrites component binaries before (or whi...
177
click to vote
POPL
1994
ACM
15 years 10 months ago
1994
ACM
Abstract: The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms...