Systems that can immediately react to their inputs may suffer from cyclic dependencies between their actions and the corresponding trigger conditions. For this reason, causality analysis has to be employed to check the constructiveness of the programs which implies the existence of unique and consistent behaviours. In this paper, we describe the embedding of various views of causality analysis into the HOL4 theorem prover to check their equivalence. In particular, we show the equivalence between the classical analysis procedure, which is based on a fixpoint computation, and a formulation as a (bounded) model checking problem. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Brandt, J., & Schneider, K. (2008). Formal reasoning about causality analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5170 LNCS, pp. 118–133). Springer Verlag. https://doi.org/10.1007/978-3-540-71067-7_13
Mendeley helps you to discover research relevant for your work.