1816 search results - page 158 / 364 » Trace oblivious computation |
162
click to vote
MFCS
2005
Springer
15 years 12 months ago
2005
Springer
We compare the expressive power of two automata-based finite-state models of concurrency. We show that Droste’s and Kuske’s coherent stably concurrent automata and Bednarczyk...
161
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
We consider the multiplicative and exponential fragment of linear logic (MELL) and give a Geometry of Interaction (GoI) semantics for it based on unique decomposition categories. ...
240
click to vote
ISCA
1998
IEEE
15 years 10 months ago
1998
IEEE
In high-performance computer systems, performance losses due to conditional branch instructions can be minimized by predicting a branch outcome and fetching, decoding, and/or issu...
318
click to vote
ACSD
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper we introduce the notion of weak endochrony, which extends to a synchronous setting the classical theory of Mazurkiewicz traces. The notion is useful in the synthesis ...
162
click to vote
OOPSLA
1991
Springer
15 years 10 months ago
1991
Springer
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, a...