Sciweavers

2850 search results - page 1 / 570
» On Timed Models and Full Abstraction
Sort
View
ENTCS
2006
125views more  ENTCS 2006»
13 years 4 months ago
On Timed Models and Full Abstraction
models and full abstraction Gavin Lowe and Jo
Gavin Lowe, Joël Ouaknine
TACS
1994
Springer
13 years 8 months ago
Full Abstraction for PCF
traction for PCF1 Samson.Abramsky2 University of Edinburgh and Radha Jagadeesan3 Loyola University Chicago and Pasquale Malacaria4 Queen Mary and Westfield College An intensional m...
Samson Abramsky, Pasquale Malacaria, Radha Jagadee...
LOPSTR
2009
Springer
13 years 11 months ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
POPL
1996
ACM
13 years 9 months ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch
HYBRID
2007
Springer
13 years 8 months ago
On Self-triggered Full-Information H-Infinity Controllers
Abstract. A self-triggered control task is one in which the task determines its next release time. It has been conjectured that self-triggering can relax the requirements on a real...
Michael D. Lemmon, Thidapat Chantem, Xiaobo Sharon...