scholarly journals Semantic characterisation of dead control-flow paths

2001 ◽  
Vol 148 (6) ◽  
pp. 175 ◽  
Author(s):  
I. Hayes ◽  
C. Fidge ◽  
K. Lermer
Keyword(s):  
Geophysics ◽  
2016 ◽  
Vol 81 (1) ◽  
pp. WA225-WA232 ◽  
Author(s):  
Emily B. Voytek ◽  
Caitlin R. Rushlow ◽  
Sarah E. Godsey ◽  
Kamini Singha

Shallow subsurface flow is a dominant process controlling hillslope runoff generation, soil development, and solute reaction and transport. Despite their importance, the location and geometry of these flow paths are difficult to determine. In arctic environments, shallow subsurface flow paths are limited to a thin zone of seasonal thaw above permafrost, which is traditionally assumed to mimic the surface topography. We have used a combined approach of electrical resistivity tomography (ERT) and self-potential (SP) measurements to map shallow subsurface flow paths in and around water tracks, drainage features common to arctic hillslopes. ERT measurements delineate thawed zones in the subsurface that control flow paths, whereas SP is sensitive to groundwater flow. We have found that areas of low electrical resistivity in the water tracks were deeper than manual thaw depth estimates and varied from the surface topography. This finding suggests that traditional techniques might underestimate active-layer thaw and the extent of the flow path network on arctic hillslopes. SP measurements identify complex 3D flow paths in the thawed zone. Our results lay the groundwork for investigations into the seasonal dynamics, hydrologic connectivity, and climate sensitivity of spatially distributed flow path networks on arctic hillslopes.


Author(s):  
Gaurav Parthasarathy ◽  
Peter Müller ◽  
Alexander J. Summers

AbstractA program verifier produces reliable results only if both the logic used to justify the program’s correctness is sound, and the implementation of the program verifier is itself correct. Whereas it is common to formally prove soundness of the logic, the implementation of a verifier typically remains unverified. Bugs in verifier implementations may compromise the trustworthiness of successful verification results. Since program verifiers used in practice are complex, evolving software systems, it is generally not feasible to formally verify their implementation.In this paper, we present an alternative approach: we validate successful runs of the widely-used Boogie verifier by producing a certificate which proves correctness of the obtained verification result. Boogie performs a complex series of program translations before ultimately generating a verification condition whose validity should imply the correctness of the input program. We show how to certify three of Boogie’s core transformation phases: the elimination of cyclic control flow paths, the (SSA-like) replacement of assignments by assumptions using fresh variables (passification), and the final generation of verification conditions. Similar translations are employed by other verifiers. Our implementation produces certificates in Isabelle, based on a novel formalisation of the Boogie language.


1968 ◽  
Vol 115 (3) ◽  
pp. 376 ◽  
Author(s):  
B.R. Myers ◽  
B.R. Myers ◽  
E.A. Davila
Keyword(s):  

2020 ◽  
Vol 16 (2) ◽  
pp. 214
Author(s):  
Wang Yong ◽  
Liu SanMing ◽  
Li Jun ◽  
Cheng Xiangyu ◽  
Zhou Wan

1999 ◽  
Author(s):  
Ed O'Keefe ◽  
Matt Berge

Sign in / Sign up

Export Citation Format

Share Document