short-paper

Typestate-oriented programming

Authors:

Jonathan Aldrich,

Joshua Sunshine,

Zachary SparksAuthors Info & Claims

OOPSLA '09: Proceedings of the 24th ACM SIGPLAN conference companion on Object oriented programming systems languages and applications

Pages 1015 - 1022

https://doi.org/10.1145/1639950.1640073

Published: 25 October 2009 Publication History

Abstract

Objects model the world, and state is fundamental to a faithful modeling. Engineers use state machines to understand and reason about state transitions, but programming languages provide little support for reasoning about or implementing these state machines, causing software defects and lost productivity when objects are misused.

We propose Typestate-Oriented Programming as a natural extension to the object paradigm, where objects are modeled not just in terms of classes, but in terms of changing states. Each state may have its own representation and methods which may transition the object into a new state. A flow-sensitive, permission-based type system helps developers track which state objects are in. First-class typestates are a powerful abstraction that will help developers model and reuse objects more efficiently and correctly.

References

[1]

Andi Bejleri, Jonathan Aldrich, and Kevin Bierhoff. Ego: Controlling the Power of Simplicity. In Proc. Foundations of Object-Oriented Languages, 2006.

[2]

Lorenzo Bettini, Sara Capecchi, and Ferruccio Damiani. A Mechanism for Flexible Dynamic Trait Replacement. In Proc. Formal Techniques for Java-like Programs, 2009.

Digital Library

[3]

Kevin Bierhoff. Iterator Specification with Typestates. In Proc. Specification and Verification of Component-Based Systems, 2006.

Digital Library

[4]

Kevin Bierhoff and Jonathan Aldrich. Modular Typestate Checking of Aliased Objects. In Proc. Object-Oriented Programming, Systems, Languages, and Applications, 2007.

Digital Library

[5]

Kevin Bierhoff, Nels E. Beckman, and Jonathan Aldrich. Practical API Protocol Checking with Access Permissions. In Proc. European Conference on Object-Oriented Programming, 2009.

Digital Library

[6]

Eric Bodden, Laurie Hendren, Patrick Lam, Ondrej Lhotak, and Nomair A. Naeem. Collaborative Runtime Verification with Tracematches. Oxford Journal of Logics and Computation, 2008.

Digital Library

[7]

Lera Boroditsky. How Does Language Shape the Way We Think? In Max Brockman, editor, What's Next? Dispatches on the Future of Science, pages 116--129. Vintage, 2009.

[8]

Ole-Johan Dahl and Kristen Nygaard. SIMULA: an ALGOL-based Simulation Language. Communications of the ACM, 9(9):671--678, 1966.

Digital Library

[9]

Robert Deline and Manuel Fahndrich. Typestates for Objects. In Proc. European Conference on Object-Oriented Programming, 2004.

[10]

Sophia Drossopoulou, Ferruccio Damiani, Mariangiola Dezani-Ciancaglini, and Paola Giannini. Fickle: Dynamic Object Re-classification. In Proc. European Conference on Object-Oriented Programming, 2001.

Digital Library

[11]

Stephen J. Fink, Eran Yahav, Nurit Dor, G. Ramalingam, and Emmanuel Geay. Effective Typestate Verification in the Presence of Aliasing. Transactions on Software Engineering and Methodology, 17(2), 2008.

Digital Library

[12]

Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, 1995.

Digital Library

[13]

David Harel. Statecharts: A Visual Formalism for Complex Systems. Science of Computer Programming, 8(3):231--274, 1987.

Digital Library

[14]

Carl Hewitt, Peter Bishop, and Richard Steiger. A Universal Modular Actor Formalism for Artificial Intelligence. In Proc. International Joint Conference on Artificial Intelligence, 1973.

Digital Library

[15]

Alan C. Kay. The Early History of Smalltalk. SIGPLAN Notices, 28(3), 1993.

Digital Library

[16]

Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.

Digital Library

[17]

Brad A. Myers. A New Model for Handling Input. ACM Transactions on Information Systems, 8(3):289--320, 1990.

Digital Library

[18]

Barbara Pernici. Objects with Roles. In Proc. Conference on Office Information Systems, 1990.

Digital Library

[19]

Asher Sterkin. State{chart}-Oriented Programming. In Proc. Multiparadigm Programming with Object-Oriented Languages, 2008.

[20]

Sven Stork, Paulo Marques, and Jonathan Aldrich. Concurrency by Default: Using Permissions to Express Dataflow in Stateful Programs. In Proc. Onward!, 2009.

Digital Library

[21]

Robert E Strom and Shaula Yemini. Typestate: A Programming Language Concept for Enhancing Software Reliability. IEEE Transactions on Software Engineering, 12(1):157--171, 1986.

Digital Library

[22]

Antero Taivalsaari. Object-Oriented Programming with Modes. Journal of Object-Oriented Programming, 6(3):25--32, 1993.

[23]

David Ungar and Randall B. Smith. Self: The Power of Simplicity. In Proc. Object-Oriented Programming, Systems, Languages, and Applications, 1987.

Digital Library

Cited By

