Benchmarking typestate-oriented programming languages

Authors:
Benjamin W. Chung
Affiliations:
Carnegie Mellon University, Pittsburgh, PA, USA
Venue:
Proceedings of the 3rd annual conference on Systems, programming, and applications: software for humanity
Year:
2012

Citing 5
Cited 0

The DaCapo benchmarks: java benchmarking development and analysis

Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Trace-based just-in-time type specialization for dynamic languages

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
An analysis of the dynamic behavior of JavaScript programs

PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Automated construction of JavaScript benchmarks

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
First-class state change in plaid

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The performance of typestate-oriented programming languages is difficult to evaluate as existing benchmarks do not exercise the unique features of these languages. We address this by developing a new benchmark suite specifically designed to evaluate typestate-oriented functionality. These benchmarks model projected applications, providing overhead and memory loads similar to actual applications.