Bounded Model Checking of Graph Transformation Systems via SMT Solving

This study investigated differences in psychological distress and coping styles between fathers and mothers of pediatric cancer patients, over a 1-year time period. Also examined were (dis)similarities in couples in distress and coping, and the relationship between (dis)similarities in coping and psychological functioning of both members of a couple. Parents (n = 124, 62 couples) were assessed at diagnosis, at 6 and 12 months. Fathers and mothers experienced higher levels of psychiatric symptomatology and psychological distress at diagnosis than men and women of a normgroup. Distress declined significantly with time. Although parents did not report more symptoms than the normgroup 12 months post-diagnosis, they still were psychologically out of balance. Contrary to findings in the general population, no differences were found between fathers and mothers in psychiatric symptoms or psychological distress on any of the measurements. Only a few gender differences in coping were found. Fathers used more active-problem focusing at diagnosis and a less palliative reaction pattern at 12 months than did mothers. Mothers used more social-support seeking on all measurements. A tendency for similarity in the use of the coping styles within couples was found. Discrepancies in coping in couples were positively related to distress in fathers at diagnosis. However, 12 months later, the more discrepant the couples were in their coping preferences the more distress the mothers indicated. (C) 1998 John Wiley & Sons, Ltd

Bounded Model Checking of Graph Transformation Systems via SMT Solving

Part 6: Session 5: Model CheckingInternational audienceBounded model checking (BMC) complements classical model checking by an efficient technique for checking error-freedom of bounded system paths. Usually, BMC approaches reduce the verification problem to propositional satisfiability. With the recent advances in SAT solving, this has proven to be a fast analysis.In this paper we develop a bounded model checking technique for graph transformation systems. Graph transformation systems (GTSs) provide an intuitive, visual way of specifying system models and their structural changes. An analysis of such models – however – remains difficult since GTSs often give rise to infinite state spaces. In our BMC technique we use first-order instead of propositional logic for encoding complex graph structures and rules. Today’s off-the-shelf SMT solvers can then readily be employed for satisfiability solving. The encoding heavily employs the concept of uninterpreted function symbols for representing edge labels. We have proven soundness of the encoding and report on experiments with different case studies