Transitive closure of infinite graphs and its applications

Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results

ACM Transactions on Programming Languages and Systems (TOPLAS)

Calculating sized types

PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation

Calculating Sized Types

Higher-Order and Symbolic Computation

Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory

Accretive Rules in Cayley P Systems

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing

Declarative definition of group indexed data structures and approximation of their domains

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming