For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Oxford

Return to search Previous output Next output
Output 0 of 0 in the submission
Article title

A type reduction theory for systems with replicated components

Type
D - Journal article
Title of journal
Logical Methods in Computer Science
Article number
ARTN 04
Volume number
8
Issue number
1
First page of article
-
ISSN of journal
1860-5974
Year of publication
2012
Number of additional authors
1
Additional information

<11>

The Parameterised Model Checking Problem (PMCP) asks whether an implementation Impl(t) satisfies a specification Spec(t) for all instantiations of parameter t. The paper addresses the PMCP where the parameter t is a type. The paper develops a type reduction theory, and uses it to show that, subject to certain assumptions, if the implementation satisfies the specification for a particular small choice of t (dependent on the specification), then this also holds for all larger choices of t. The techniques developed here were used extensively in a successor paper in SCP, 2013 on counter abstraction.

Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-