Abstract We present the first machine learning approach to termination analysis of probabilistic programs. Ranking supermartingales (RSMs) prove that programs halt, in expectation, within a finite number steps. While previously RSMs were directly synthesised from source code, our method learns them sampled execution traces. introduce neural ranking supermartingale : we let network fit an RSM ov...

program: uint x, y Θ : x > 0 ∧ x%2 = 0 τ1 : x%3 = 0 ∧ x ′ = x − 2 ∧ y′ = y τ2 : x%3 6= 0 ∧ x ′ = x − x 2 ∧ y′ = y τ3 : y > x ∧ y ′ = y − x ∧ x′ = x

This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalises traditional termination analysis where an analyser tries to verify termination for a specified mode. Our contribution is a methodology in which components of traditional termination analysis are combined with backwards analysis to obtain an analyser for termination inference. We i...

abstract to evaluate the effects of the irrigation termination in different growth stages on yield and its components of autumn’s canola cultivars in isfahan region. an experiment was conducted in 2005-2006 in kabotar abad research station. a split plot layout within a randomized complete block design with tree replication was used. main plots were seven level of the irrigation cut-off time (d1...