Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
ESOP 2004, LNCS 2986, pages 140–154, 2004. c Springer–Verlag, Berlin Heildelberg 2003. We propose a new method for the static analysis of entity authentication protocols. We d...
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
We present an approach to managing formal models using Model Driven Architecture (MDA) technologies that delivers analysis techniques through integration with the design tools and...
Abstract. The field of program analysis has focused primarily on sequential programming languages. But multithreading is becoming increasingly important, both as a program structu...