The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
A methodology for hardware verification using compositional model checking
Science of Computer Programming - Special issue on mathematics of program construction
Communication and Concurrency
The Linear Time-Branching Time Spectrum (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Refinement preserves PLTL properties
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Learning assumptions for compositional verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
A declarative formal approach to dynamic reconfiguration
Proceedings of the 1st international workshop on Open component ecosystems
| Hi-index | 0.00 |
In order to deal with the verification of large systems, compositional approaches postpone in part the problem of combinatorial explosion during model exploration. The purpose of the work we present in this paper is to establish a compositional framework in which the verification may proceed through a refinement-based specification and a component-based verification approaches. First, a constraint synchronised product operator enables us an automated compositional verification of a component-based system refinement relation. Secondly, safety LTL properties of the whole system are checked from local safety LTL properties of its components. The main advantage of our specification and verification approaches is that LTL properties are preserved through composition and refinement.