loading...
A Verification Methodology for Infinite-State Message Passing Systems
Mont Saint-Michel, France June 24-June 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MEMCOD.2003.1210110First ACM and IEEE International Conf ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Christoph Sprenger, Krzysztof Worytkiewicz, "A Verification Methodology for Infinite-State Message Passing Systems," Formal Methods and Models for Co-Design, ACM/IEEE International Conference on, pp. 255, First ACM and IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE?03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/MEMCOD.2003.1210110,
author = {Christoph Sprenger and Krzysztof Worytkiewicz},
title = {A Verification Methodology for Infinite-State Message Passing Systems},
journal ={Formal Methods and Models for Co-Design, ACM/IEEE International Conference on},
volume = {0},
year = {2003},
isbn = {0-7695-1923-7},
pages = {255},
doi = {http://doi.ieeecomputersociety.org/10.1109/MEMCOD.2003.1210110},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Formal Methods and Models for Co-Design, ACM/IEEE International Conference on
TI - A Verification Methodology for Infinite-State Message Passing Systems
SN - 0-7695-1923-7
SP
EP
A1 - Christoph Sprenger,
A1 - Krzysztof Worytkiewicz,
PY - 2003
KW - null
VL - 0
JA - Formal Methods and Models for Co-Design, ACM/IEEE International Conference on
ER -
 
Christoph Sprenger, Projet Lemme, INRIA Sophia Antipolis
Krzysztof Worytkiewicz, 2 av. des Planches
The verification methodology studied in this paper stems from investigations on respectively deduction-based model checking and semantics of concurrency. Specifically, we consider imperative programs with CSP-like communication and use a categorical semantics as foundation to extract from a program a control graph labelled by transition predicates. This logical content acts as system description for a deduction-based model checker of LTL properties. We illustrate the methodology with a concrete realisation in form of the Mc5 verification tool written in Ocaml and using the theorem prover PVS as back-end.
Citation:
Christoph Sprenger, Krzysztof Worytkiewicz, "A Verification Methodology for Infinite-State Message Passing Systems," memocode, pp.255, First ACM and IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE?03), 2003
Usage of this product signifies your acceptance of the Terms of Use.