Sekiyama TUnno H(2025)Algebraic Temporal Effects: Temporal Verification of Recursively Typed Higher-Order ProgramsProceedings of the ACM on Programming Languages10.1145/37049149:POPL(2306-2336)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704914
LeBlanc HTaylor NBornholt JChidambaram VGavrilovska ATerry D(2024)SquirrelFSProceedings of the 18th USENIX Conference on Operating Systems Design and Implementation10.5555/3691938.3691959(387-404)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.5555/3691938.3691959
Saffrich HNishida YThiemann P(2024)Law and Order for Typestate with BorrowingProceedings of the ACM on Programming Languages10.1145/36897638:OOPSLA2(1475-1503)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689763
Show More Cited By

Index Terms

Typestate-oriented programming
1. Software and its engineering
  1. Software creation and management
    1. Software development techniques
  2. Software notations and tools
    1. General programming languages
      1. Language types

Recommendations

Foundations of Typestate-Oriented Programming

Typestate reflects how the legal operations on imperative objects can change at runtime as their internal state changes. A typestate checker can statically ensure, for instance, that an object method is only called when the object is in a state for which ...
Typestate-like analysis of multiple interacting objects
OOPSLA '08: Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications

This paper presents a static analysis of typestate-like temporal specifications of groups of interacting objects, which are expressed using tracematches. Whereas typestate expresses a temporal specification of one object, a tracematch state may change ...
Typestate-like analysis of multiple interacting objects

This paper presents a static analysis of typestate-like temporal specifications of groups of interacting objects, which are expressed using tracematches. Whereas typestate expresses a temporal specification of one object, a tracematch state may change ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

OOPSLA '09: Proceedings of the 24th ACM SIGPLAN conference companion on Object oriented programming systems languages and applications

October 2009

502 pages

ISBN:9781605587684

DOI:10.1145/1639950

Conference Chairs:
Shail Arora
Adayana, Inc.
,
Bernd Bruegge
Technical University of Munich
,
Program Chairs:
Gary Leavens
University of Central Florida
,
Yvonne Coady
University of Victoria
,
Simon Peyton-Jones
Microsoft Research

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 October 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

OOPSLA09

Sponsor:

SIGPLAN

OOPSLA09: ACM SIGPLAN Object Oriented Programming Systems and Applications Conference

October 25 - 29, 2009

Florida, Orlando, USA

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

79
Total Citations
View Citations
542
Total Downloads

Downloads (Last 12 months)35
Downloads (Last 6 weeks)5

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Sekiyama TUnno H(2025)Algebraic Temporal Effects: Temporal Verification of Recursively Typed Higher-Order ProgramsProceedings of the ACM on Programming Languages10.1145/37049149:POPL(2306-2336)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704914
LeBlanc HTaylor NBornholt JChidambaram VGavrilovska ATerry D(2024)SquirrelFSProceedings of the 18th USENIX Conference on Operating Systems Design and Implementation10.5555/3691938.3691959(387-404)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.5555/3691938.3691959
Saffrich HNishida YThiemann P(2024)Law and Order for Typestate with BorrowingProceedings of the ACM on Programming Languages10.1145/36897638:OOPSLA2(1475-1503)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689763
Wei GBračevac OJia SBao YRompf T(2024)Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in Higher-Order Generic ProgramsProceedings of the ACM on Programming Languages10.1145/36328568:POPL(393-424)Online publication date: 5-Jan-2024
https://doi.org/10.1145/3632856
GRAVERSEN EHIRSCH AMONTESI F(2024)Alice or Bob?: Process polymorphism in choreographiesJournal of Functional Programming10.1017/S095679682300011434Online publication date: 23-Jan-2024
https://doi.org/10.1017/S0956796823000114
Hähnle RKamburjan EScaletta M(2024)Context-Aware Trace ContractsActive Object Languages: Current Research Trends10.1007/978-3-031-51060-1_11(289-322)Online publication date: 29-Jan-2024
https://doi.org/10.1007/978-3-031-51060-1_11
Schuermann LThomas ALevy A(2023)Encapsulated Functions: Fortifying Rust's FFI in Embedded SystemsProceedings of the 1st Workshop on Kernel Isolation, Safety and Verification10.1145/3625275.3625397(41-48)Online publication date: 23-Oct-2023
https://dl.acm.org/doi/10.1145/3625275.3625397
Crichton WSperber MHutton G(2023)Typed Design Patterns for the Functional EraProceedings of the 1st ACM SIGPLAN International Workshop on Functional Software Architecture10.1145/3609025.3609477(40-48)Online publication date: 30-Aug-2023
https://dl.acm.org/doi/10.1145/3609025.3609477
Roth OGil Y(2023)Fluent APIs in Functional LanguagesProceedings of the ACM on Programming Languages10.1145/35860577:OOPSLA1(876-901)Online publication date: 6-Apr-2023
https://dl.acm.org/doi/10.1145/3586057
Sekiyama TUnno H(2023)Temporal Verification with Answer-Effect Modification: Dependent Temporal Type-and-Effect System with Delimited ContinuationsProceedings of the ACM on Programming Languages10.1145/35712647:POPL(2079-2110)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571264
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents