Extending Co-logic Programs for Branching-Time Model Checking

DOI10.1007/978-3-319-14125-1_8zbMath1453.68034OpenAlexW658233897MaRDI QIDQ3453651

Hirohisa Seki

Publication date: 30 November 2015

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-14125-1_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)

Related Items (2)

On dual programs in co-logic programming and the Horn \({\mu}\)-calculus ⋮ On Dual Programs in Co-Logic Programming

Uses Software

• LTL2BA

Cites Work

• Fundamental properties of infinite trees
• Semantics of infinite tree logic programming
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs
• Proving Properties of Co-logic Programs with Negation by Program Transformations
• Infinite Computation, Co-induction and Computational Logic
• Deciding Full Branching Time Logic by Program Transformation
• Coinductive Logic Programming with Negation
• Coinductive Logic Programming and Its Applications
• A kripke-kleene semantics for logic programs*
• An automata-theoretic approach to branching-time model checking
• Coinductive Logic Programming
• Datalog LITE
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extending Co-logic Programs for Branching-Time Model Checking