12 Modal mu-calculi

Bradfield, Julian C.; Stirling, Colin

doi:10.1016/s1570-2464(07)80015-2

Cited by 138 publications

(131 citation statements)

References 27 publications

Supporting

Mentioning

130

Contrasting

Order By: Relevance

“…The modal µ-calculus, a.k.a. the 'Logic of Everything', is renowned to be highly expressive and to subsume temporal logics like LTL and (A)CTL [17,10,14]. The model-checking approaches of [12,6] are based on LTL, that of [26] on the multivalued modal µ-calculus, and those of [25,2] on (A)CTL.…”

Section: A Product Line As Running Examplementioning

confidence: 99%

Towards Modular Verification of Software Product Lines with mCRL2

Beek

Vink

2014

Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change

View full text Add to dashboard Cite

Abstract. We introduce by means of an example a modular verification technique for analyzing the behavior of software product lines using the mCRL2 toolset. Based on feature-driven borders, we divide a behavioral model of a product line into a set of separate components with interfaces and a driver process to coordinate them. Abstracting from irrelevant components, we verify properties over a smaller behavioral model, which not only simplifies the model checking task but also makes the result amenable for reuse. This is a fundamental step forward for the approach to scale up to industrial-size product lines.

show abstract

Section: A Product Line As Running Examplementioning

confidence: 99%

Towards Modular Verification of Software Product Lines with mCRL2

Beek

Vink

2014

Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change

View full text Add to dashboard Cite

show abstract

“…We briefly recall the semantics of modal µ-calculus (e.g., [34]), skipping some well-known details. The formulas of modal µ-calculus are modal formulas extended with the formulas of type µxϕ and νxϕ for ϕ positive in x (i.e., if each occurrence of x is under the scope of an even number of negations).…”

Section: Kripke Modelsmentioning

confidence: 99%

Structures for Epistemic Logic

Bezhanishvili

Hoek

2014

Outstanding Contributions to Logic

View full text Add to dashboard Cite

“…Establishing a formula corresponds to constructing a winning strategy in the game for Verifier where she chooses at ∨ and , and Refuter chooses at ∧ and []. See [2] for a detailed explanation of the relation between modal mu-calculus, parity automata, and parity games.…”

Section: Game/mu-calculus Semantics For Qvt-rmentioning

confidence: 99%

Enforcing QVT-R with mu-Calculus and Games

Bradfield

Stevens

2013

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. QVT-R is the standard Object Management Group bidirectional transformation language. In previous work, we gave a precise game-theoretic semantics for the checkonly semantics of QVT-R transformations, including the recursive invocation of relations which is allowed and used, but not defined, by the QVT standard. In this paper, we take up the problem of enforce semantics, where the standard attempts formality, but at crucial points lapses into English. We show that our previous semantics can be extended to enforce mode, giving a precise semantics taking the standard into account.

show abstract

12 Modal mu-calculi

Cited by 138 publications

References 27 publications

Towards Modular Verification of Software Product Lines with mCRL2

Towards Modular Verification of Software Product Lines with mCRL2

Structures for Epistemic Logic

Enforcing QVT-R with mu-Calculus and Games

Contact Info

Product

Resources

About