Programming Languages and Systems (TOPLAS)


Search Issue
enter search term and/or author name


ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 20 Issue 2, March 1998

“Maximal-munch” tokenization in linear time
Thomas Reps
Pages: 259-273
DOI: 10.1145/276393.276394
The lexical-analysis (or scanning) phase of a compiler attempts to partition an input string into a sequence of tokens. The convention in most languages is that the input is scanned left to right, and each token identified is a “maximal...

A study of the applicability of existing exception-handling techniques to component-based real-time software technology
Jun Lang, David B. Stewart
Pages: 274-301
DOI: 10.1145/276393.276395
This study focuses on the current state of error-handling technology and concludes with recommendations for further research in error handling for component-based real-time software. With real-time programs growing in size and complexity, the...

Isomorph-free model enumeration: a new method for checking relational specifications
Daniel Jackson, Somesh Jha, Craig A. Damon
Pages: 302-343
DOI: 10.1145/276393.276396
Software specifications often involve data structures with huge numbers of value, and consequently they cannot be checked using standard state exploration or model-checking techniques. Data structures can be expressed with binary relations, and...

A systematic study of functional language implementations
Rémi Douence, Pascal Fradet
Pages: 344-387
DOI: 10.1145/276393.276397
We introduce a unified framework to describe, relate, compare, and classify functional language implementations. The compilation process is expressed as a succession of program transformations in the common framework. At each step, different...

A new framework for elimination-based data flow analysis using DJ graphs
Vugranam C. Sreedhar, Guang R. Gao, Yong-Fong Lee
Pages: 388-435
DOI: 10.1145/276393.278523

A partially deadlock-free typed process calculus
Naoki Kobayashi
Pages: 436-482
DOI: 10.1145/276393.278524