Implementing a CTL model checker with G, a language for programming graph neural networks

DOI10.1007/978-3-031-35355-0_4MaRDI QIDQ6535461zbMATH OpenFDO

Authors Matteo Belenchia, Flavio Corradini, Michela Quadrini, Michele Loreti

Publication date 11 January 2024

Full work available at URL https://doi.org/10.1007/978-3-031-35355-0_4

zbMATH Keywords

computation tree logicgraph neural networksmodel checking

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Artificial neural networks and deep learning (68T07)

Recommendations

• The logic of graph neural networks
• Graph rewriting for graph neural networks
• Beyond graph neural networks with lifted relational neural networks
• Using graph convolutional networks for approximate reasoning with abstract argumentation frameworks: a feasibility study

Cites work

• A design of GPU-based quantitative model checking
• A logic for reasoning about time and reliability
• BFS-based model checking of linear-time properties with an application on GPUs
• scientific article; zbMATH DE number 3870578 (Why is no real title available?)
• scientific article; zbMATH DE number 1059247 (Why is no real title available?)
• scientific article; zbMATH DE number 3799616 (Why is no real title available?)
• Semantics with applications: an appetizer.
• The mu-calculus and Model Checking

Cited in

(3)

• A gaze into the internal logic of graph neural networks, with logic
• Graph rewriting for graph neural networks
• The \(\mu \mathcal{G}\) language for programming graph neural networks

This page was built for publication: Implementing a CTL model checker with \(\mu \mathcal{G}\), a language for programming graph neural networks

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