Abstract
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e. by adding an active intruder capable of storing all exchanged messages including full analysis and synthesis of messages) some verification problems become decidable. In particular we give an algorithm to decide control state reachability, a problem related to security properties like secrecy and authenticity. The proof is via a reduction to a new prefix rewriting model called Monotonic Set-extended Prefix rewriting (MSP). We demonstrate further applicability of the introduced model by encoding a fragment of the ccp (concurrent constraint programming) language into MSP.
Originalsprog | Engelsk |
---|---|
Titel | Automated Technology for Verification and Analysis : Proceedings of the 4th International Symposium, ATVA 2006, Beijing, China, October 23-26, 2006 |
Antal sider | 15 |
Forlag | IEEE Computer Society Press |
Publikationsdato | 2006 |
Sider | 415-429 |
ISBN (Trykt) | 9783540472377 |
DOI | |
Status | Udgivet - 2006 |
Begivenhed | International Symposium on Automated Technology for Verification and Analysis (ATVA'06) - Bejing, Kina Varighed: 23 okt. 2006 → 26 okt. 2006 Konferencens nummer: 4 |
Konference
Konference | International Symposium on Automated Technology for Verification and Analysis (ATVA'06) |
---|---|
Nummer | 4 |
Land/Område | Kina |
By | Bejing |
Periode | 23/10/2006 → 26/10/2006 |
Navn | Lecture Notes in Computer Science |
---|---|
Nummer | 4218 |
ISSN | 0302-9743 |