4666 search results - page 770 / 934 » Equations on Timed Languages |
126
click to vote
FMCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper describes the architecture of costa, an abstract interpretation based cost and termination analyzer for Java bytecode. The system receives as input a bytecode program, (...
158
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
115
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
132
Voted
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
146
click to vote
IFIP
2007
Springer
15 years 10 months ago
2007
Springer
Hybrid networks are networks capable of switching data at multiple levels (optical and IP packet level) by means of multi-service optical switches. As a result of that, huge flows...