FSM-Hume: programming resource-limited systems using bounded automata

Authors:
Greg Michaelson;Kevin Hammond;Jocelyn Serot
Affiliations:
Heriot-Watt University, Riccarton, Scotland;University of St Andrews, North Haugh, St Andrews, Scotland;Blaise Pascal University, Les Cezeaux, Aubiere cedex, France
Venue:
Proceedings of the 2004 ACM symposium on Applied computing
Year:
2004

Citing 12
Cited 1

Statecharts: A visual formalism for complex systems

Science of Computer Programming
Region-based memory management

Information and Computation
The foundations of Esterel

Proof, language, and interaction
Real-time FRP

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Theory of Computation

Theory of Computation
Event-Driven FRP

PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
TIMES - A Tool for Modelling and Implementation of Embedded Systems

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Hume: a domain-specific language for real-time embedded systems

Proceedings of the 2nd international conference on Generative programming and component engineering
Formal languages and their relation to automata

Formal languages and their relation to automata
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual
Predictable space behaviour in FSM-Hume

IFL'02 Proceedings of the 14th international conference on Implementation of functional languages
Inferring cost equations for recursive, polymorphic and higher-order functional programs

IFL'03 Proceedings of the 15th international conference on Implementation of Functional Languages

Editorial message: special track on the programming languages

Proceedings of the 2004 ACM symposium on Applied computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hume is a novel domain-specific programming language targeting resource-bounded computations, such as real-time embedded systems or mobile code. It is based on generalised concurrent automata, controlled by transitions characterised by pattern matching on inputs and (recursive) function generation on outputs. This paper discusses trade-offs between expressibility and decidability in the design of FSM-Hume, a subset of Hume (or Hume layer) based on generalised linear bounded automata with statically determinable time and space use. We illustrate our approach with reference to space costing of a simple real-time simulation of a line-following automous vehicle.