Paper Info
Title
A useful bounded resource functional language
Abstract
Real-time software, particularly that used in embedded systems, has unique resource and verification requirements. While embedded software may not have great need for processor and memory resources, the need to prove that computations are performed correctly and within hard time and space constraints is very great. Improvements in hardware and compiler technology mean that functional programming languages are increasingly practical for embedded situations. We present a functional programming language, Ca, built on catamorphisms instead of general recursion, intended for use in static analysis. Ca is not Turing-complete--every program must terminate--but it still provides an excellent framework for building static analysis techniques. Catamorphisms are a general tool which encompass bounded iteration, and allow to traverse any algebraic data structure. We discuss the computational properties of this language, as well as provide a framework for future work in static analysis.
Year
DOI
Venue
2008
10.1007/978-3-540-77566-9_17
SOFSEM
Keywords
Field
DocType
excellent framework,general tool,functional language,embedded software,embedded situation,static analysis technique,useful bounded resource,general recursion,great need,embedded system,functional programming language,static analysis,real time,data structure,programming language
Functional logic programming,Specification language,Programming language,Programming paradigm,Computer science,Very high-level programming language,Theoretical computer science,High-level programming language,Control flow analysis,Programming language theory,Low-level programming language
Conference
Volume
ISSN
ISBN
4910
0302-9743
3-540-77565-X
Citations 
PageRank 
References 
0
0.34
8
Authors
3
Name
Order
Citations
PageRank
Michael J. Burrell1151.16
James H. Andrews265232.98
Mark Daley316622.18