Conformance checking for models of asynchronous message passing software

DOI10.1007/3-540-45657-0_13MaRDI QIDQ4804894zbMATH OpenFDO

Authors Jakob Rehof, Sriram K. Rajamani

Publication date 1 May 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2404/24040166.htm

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Stuck-free conformance
• Symbolic bounded conformance checking of model programs
• Types as models: model checking message-passing programs
• Checking conformance for time-constrained scenario-based specifications
• On the completeness of verifying message passing programs under bounded asynchrony

Cited in

(6)

• A two-level approach based on model checking to support architecture conformance checking
• BDD vs. constraint-based model checking: An experiment evaluation for asynchronous concurrent systems
• Verifying Agents’ Conformance with Multiparty Protocols
• Symbolic bounded conformance checking of model programs
• scientific article; zbMATH DE number 7407798 (Why is no real title available?)
• Stuck-free conformance

Describes a project that uses

Uses Software

• PIPER

This page was built for publication: Conformance checking for models of asynchronous message passing software

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4804894)