2976 search results - page 144 / 596 » On the bounded integer programming |
121
Voted
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We propose a theory of time-bounded verification for realtime systems, in which verification queries are phrased over time intervals of fixed, bounded duration. We argue ...
125
click to vote
CADE
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
128
click to vote
EMO
2009
Springer
15 years 9 months ago
2009
Springer
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
116
click to vote
FMCAD
2009
Springer
15 years 9 months ago
2009
Springer
Abstract—Dynamically allocated and manipulated data structures cannot be translated into hardware unless there is an upper bound on the amount of memory the program uses during a...
147
click to vote
PODS
1992
ACM
15 years 7 months ago
1992
ACM
: We study the problem of determining whether a given recursive Datalog program is equivalent to a given nonrecursive Datalog program. Since nonrecursive Datalog programs are equiv...