Titlebook: Computer Aided Verification; 33rd International C Alexandra Silva,K. Rustan M. Leino Conference proceedings‘‘‘‘‘‘‘‘ 2021 The Editor(s) (if

BIDE

itinerary

Decision Tree Learning in CEGIS-Based Termination Analysisorithm, our algorithm detects . in a set of example transitions and uses them for refining decision trees. We have implemented the proposed method and obtained promising experimental results on existing benchmark sets of (non-)termination verification problems that require synthesis of piecewise-defined lexicographic affine ranking functions.

Fresco

anticipate

Ghost Signals: Verifying Termination of Busy Waitingt if the looping thread holds an obligation to set a signal ., then .? is ordered above .. By?using conventional shared state invariants to associate the state of ghost signals with the state of data structures, programs busy-waiting for arbitrary conditions over arbitrary data structures can be verified.