Sciweavers

756 search results - page 37 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
DSN
2002
IEEE
14 years 27 days ago
Model Checking Safety Properties of Servo-Loop Control Systems
This paper presents the experiences of using a symbolic model checker to check the safety properties of a servoloop control system. Symbolic model checking has been shown to be be...
M. Edwin Johnson
ESOP
2004
Springer
14 years 1 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn
MEMOCODE
2005
IEEE
14 years 1 months ago
PyPBS design and methodologies
This paper presents results on processor specification from a specialized high-level finite state machine (FSM) language. The language is an extension and enhancement of earlier...
Greg Hoover, Forrest Brewer
IJON
2006
161views more  IJON 2006»
13 years 8 months ago
Evolving hybrid ensembles of learning machines for better generalisation
Ensembles of learning machines have been formally and empirically shown to outperform (generalise better than) single predictors in many cases. Evidence suggests that ensembles ge...
Arjun Chandra, Xin Yao
CAV
2009
Springer
133views Hardware» more  CAV 2009»
14 years 8 months ago
Cardinality Abstraction for Declarative Networking Applications
ity Abstraction for Declarative Networking Applications Juan A. Navarro P?erez, Andrey Rybalchenko, and Atul Singh Max Planck Institute for Software Systems (MPI-SWS) Declarative N...
Andrey Rybalchenko, Atul Singh, Juan Antonio Navar...