9507 search results - page 1607 / 1902 » Time-based language models |
201
click to vote
PPDP
2007
Springer
16 years 23 days ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
177
click to vote
SEFM
2006
IEEE
16 years 20 days ago
2006
IEEE
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...
152
click to vote
ASPLOS
2006
ACM
16 years 19 days ago
2006
ACM
Growing on-chip wire delays are motivating architectural features that expose on-chip communication to the compiler. EDGE architectures are one example of communication-exposed mi...
187
click to vote
ASPLOS
2006
ACM
16 years 19 days ago
2006
ACM
Concurrency bugs are among the most difficult to test and diagnose of all software bugs. The multicore technology trend worsens this problem. Most previous concurrency bug detect...
166
click to vote
PLDI
2006
ACM
16 years 18 days ago
2006
ACM
In order to generate high-quality code for modern processors, a compiler must aggressively schedule instructions, maximizing resource utilization for execution efficiency. For a ...