ACM Home Page
Please provide us with feedback. Feedback
Towards resource-certified software: a formal cost model for time and its application to an image-processing example
Full text PdfPdf (366 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2007 ACM symposium on Applied computing table of contents
Seoul, Korea
SESSION: Programming languages table of contents
Pages: 1307 - 1314  
Year of Publication: 2007
ISBN:1-59593-480-4
Authors
Armelle Bonenfant  University of St Andrews, St Andrews, UK
Zezhi Chen  Heriot-Watt University, Riccarton, Edinburgh, UK
Kevin Hammond  University of St Andrews, St Andrews, UK
Greg Michaelson  Heriot-Watt University, Riccarton, Edinburgh, UK
Andy Wallace  Heriot-Watt University, Riccarton, Edinburgh, UK
Iain Wallace  Heriot-Watt University, Riccarton, Edinburgh, UK
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 24,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1244002.1244285
What is a DOI?

ABSTRACT

Visual tracking requires sophisticated algorithms working in real-time, and often space-limited, settings. While the input streams may be regular in structure, the algorithms are not, and must often deal with probabilistic metrics. To ensure progress in algorithm design without incurring excessive development costs, we propose a high-level programming approach married with predictable and compositional performance metrics. This enables the combination of independently developed program components into coherent software architecture, with certified resource use guarantee. Here, we present our approach and discuss its application to the development and resource analysis of a space bound mean shift algorithm for motion tracking, using the new embedded system-oriented language Hume.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
T. Amtoft, F. Nielson, and H. Nielson. Type and Effect Systems: Behaviours for Concurrency. Imperial College Press, 1999.
 
2
 
3
D. Aspinall, L. Beringer, M. Hofmann, H.-W. Loidl, and A. Momigliano. A Resource-aware Program Logic for Grail. In Proc. ESOP'04 --- European Symposium on Programming, 2004.
4
 
5
R. Bird. Constructive Functional Programming. In STOP Summer School on Constructive Algorithmics, Abeland, 1989.
 
6
R. Burstall. Inductively Defined Functions in Functional Programming Languages. Technical Report ECS-LFCS-87-25, 1987.
 
7
K. Claessen and M. Sheeran. A Tutorial on Lava: a Hardware Desc. and Verification System. Aug. 2000.
 
8
 
9
 
10
 
11
 
12
R. Fisher. CAVIAR: Context Aware Vision using Image-based Active Recognition, http://homepages.inf.ed.ac.uk/rbf/caviar/, 2005.
 
13
 
14
K. Hammond and G. Michaelson. Predictable Space Behaviour in FSM-Hume. In Proc. Implementation of Functional Langs. (IFL '02), Madrid, Spain, Springer-Verlag LNCS 2670, 2003.
 
15
J. Hawkins and A. Abdallah. Behavioural Synthesis of a Parallel Hardware JPEG Decoder from a Functitonal Specification. In Proc. EuroPar 2002, Aug. 2002.
 
16
17
 
18
M. Hofmann and S. Jost. Type-based amortised heap-space analysis. In Proc. ESOP 2006 - 2006 European Symp. on Programming, pages 22--37, 2006.
19
20
 
21
 
22
S. Jost. Linearly Bounded Heap Space Analysis, Ludwig-Maximilians-Universität, München, Germany (in preparation). PhD thesis, 2006.
 
23
 
24
S.-C. Mu and R. S. Bird. Rebuilding a Tree from its Traversals: A Case Study of Program Inversion. In Proc. Australian Conf. on Prog. Lang. and Systems (APLAS 2003), pages 265--282, 2003.
 
25
J. Nordlander, M. Carlsson, and M. Jones. Programming with Time-Constrained Reactions (unpublished report). http://www.cse.ogi.edu/pacsoft/projects/Timber/publications.htm. 2006.
 
26
J. Nyström, P. Trinder, and D. King. High-level distribution for the rapid production of robust telecoms software: comparing c++ and erlang. Concurrency and Computation: Practice & Experience., 18, December 2006.
 
27
A. Rebón Portillo, K. Hammond, H.-W. Loidl, and P. Vasconcelos. A Sized Time System for a Parallel Functional Language (Revised). In Proc. Implementation of Functional Langs. (IFL '02), Madrid, Spain, Springer-Verlag LNCS 2670, 2003.
 
28
 
29
 
30
D. Turner. Total Functional Programming. Journal of Universal Computing, 10(7):751--768, 2004.
 
31
L. Unnikrishnan, S. Stoller, and Y. Liu. Automatic Accurate Stack Space and Heap Space Analysis for High-Level Languages. Tech. Report 538, Comp. Sci. Dept., Indiana University, Apr. 2000.
 
32
P. Vasconcelos and K. Hammond. Inferring Costs for Recursive, Polymorphic and Higher-Order Functional Programs. In Proc. Implementation of Functional Languages (IFL 2003), 2004.
 
33
34

Collaborative Colleagues:
Armelle Bonenfant: colleagues
Zezhi Chen: colleagues
Kevin Hammond: colleagues
Greg Michaelson: colleagues
Andy Wallace: colleagues
Iain Wallace: colleagues