A type reduction theory for systems with replicated components
The Parameterised Model Checking Problem asks whether an implementation Impl(t) satisfies a specification Spec(t) for all instantiations of parameter t. In general, t can determine numerous entities: the number of processes used in a network, the type of data, the capacities of buffers, etc. The mai...
Main Authors: | Tomasz Mazur, Gavin Lowe |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2012-02-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/869/pdf |
Similar Items
-
Honesty by Typing
by: Massimo Bartoletti, et al.
Published: (2017-04-01) -
Model Checking Spatial Logics for Closure Spaces
by: Vincenzo Ciancia, et al.
Published: (2017-04-01) -
Internal Parametricity for Cubical Type Theory
by: Evan Cavallo, et al.
Published: (2021-11-01) -
Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories
by: Makoto Hamana
Published: (2017-11-01) -
Extending the theory of Owicki and Gries with a logic of progress
by: Brijesh Dongol, et al.
Published: (2006-03-01)