Equivalence checking 40 years after: A review of bisimulation tools
H Garavel, F Lang - A Journey from Process Algebra via Timed Automata …, 2022 - Springer
Equivalence checking is a formal verification approach that consists in proving that two
programs or models are related modulo some equivalence relation, or that one is included …
programs or models are related modulo some equivalence relation, or that one is included …
Model-checking for real-time systems
Efficient automatic model-checking algorithms for real-time systems have been obtained in
recent years based on the state-region graph technique of Alur, Courcoubetis and Dill …
recent years based on the state-region graph technique of Alur, Courcoubetis and Dill …
Compositional reasoning in model checking
The main problem in model checking that prevents it from being used for verification of large
systems is the state explosion problem. This problem often arises from combining parallel …
systems is the state explosion problem. This problem often arises from combining parallel …
Efficient verification of real-time systems: Compact data structure and state-space reduction
KG Larsen, F Larsson, P Pettersson… - Proceedings Real-Time …, 1997 - ieeexplore.ieee.org
During the past few years, a number of verification tools have been developed for real-time
systems in the framework of timed automata (eg KRONOS and UPPAAL). One of the major …
systems in the framework of timed automata (eg KRONOS and UPPAAL). One of the major …
The mu-calculus and Model Checking
J Bradfield, I Walukiewicz - Handbook of Model Checking, 2018 - Springer
This chapter presents that part of the theory of the μ μ-calculus that is relevant to the model-
checking problem as broadly understood. The μ μ-calculus is one of the most important …
checking problem as broadly understood. The μ μ-calculus is one of the most important …
Architecting families of software systems with process algebras
Software components can give rise to several kinds of architectural mismatches when
assembled together in order to form a software system. A formal description of the …
assembled together in order to form a software system. A formal description of the …
Compositional and symbolic model-checking of real-time systems
Efficient automatic model-checking algorithms for real-time systems have been obtained in
recent years based on the state-region graph technique of Alur, Courcoubetis and Dill …
recent years based on the state-region graph technique of Alur, Courcoubetis and Dill …
[图书][B] Compositionality: The Significant Difference: International Symposium, COMPOS'97 Bad Malente, Germany, September 8–12, 1997 Revised Lectures
WP De Roever, H Langmaack, A Pnueli - 2003 - books.google.com
This book originates from the International Symposium on Compositionality, COMPOS'97,
held in Bad Malente, Germany in September 1997. The 25 chapters presented in revised full …
held in Bad Malente, Germany in September 1997. The 25 chapters presented in revised full …
On runtime enforcement via suppressions
Runtime enforcement is a dynamic analysis technique that uses monitors to enforce the
behaviour specified by some correctness property on an executing system. The …
behaviour specified by some correctness property on an executing system. The …
Bring your own device, securely
Modern mobile devices offer users powerful computational capabilities and complete
customization. As a matter of fact, today smartphones and tablets have remarkable hardware …
customization. As a matter of fact, today smartphones and tablets have remarkable hardware …