Iterating non-aggregative structure compositions

DOI10.4230/LIPICS.FSTTCS.2025.18MaRDI QIDQ7391890zbMATH OpenFDO

Authors Marius Bozga, Radu Iosif, Florian Zuleger

Publication date 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2025.18

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• BI as an assertion language for mutable data structures
• Context logic and tree update
• Context logic as modal logic, completeness and parametric inexpressivity
• Graph searching and a min-max theorem for tree-width
• Graph structure and monadic second-order logic. A language-theoretic approach
• scientific article; zbMATH DE number 6970800 (Why is no real title available?)
• scientific article; zbMATH DE number 2086655 (Why is no real title available?)
• scientific article; zbMATH DE number 1841809 (Why is no real title available?)
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• Parametrized complexity theory.
• Possible worlds and resources: The semantics of \(\mathbf{BI}\)
• Static Analysis
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The monadic second-order logic of graphs. VII: Graphs as relational structures
• The structure of the models of decidable monadic theories of graphs

This page was built for publication: Iterating non-aggregative structure compositions

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