Sciweavers

1816 search results - page 158 / 364
» Trace oblivious computation
Sort
View
MFCS
2005
Springer
14 years 3 months ago
Concurrent Automata vs. Asynchronous Systems
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...
Rémi Morin
ICALP
2004
Springer
14 years 3 months ago
A Categorical Model for the Geometry of Interaction
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. ...
Esfandiar Haghverdi, Philip J. Scott
ISCA
1998
IEEE
155views Hardware» more  ISCA 1998»
14 years 2 months ago
A Study of Branch Prediction Strategies
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...
James E. Smith
ACSD
2004
IEEE
160views Hardware» more  ACSD 2004»
14 years 2 months ago
Concurrency in Synchronous Systems
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 ...
Dumitru Potop-Butucaru, Benoît Caillaud, Alb...
OOPSLA
1991
Springer
14 years 1 months ago
Object-Oriented Type Inference
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...
Jens Palsberg, Michael I. Schwartzbach