Sciweavers

85 search results - page 7 / 17
» State-transition machines, revisited
Sort
View
CLEIEJ
2006
126views more  CLEIEJ 2006»
14 years 9 months ago
Software Based Fault Tolerance against Byzantine Failures
The proposed software technique is a very low cost and an effective solution towards designing Byzantine fault tolerant computing application systems that are not so safety critic...
Goutam Kumar Saha
DAC
1994
ACM
15 years 1 months ago
Automatic Verification of Pipelined Microprocessors
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
Vishal Bhagwati, Srinivas Devadas
CORR
2007
Springer
109views Education» more  CORR 2007»
14 years 9 months ago
Abstract machines for dialogue games
Machines for Dialogue Games P.-L. Curien (CNRS - Paris 7) H. Herbelin (INRIA-Futurs) July 16, 2005 The notion of abstract B¨ohm tree has arisen as an operationally-oriented disti...
Pierre-Louis Curien, Hugo Herbelin
GPEM
2010
104views more  GPEM 2010»
14 years 8 months ago
Genetic Programming and Evolvable Machines: ten years of reviews
The journal and in particular the resource reviews have been running for ten years. There are a number of activities being planned to celebrate. However it is a good time to revisi...
William B. Langdon, Steven M. Gustafson
OOPSLA
2009
Springer
15 years 4 months ago
Typestate-oriented programming
Objects model the world, and state is fundamental to a faithful modeling. Engineers use state machines to understand and reason about state transitions, but programming languages ...
Jonathan Aldrich, Joshua Sunshine, Darpan Saini, Z...