Recent years have seen growing interest in high-level languages for programming
networks. But the design of these languages has been largely ad hoc, driven more by the …

This is an advanced 2001 textbook on modal logic, a field which caught the attention of
computer scientists in the late 1970s. Researchers in areas ranging from economics to …

This textbook offers a unified, self-contained introduction to the field of term rewriting. Baader
and Nipkow cover all the basic material--abstract reduction systems, termination …

Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys
the singulax aclv~ ntage of being strongly related to classical logic. Its variants constitute …

We introduce Kleene algebra with tests, an equational system for manipulating programs.
We give a purely equational proof, using Kleene algebra with tests and commutativity …

We study some of the concepts, protocols, and algorithms for access control in distributed
systems, from a logical perspective. We account for how a principal may come to believe that …

The area of coalgebra has emerged within theoretical computer science with a unifying
claim: to be the mathematics of computational dynamics. It combines ideas from the theory of …

These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-
semester graduate course I taught at Cornell for three consec utive fall semesters from'88 …

Iteration Theories Page 1 Chapter 6 Iteration Theories Iteration theories are a generalization
of iterative theories. In iteration theories, the dagger operation can be applied to all morphisms …

The purpose of Chapter 9 is to develop some classical results on formal languages and
automata by an algebraic treatment using semirings, formal power series and matrices. The …