Verification of non-regular program properties

MaRDI QIDQ3083626zbMATH OpenFDO

Authors Roland Axelsson

Publication date 22 March 2011

Full work available at URL http://edoc.ub.uni-muenchen.de/11677/

zbMATH Keywords

computational complexitiescontext-freecontext-sensitiveHFL(\(k\))higher-order fixpoint logic (HFL)indexed languageslinear indexed languagesmodel checkersnon-regular program propertiesPDLRELEASEUNTIL

Mathematics Subject Classification ID

Temporal logic (03B44) Modal logic (including the logic of norms) (03B45) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• The Complexity of Model Checking Higher-Order Fixpoint Logic
• Computer Aided Verification
• Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic
• CONCUR 2004 - Concurrency Theory
• Non-regular fixed-point logics and games

Cited in

(6)

• scientific article; zbMATH DE number 2084327 (Why is no real title available?)
• Non-regular fixed-point logics and games
• Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic
• Properties Incompleteness Evaluation by Functional Verification
• Computer Aided Verification
• A fixpoint calculus for local and global program flows

This page was built for publication: Verification of non-regular program properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083626)