Experts has a new look! Let us know what you think of the updates.

Provide feedback
Home
Scholarly Works
Dealing with Incompleteness in Automata-Based...
Conference

Dealing with Incompleteness in Automata-Based Model Checking

Abstract

A software specification is often the result of an iterative process that transforms an initial incomplete model through refinement decisions. A model is incomplete because the implementation of certain functionalities is postponed to a later development step or is delegated to third parties. An unspecified functionality may be later replaced by alternative solutions, which may be evaluated to analyze tradeoffs. Model checking has been proposed …

Authors

Menghi C; Spoletini P; Ghezzi C

Series

Lecture Notes in Computer Science

Volume

9995

Pagination

pp. 531-550

Publisher

Springer Nature

Publication Date

2016

DOI

10.1007/978-3-319-48989-6_32

Conference proceedings

Lecture Notes in Computer Science

ISSN

0302-9743