Framework for Evaluating Loop Invariant Detection Games in Relation to Automated Dynamic Invariant Detectors

2015 ◽  
Author(s):  
Mehmet Yilmaz
2010 ◽  
Vol 29 (8) ◽  
pp. 1485-1495 ◽  
Author(s):  
Matthias Schlachter ◽  
Marco Reisert ◽  
Corinna Herz ◽  
Fabienne Schlurmann ◽  
Silke Lassmann ◽  
...  

2021 ◽  
Vol 12 (4) ◽  
pp. 36-51
Author(s):  
Francesco Maiorana

The vision of introducing computing as a literacy taught from primary school to higher and lifelong education is producing a worldwide new curriculum design and adoption. A strong research effort has involved researchers and educators to find the best ways to prepare teachers and their students for computing with an emphasis on core computer science concepts. This paper, starting from a previously developed curriculum, aims to present and discuss learning trajectories for a first course on computing aiming to presenting key concepts first, such as functions and their use. This learning trajectory is compared with a second learning trajectory presenting loop and loop invariant first and a third one presenting variable first.


2018 ◽  
Vol 52 (7) ◽  
pp. 843-849 ◽  
Author(s):  
V. S. Vasilev ◽  
A. I. Legalov
Keyword(s):  

2019 ◽  
Vol 30 (3) ◽  
pp. 697-714
Author(s):  
Stefan Hetzl ◽  
Sebastian Zivota

Abstract We present formula equations—first-order formulas with unknowns standing for predicates—as a general formalism for treating certain questions in logic and computer science, like the Auflösungsproblem and loop invariant generation. In the case of the language of affine terms over $\mathbb{Q}$, we translate a quantifier-free formula equation into an equivalent statement about affine spaces over $\mathbb{Q}$, which can then be decided by an iteration procedure.


Sign in / Sign up

Export Citation Format

Share Document