% The Chicago Journal of Theoretical Computer Science, Volume 1996, Article 1
% Bibliography
@InProceedings{cj96-01-01,
author = {A. Arnold},
title = {Toplogical characterizations of infinite behaviours of
transition systems},
booktitle = {Proceedings of the 10th International Colloquium on Automata,
Languages and Programming},
publisher = {Springer-Verlag},
series = {Lecture Notes in Computer Science},
volume = {154},
address = {Barcelona},
year = {1983},
pages = {28--38}
}
@Article{cj96-01-02,
author = {O. Grumberg and N. Francez and J. A. Makowsky and W.
P. de Roever},
title = {A proof rule for fair termination of guarded
commands},
journal = {Information and Control},
volume = {66},
year = {1985},
pages = {83--102}
}
@PhdThesis{cj96-01-03,
author = {N. Klarlund},
title = {Progress Measures and Finite Arguments for Infinite
Computations},
school = {Cornell University},
year = {1990},
month = {August},
note = {Technical Report TR-1153}
}
@InProceedings{cj96-01-04,
author = {N. Klarlund},
title = {Liminf Progress Measures},
booktitle = {Proceedings of the 7th International Conference on
Mathematical Foundations of Programming Semantics},
series = {Lecture Notes in Computer Science},
volume = {598},
year = {1991},
editor = {S. Brookes and M. Main and A. A. Melton and M. Mislove
and D. Schmidt},
pages = {477--491},
publisher = {Springer-Verlag}
}
@InProceedings{cj96-01-05,
author = {N. Klarlund},
title = {Progress Measures and Stack Assertions for Fair
Termination},
booktitle = {Proceedings of the 11th ACM Symposium on Principles of
Distributed Computing},
year = {1992},
address = {Vancouver, Canada},
pages = {229--240}
}
@InProceedings{cj96-01-06,
author = {N. Klarlund},
title = {The Limit View of Infinite Computations},
booktitle = {Proceedings of the 5th International Conference on
Concurrency Theory (CONCUR '94)},
series = {Lecture Notes in Computer Science},
volume = {836},
pages = {351--368},
publisher = {Springer-Verlag},
year = {1994}
}
@InProceedings{cj96-01-07,
author = {N. Klarlund and D. Kozen},
title = {Rabin measures and their applications to fairness and
automata theory},
booktitle = {Proceedings of the 6th IEEE Symposium on Logic in Computer
Science},
pages = {256--265},
address = {Amsterdam, The Netherlands},
year = {1991}
}
@Article{cj96-01-08,
author = {N. Klarlund and F. B. Schneider},
title = {Proving nondeterministically specified safety
properties using progress measures},
journal = {Information and Computation},
volume = {107},
year = {1993},
pages = {151--170}
}
@InProceedings{cj96-01-09,
author = {D. Lehmann and A. Pnueli and J. Stavi},
title = {Impartiality, Justice and Fairness: the Ethics of
Concurrent Termination},
booktitle = {Proceedings of the 8th International Colloquium on
Automata, Language, and Programming},
series = {Lecture Notes in Computer Science},
volume = {115},
year = {1981},
publisher = {Springer-Verlag},
address = {Acre, Israel},
pages = {264--277}
}
@Book{cj96-01-10,
author = {Y. N. Moschovakis},
title = {Descriptive Set Theory},
publisher = {North Holland},
year = {1980}
}
@Book{cj96-01-11,
author = {H. Rogers},
title = {Theory of Recursive Functions and Effective
Computability},
publisher = {McGraw Hill},
address = {New York},
year = {1967}
}
@InProceedings{cj96-01-12,
author = {M. Y. Vardi},
title = {Verification of Concurrent Programs: the
Automata-Theoretic Framework},
booktitle = {Proceedings of the 2nd IEEE Symposium on Logic in
Computer Science},
year = {1987},
address = {Ithaca, NY},
pages = {167--176},
note = {Preliminary version of~\cite{cj96-01-14}}
}
@InProceedings{cj96-01-13,
author = {M. Y. Vardi},
title = {Unified Verification Theory},
booktitle = {Temporal Logic in Specification},
editor = {B. Banieqbal and H. Barringer and A. Pnueli},
publisher = {Springer-Verlag},
series = {Lecture Notes in Computer Science},
address = {Altrincham, UK},
volume = {398},
year = {1989},
pages = {202--212},
note = {Proceedings of 1987 workshop}
}
@Article{cj96-01-14,
author = {M. Y. Vardi},
title = {Verification of Concurrent Programs---the
Automata-Theoretic Framework},
journal = {Annals of Pure and Applied Logic},
volume = {51},
year = {1991},
pages = {79--98},
note = {Extended version of~\cite{cj96-01-12}}
}