3591 search results - page 522 / 719 » Typing linear constraints |
197
click to vote
ICLP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
173
click to vote
STACS
2001
Springer
15 years 11 months ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
185
click to vote
WG
2001
Springer
15 years 11 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
162
click to vote
RTCSA
2000
IEEE
15 years 11 months ago
2000
IEEE
With the advance of applications such as multimedia, imagelspeech processing and real-time AI, real-time computing models allowing to express the “timeliness versus precision”...
152
click to vote
PLDI
2000
ACM
15 years 11 months ago
2000
ACM
We show how to determine statically whether it is safe for untrusted machine code to be loaded into a trusted host system. Our safety-checking technique operates directly on the u...