Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 503-517 |
| Number of pages | 15 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 3653 |
| DOIs | |
| Publication status | Published - 1 Jan 2005 |
| Externally published | Yes |
| Event | 16th International Conference on Concurrency Theory, CONCUR 2005 - San Francisco, CA, United States Duration: 23 Aug 2005 → 26 Aug 2005 |
Fingerprint
Dive into the research topics of 'A practical application of geometric semantics to static analysis of concurrent programs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver