Verifying Monadic Second-Order Properties of Graph Programs

The core challenge in a Hoare- or Dijkstra-style proof system for graph programs is in defining a weakest liberal precondition construction with respect to a rule and a postcondition. Previous work addressing this has focused on assertion languages for first-order properties, which are unable to express important global properties of graphs such as acyclicity, connectedness, or existence of paths. In this paper, we extend the nested graph conditions of Habel, Pennemann, and Rensink to make them equivalently expressive to monadic second-order logic on graphs. We present a weakest liberal precondition construction for these assertions, and demonstrate its use in verifying non-local correctness specifications of graph programs in the sense of Habel et al.Comment: Extended version of a paper to appear at ICGT 201

Hypernatraemic dehydration and necrotizing enterocolitis.

Severe hypernatraemic dehydration developed over the first twelve days of life in a breastfed infant girl. Upon oral rehydration with formula milk, no acute neurological problems arose, but she subsequently developed necrotizing enterocolitis. Intravenous rehydration may be preferred to the oral route in such infants

The management of acute necrotizing encephalitis: a review of 369 cases

SCOPUS: ar.jinfo:eu-repo/semantics/publishe