Enforcing and validating user-defined programming disciplines
Abstract
References
Index Terms
- Enforcing and validating user-defined programming disciplines
Recommendations
Pluggable Type Inference for Free
ASE '23: Proceedings of the 38th IEEE/ACM International Conference on Automated Software EngineeringA pluggable type system extends a host programming language with type qualifiers. It lets programmers write types like unsigned int, secret string, and nonnull object. Typechecking with pluggable types detects and prevents more errors than the host type ...
Flow-insensitive type qualifiers
We describe flow-insensitive type qualifiers, a lightweight, practical mechanism for specifying and checking properties not captured by traditional type systems. We present a framework for adding new, user-specified type qualifiers to programming ...
Semantic type qualifiers
PLDI '05: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementationWe present a new approach for supporting user-defined type refinements, which augment existing types to specify and check additional invariants of interest to programmers. We provide an expressive language in which users define new refinements and ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/f2b4afe4-0ce2-44be-a828-3fbd7fa0bcfe/1251535.cover.gif)
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 136Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in