1. A core calculus of dependency
2. K.
Aehlig J. G.
de Miranda and
C.-H. L.
Ong
.
The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable. In P. Urzyczyn editor TLCA volume
3461
of
Lecture Notes in Computer Science pages
39
--
54
.
Springer 2005
. ISBN 3-540-25593-1. 10.1007/11417170_5 K. Aehlig J. G. de Miranda and C.-H. L. Ong. The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable. In P. Urzyczyn editor TLCA volume 3461 of Lecture Notes in Computer Science pages 39--54. Springer 2005. ISBN 3-540-25593-1. 10.1007/11417170_5
3. Recognizing safety and liveness
4. Verifying pointer and string analyses with region type systems
5. A.
Bouajjani J.
Esparza and
O.
Maler
.
Reachability analysis of pushdown automata: Application to model-checking. In A. W. Mazurkiewicz and J. Winkowski editors CONCUR volume
1243
of
Lecture Notes in Computer Science pages
135
--
150
.
Springer 1997
. ISBN 3-540-63141-0. A. Bouajjani J. Esparza and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In A. W. Mazurkiewicz and J. Winkowski editors CONCUR volume 1243 of Lecture Notes in Computer Science pages 135--150. Springer 1997. ISBN 3-540-63141-0.