作者: Pierre Wolper
关键词: Intermediate logic 、 Interval temporal logic 、 Well-formed formula 、 Linear temporal logic 、 Propositional variable 、 Computer science 、 Dynamic logic (modal logic) 、 Zeroth-order logic 、 Autoepistemic logic 、 Programming language
摘要: We show that the class of properties programs expressible in propositional temporal logic can be substantially extended if we assume to data-independent. Basically, a program is data-independent its behavior does not depend on specific data it operates upon. Our results significantly extend applicability verification and synthesis methods based logic.