Abstract The problem of model checking procedural programs has fostered much research towards the definition temporal logics for reasoning on context-free structures. most notable such results are Nested Words, as CaRet and NWTL. Recently, logic OPTL was introduced, based class Operator Precedence Languages (OPL), more powerful than Words. We define new OPL-based POTL, provide a procedure it. P...