CT features of pulmonary arterial hypertension and its major subtypes: a systematic CT evaluation of 292 patients from the ASPIRE Registry

We evaluated the prevalence and prognostic value of CT-pulmonary angiographic (CTPA) measures in 292 treatment naive patients with pulmonary arterial hypertension (PAH). Pulmonary artery calcification (13%) and thrombus (10%) were exclusively seen in PAH-congenital heart disease. Oesophageal dilation (46%) was most frequent in PAH-systemic sclerosis. Ground glass opacification (GGO) (41%), pericardial effusion (38%), lymphadenopathy (19%) and pleural effusion (11%) were common. On multivariate analysis, inferior vena caval area, the presence of pleural effusion and septal lines predicted outcome. In PAH, CTPA provides diagnostic and prognostic information. In addition, the presence of GGO on a CT performed for unexplained breathlessness should alert the physician to the possibility of PAH

Using Flow Specifications of Parameterized Cache Coherence Protocols for Verifying Deadlock Freedom

We consider the problem of verifying deadlock freedom for symmetric cache coherence protocols. In particular, we focus on a specific form of deadlock which is useful for the cache coherence protocol domain and consistent with the internal definition of deadlock in the Murphi model checker: we refer to this deadlock as a system- wide deadlock (s-deadlock). In s-deadlock, the entire system gets blocked and is unable to make any transition. Cache coherence protocols consist of N symmetric cache agents, where N is an unbounded parameter; thus the verification of s-deadlock freedom is naturally a parameterized verification problem. Parametrized verification techniques work by using sound abstractions to reduce the unbounded model to a bounded model. Efficient abstractions which work well for industrial scale protocols typically bound the model by replacing the state of most of the agents by an abstract environment, while keeping just one or two agents as is. However, leveraging such efficient abstractions becomes a challenge for s-deadlock: a violation of s-deadlock is a state in which the transitions of all of the unbounded number of agents cannot occur and so a simple abstraction like the one above will not preserve this violation. In this work we address this challenge by presenting a technique which leverages high-level information about the protocols, in the form of message sequence dia- grams referred to as flows, for constructing invariants that are collectively stronger than s-deadlock. Efficient abstractions can be constructed to verify these invariants. We successfully verify the German and Flash protocols using our technique