research

Program schemata vs. automata for decidability of program logics

Abstract

AbstractA new technique for decidability of program logics is introduced. This technique is applied to the most expressive propositional program logic - mu-calculus

    Similar works