ACM DL

Programming Languages and Systems (TOPLAS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 20 Issue 5, Sept. 1998

Compositional verification of concurrent systems using Petri-net-based condensation rules
Eric Y. T. Juan, Jeffrey J. P. Tsai, Tadao Murata
Pages: 917-979
DOI: 10.1145/293677.293681
The state-explosion problem of formal verification has obstructed its application to large-scale software systems. In this article, we introduce a set of new condensation theories: IOT-failure equivalence, IOT-state equivalence, and...

Efficient and flexible incremental parsing
Tim A. Wagner, Susan L. Graham
Pages: 980-1013
DOI: 10.1145/293677.293678
Previously published algorithms for LR (k) incremental parsing are inefficient, unnecessarily restrictive, and in some cases incorrect. We present a simple algorithm based on parsing LR(k) sentential forms that...

Alma-O: an imperative language that supports declarative programming
Krzysztof R. Apt, Jacob Brunekreef, Vincent Partington, Andrea Schaerf
Pages: 1014-1066
DOI: 10.1145/293677.293679
We describe here an implemented small programming language, called Alma-O, that augments the expressive power of imperative programming by a limited number of features inspired by the logic programming paradigm. These additions encourage...

A logical model for relational abstract domains
Roberto Giacobazzi, Francesca Scozzari
Pages: 1067-1109
DOI: 10.1145/293677.293680
In this article we introduce the notion of Heyting completion in abstract interpretation. We prove that Heyting completion provides a model for Cousot's reduced cardinal power of abstract domains and that it supplies a logical basis to specify...