| Stephan Diehl, Pieter Hartel, and Peter Sestoft. Abstract machines for programming language implementation. Future Generation Computer Systems, 16:739--751, 2000. |
....This is neither possible nor desirable in a distributed system. We build upon this work by arguing that escaping errors must be studied, expected, and structured. A universal instruction set for heterogeneous computing has been a persistent goal of computer science for many decades. Diehl et al. [10] offer a bibliography of such systems. The Java Virtual Machine [4] has recently been the fa vorite target for a variety of distributed computing systems [9, 8, 2] An early exploration of Java support for Condor [19] examined primarily the problem of transparent checkpointing. One major obstacle ....
S. Diehl, P. Hartel, and P. Sestoft. Abstract machines for programming language implementation. Future Generation Computer Systems, 16:739--751, 2000.
No context found.
Stephan Diehl, Pieter Hartel, and Peter Sestoft. Abstract machines for programming language implementation. Future Generation Computer Systems, 16:739--751, 2000.
No context found.
Stephan Diehl, Pieter Hartel, and Peter Sestoft. Abstract machines for programming language implementation. Future Generation Computer Systems, 16:739--751, 2000.
No context found.
Stephan Diehl, Pieter Hartel, and Peter Sestoft. Abstract machines for programming language implementation. Future Generation Computer Systems, 16:739--751, 2000.
No context found.
Stephan Diehl, Pieter Hartel, and Peter Sestoft. Abstract machines for programming language implementation. Future Generation Computer Systems, 16:739--751, 2000.
No context found.
S. Diehl, P. Hartel, and P. Sestoft. Abstract machines for programming language implementation. Future Generation Computer Systems, 16(7):739-- 751, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC