Sciweavers

181 search results - page 15 / 37
» Testable Use Cases in the Abstract State Machine Language
Sort
View
150
Voted
SIGSOFT
2008
ACM
16 years 4 months ago
Finding programming errors earlier by evaluating runtime monitors ahead-of-time
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...
Eric Bodden, Patrick Lam, Laurie J. Hendren
ASM
2000
ASM
15 years 8 months ago
An ASM Dynamic Semantics for Standard ML
Abstract. The Abstract State Machines (ASM) methodology is a methodology for formally specifying computing systems. We use the ASM methodology to give the dynamic semantics of the ...
Steven C. Cater, James K. Huggins
108
Voted
SENSYS
2006
ACM
15 years 9 months ago
Protothreads: simplifying event-driven programming of memory-constrained embedded systems
Event-driven programming is a popular model for writing programs for tiny embedded systems and sensor network nodes. While event-driven programming can keep the memory overhead do...
Adam Dunkels, Oliver Schmidt, Thiemo Voigt, Muneeb...
160
Voted
MEMOCODE
2005
IEEE
15 years 9 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
124
Voted
ECML
2004
Springer
15 years 9 months ago
Batch Reinforcement Learning with State Importance
Abstract. We investigate the problem of using function approximation in reinforcement learning where the agent’s policy is represented as a classifier mapping states to actions....
Lihong Li, Vadim Bulitko, Russell Greiner