In this paper we show how to compress efficiently the state-space of a concurrent system (here applied to a simple shared memory model, but this is no way limited to that model). The technology used here is based on research on geometric semantics by the authors and collaborators [1]. It has been implemented in a abstract interpretation based static analyzer (ALCOOL), and we show some preliminary results and benchmarks. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Goubault, E., & Haucourt, E. (2005). A practical application of geometric semantics to static analysis of concurrent programs. In Lecture Notes in Computer Science (Vol. 3653, pp. 503–517). Springer Verlag. https://doi.org/10.1007/11539452_38
Mendeley helps you to discover research relevant for your work.