A formal model of minimal evidence for each CTL operator is defined and paired with an implemented visualization scheme for witnesses and counterexamples.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
representative citing papers
The authors define semantic lifting and semantic reflection for the small language SMOL, formalize its operational semantics and type system, and demonstrate it on a geological modelling case study with an open-source implementation.
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.
TREBL is a sound and relatively complete temporal logic fragment for expressing and proving liveness conditions in Event-B machines under sufficient refinement.
citing papers explorer
-
Visualising CTL Witnesses and Counterexamples -- Extended Version
A formal model of minimal evidence for each CTL operator is defined and paired with an implemented visualization scheme for witnesses and counterexamples.
-
Semantically Reflected Programs
The authors define semantic lifting and semantic reflection for the small language SMOL, formalize its operational semantics and type system, and demonstrate it on a geological modelling case study with an open-source implementation.
-
Equilibria in Multiplayer Graph Games: An Algorithmic Study
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.
-
TREBL -- A Relative Complete Temporal Event-B Logic. Part I: Theory
TREBL is a sound and relatively complete temporal logic fragment for expressing and proving liveness conditions in Event-B machines under sufficient refinement.