Sciweavers

1889 search results - page 63 / 378
» An Abstract Machine for Oz
Sort
View
FUIN
2007
91views more  FUIN 2007»
14 years 12 months ago
On Communicating Automata with Bounded Channels
Abstract. We review the characterization of communicating finite-state machines whose behaviors have universally or existentially bounded channels. These results rely on the theor...
Blaise Genest, Dietrich Kuske, Anca Muscholl
JOT
2007
138views more  JOT 2007»
14 years 11 months ago
Flexible Language Interoperability
machines raise the abstraction level of the execution environment at the cost of restricting the set of supported languages. Moreover, the ability of a language implementation to i...
Torbjörn Ekman, Peter Mechlenborg, Ulrik Pagh...
FASE
2008
Springer
15 years 1 months ago
Regular Inference for State Machines Using Domains with Equality Tests
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
Therese Berg, Bengt Jonsson, Harald Raffelt
WDAG
2010
Springer
230views Algorithms» more  WDAG 2010»
14 years 10 months ago
Implementing Fault-Tolerant Services Using State Machines: Beyond Replication
Abstract—This paper describes a method to implement faulttolerant services in distributed systems based on the idea of fused state machines. The theory of fused state machines us...
Vijay K. Garg
HPCA
2007
IEEE
16 years 8 days ago
Concurrent Direct Network Access for Virtual Machine Monitors
This paper presents hardware and software mechanisms to enable concurrent direct network access (CDNA) by operating systems running within a virtual machine monitor. In a conventi...
Jeffrey Shafer, David Carr, Aravind Menon, Scott R...