@article{benzmuller2026_117778,
  title = {HOL in HOL over a set-theoretic universe : consistency of NK with infinity and choice},
  author = {Benzmüller, Christoph and Kirchner, Daniel},
  year = {2026},
  journal = {Archive of Formal Proofs},
  publisher = {SourceForge},
  address = {San Diego, CA},
  issn = {2150-914x},
  url = {https://fis.uni-bamberg.de/handle/uniba/117778},
  language = {eng}
}

@article{benzmuller2026_117132,
  title = {A Deep Embedding of HOL in HOL : Soundness, Completeness, Consistency (Isabelle/HOL dataset)},
  author = {Benzmüller, Christoph and Kirchner, Daniel},
  year = {2026},
  journal = {Archive of Formal Proofs},
  publisher = {SourceForge},
  address = {San Diego, CA},
  issn = {2150-914x},
  url = {https://fis.uni-bamberg.de/handle/uniba/117132},
  language = {eng}
}

@article{benzmuller2026_117133,
  title = {Monadic Second-Order Logic in HOL : Deep and Shallow Embeddings with Automated Faithfulness (Isabelle/HOL dataset)},
  author = {Benzmüller, Christoph and Kirchner, Daniel},
  year = {2026},
  journal = {Archive of Formal Proofs},
  publisher = {SourceForge},
  address = {San Diego, CA},
  issn = {2150-914x},
  url = {https://fis.uni-bamberg.de/handle/uniba/117133},
  language = {eng}
}

@misc{benzmuller2026_117136,
  title = {First-Order Modal Logic in HOL : Deep and Shallow Embeddings with Automated Faithfulness (Extended Preprint)},
  author = {Benzmüller, Christoph and Kirchner, Daniel},
  year = {2026},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2607.10880},
  url = {https://fis.uni-bamberg.de/handle/uniba/117136},
  language = {eng}
}

@misc{benzmuller2026_117134,
  title = {Monadic Second-Order Logic in HOL : Deep and Shallow with Automated Faithfulness (Extended Preprint)},
  author = {Benzmüller, Christoph and Kirchner, Daniel},
  year = {2026},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2609.07345},
  url = {https://fis.uni-bamberg.de/handle/uniba/117134},
  language = {eng}
}

@misc{benzmuller2026_115589,
  title = {Many Logics, One Methodology : A Plea for Logical Pluralism in Formalised Reasoning (preprint)},
  author = {Benzmüller, Christoph and Kirchner, Daniel and Pasetto, Luca},
  year = {2026},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-115589x},
  url = {https://fis.uni-bamberg.de/handle/uniba/115589},
  language = {eng},
  abstract = {This position statement looks back on two decades of work on shallow embeddings of non-classical logics in classical higher-order logic (HOL), a line of research that expanded into a range of logic embeddings in HOL and inspired the LogiKEy logic-pluralistic knowledge representation and reasoning methodology. This paper advances the case for logical pluralism at object-logic level within a unifying meta-logical framework such as LogiKEy, grounding the argument in computational metaphysics. More broadly, it advocates principled support for logical pluralism in modern proof assistants, and cautions against logical imperialism -- the rigid adoption of a single foundational logic for large-scale theory developments -- which impedes the interdisciplinary reuse that LogiKEy is designed to enable.},
  keywords = {Logical Pluralism, Meta-Logical Reasoning, Proof Assistants, Higher-Order Logic, Classical and Non-Classical Logics}
}

@misc{benzmuller2026_115304,
  title = {Many Logics, One Methodology : A Plea for Logical Pluralism in Formalised Reasoning (preprint)},
  author = {Benzmüller, Christoph and Kirchner, Daniel and Pasetto, Luca},
  year = {2026},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2605.27246},
  url = {https://fis.uni-bamberg.de/handle/uniba/115304},
  language = {eng},
  abstract = {This position statement looks back on two decades of work on shallow embeddings of non-classical logics in classical higher-order logic (HOL), a line of research that expanded into a range of logic embeddings in HOL and inspired the LogiKEy logic-pluralistic knowledge representation and reasoning methodology. This paper advances the case for logical pluralism at object-logic level within a unifying meta-logical framework such as LogiKEy, grounding the argument in computational metaphysics. More broadly, it advocates principled support for logical pluralism in modern proof assistants, and cautions against logical imperialism -- the rigid adoption of a single foundational logic for large-scale theory developments -- which impedes the interdisciplinary reuse that LogiKEy is designed to enable.},
  keywords = {Logical Pluralism, Meta-Logical Reasoning, Proof Assistants, Higher-Order Logic, Classical and Non-Classical Logics}
}

@article{aguiar2026_113119,
  title = {Neural-guided superoptimization in ethereum},
  author = {Aguiar, Matheus Araújo and Albert, Elvira and Genaim, Samir and Gordillo, Pablo and Hernández-Cerezo, Alejandro and Kirchner, Daniel and Rubio, Albert},
  year = {2026},
  pages = {1-15},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-113119x},
  url = {https://fis.uni-bamberg.de/handle/uniba/113119},
  language = {eng},
  abstract = {Context: Superoptimization is a synthesis technique that, given a loop-free sequence of instructions, searches
for an equivalent sequence that is optimal wrt. an objective function. Superoptimization of Ethereum smart
contracts aims at minimizing the size of their bytecode and the gas consumption of executing the contract’s
functions. The search for the optimal solution poses huge computational demands – as the search space to find
the optimal sequence is exponential on the given size-bound – being the main challenge for superoptimization
today to scale up to real, industrial software. Even if the underlying problem for finding the optimal solution is
decidable, practical tools often prioritize efficiency over completeness. This means they might be implemented
to find a sub-optimal solution or even time out.
Objective: This work aims at leveraging superoptimization to a real setting: Ethereum blockchain. This paper
proposes a neural-guided superoptimization (NGS) approach which incorporates deep neural networks using
(supervised) learning into superoptimization to improve scalability by predicting: (1) if a sequence is already
optimal and hence the search can be skipped; (2) the size-bound for the optimal solution in order to reduce
the search space.
Method: We have downloaded over 13,000 smart contracts deployed on the blockchain for training and testing
the machine learning models, and a disjoint set with 100 of the smart contracts with more transactions to prove
our scalability gains and impact for the Ethereum community.
Results: Incorporating DNNs resulted in a 16x overall speedup (12x for gas) with only 12\% optimization loss
(14\% for gas), or a 3-4x speedup with no optimization loss. For the 100 analyzed contracts, this approach
reduced the average compilation time to 3 min per contract and achieved monetary savings of \$1.24M.
Conclusions: The integration of machine learning models mitigates several limitations of traditional superoptimization
by drastically reducing execution times while maintaining most of the original optimization
gains.},
  keywords = {Smart contracts, Ethereum, Optimization, Machine learning}
}

@article{albert2025_110286,
  title = {Secure Optimizations on Ethereum Bytecode Jump-Free Sequences},
  author = {Albert, Elvira and Genaim, Samir and Kirchner, Daniel and Martin-Martin, Enrique},
  year = {2025},
  journal = {IEEE Transactions on Dependable and Secure Computing},
  volume = {22},
  number = {4},
  pages = {3676-3691},
  publisher = {IEEE},
  address = {New York, NY},
  issn = {1941-0018},
  doi = {10.1109/tdsc.2025.3536803},
  url = {https://fis.uni-bamberg.de/handle/uniba/110286},
  language = {eng}
}

@article{aguiar2025_110288,
  title = {Neural-guided superoptimization in ethereum},
  author = {Aguiar, Matheus Araújo and Albert, Elvira and Genaim, Samir and Gordillo, Pablo and Hernández-Cerezo, Alejandro and Kirchner, Daniel and Rubio, Albert},
  year = {2025},
  journal = {Information and Software Technology},
  volume = {186},
  number = {October 2025, 107800},
  pages = {1-15},
  publisher = {Elsevier Science},
  address = {Amsterdam [u.a.]},
  issn = {0950-5849},
  doi = {10.1016/j.infsof.2025.107800},
  url = {https://fis.uni-bamberg.de/handle/uniba/110288},
  language = {eng},
  abstract = {Context: Superoptimization is a synthesis technique that, given a loop-free sequence of instructions, searches
for an equivalent sequence that is optimal wrt. an objective function. Superoptimization of Ethereum smart
contracts aims at minimizing the size of their bytecode and the gas consumption of executing the contract’s
functions. The search for the optimal solution poses huge computational demands – as the search space to find
the optimal sequence is exponential on the given size-bound – being the main challenge for superoptimization
today to scale up to real, industrial software. Even if the underlying problem for finding the optimal solution is
decidable, practical tools often prioritize efficiency over completeness. This means they might be implemented
to find a sub-optimal solution or even time out.
Objective: This work aims at leveraging superoptimization to a real setting: Ethereum blockchain. This paper
proposes a neural-guided superoptimization (NGS) approach which incorporates deep neural networks using
(supervised) learning into superoptimization to improve scalability by predicting: (1) if a sequence is already
optimal and hence the search can be skipped; (2) the size-bound for the optimal solution in order to reduce
the search space.
Method: We have downloaded over 13,000 smart contracts deployed on the blockchain for training and testing
the machine learning models, and a disjoint set with 100 of the smart contracts with more transactions to prove
our scalability gains and impact for the Ethereum community.
Results: Incorporating DNNs resulted in a 16x overall speedup (12x for gas) with only 12\% optimization loss
(14\% for gas), or a 3-4x speedup with no optimization loss. For the 100 analyzed contracts, this approach
reduced the average compilation time to 3 min per contract and achieved monetary savings of \$1.24M.
Conclusions: The integration of machine learning models mitigates several limitations of traditional superoptimization
by drastically reducing execution times while maintaining most of the original optimization
gains.},
  keywords = {Smart contracts, Ethereum, Optimization, Machine learning}
}

@article{kirchner2025_106098,
  title = {Computer-Verified Foundations of Metaphysics},
  author = {Kirchner, Daniel},
  year = {2025},
  pages = {95-98},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1060980},
  url = {https://fis.uni-bamberg.de/handle/uniba/106098},
  language = {eng},
  abstract = {-},
  keywords = {Metaphysics}
}

@article{kirchner2024_104324,
  title = {Computer-Verified Foundations of Metaphysics},
  author = {Kirchner, Daniel},
  year = {2024},
  journal = {Künstliche Intelligenz : KI ; Forschung, Entwicklung, Erfahrungen},
  volume = {38},
  number = {1-2},
  pages = {95-98},
  publisher = {Springer},
  address = {Berlin},
  issn = {1610-1987},
  doi = {10.1007/s13218-024-00834-z},
  url = {https://fis.uni-bamberg.de/handle/uniba/104324},
  language = {eng},
  abstract = {-},
  keywords = {Metaphysics}
}

@misc{albert2023_110285,
  title = {Artifact of the Paper "Formally Verified EVM Block-Optimizations"},
  author = {Albert, Elvira and Genaim, Samir and Kirchner, Daniel and Martin-Martin, Enrique},
  year = {2023},
  number = {Published April 24, 2023},
  publisher = {Zenodo},
  doi = {10.5281/zenodo.7858277},
  url = {https://fis.uni-bamberg.de/handle/uniba/110285},
  language = {eng}
}

@inproceedings{kirchner2023_90216,
  title = {Formally Verified EVM Block-Optimizations},
  author = {Kirchner, Daniel and Genaim, Samir and Albert, Elvira and Martin-Martin, Enrique},
  year = {2023},
  pages = {176-189},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-902169},
  url = {https://fis.uni-bamberg.de/handle/uniba/90216},
  language = {eng},
  abstract = {The efficiency and the security of smart contracts are their two fundamental properties, but might come at odds: the use of optimizers to enhance efficiency may introduce bugs and compromise security. Our focus is on EVM (Ethereum Virtual Machine) block-optimizations, which enhance the efficiency of jump-free blocks of opcodes by eliminating, reordering and even changing the original opcodes. We reconcile efficiency and security by providing the verification technology to formally prove the correctness of EVM block-optimizations on smart contracts using the Coq proof assistant. This amounts to the challenging problem of proving semantic equivalence of two blocks of EVM instructions, which is realized by means of three novel Coq components: a symbolic execution engine which can execute an EVM block and produce a symbolic state; a number of simplification lemmas which transform a symbolic state into an equivalent one; and a checker of symbolic states to compare the symbolic states produced for the two EVM blocks under comparison.},
  keywords = {Coq, Ethereum Virtual Machine, Smart Contracts, Optimization, Theorem Proving}
}

@inproceedings{kirchner2023_89789,
  title = {Formally Verified EVM Block-Optimizations},
  author = {Kirchner, Daniel and Genaim, Samir and Albert, Elvira and Martin-Martin, Enrique},
  year = {2023},
  booktitle = {Computer Aided Verification : 35th International Conference, CAV 2023, Paris, France, July 17–22, 2023, Proceedings, Part III},
  pages = {176-189},
  publisher = {Springer Nature Switzerland},
  address = {Cham},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-031-37709-9},
  doi = {10.1007/978-3-031-37709-9\_9},
  url = {https://fis.uni-bamberg.de/handle/uniba/89789},
  language = {eng},
  abstract = {The efficiency and the security of smart contracts are their two fundamental properties, but might come at odds: the use of optimizers to enhance efficiency may introduce bugs and compromise security. Our focus is on EVM (Ethereum Virtual Machine) block-optimizations, which enhance the efficiency of jump-free blocks of opcodes by eliminating, reordering and even changing the original opcodes. We reconcile efficiency and security by providing the verification technology to formally prove the correctness of EVM block-optimizations on smart contracts using the Coq proof assistant. This amounts to the challenging problem of proving semantic equivalence of two blocks of EVM instructions, which is realized by means of three novel Coq components: a symbolic execution engine which can execute an EVM block and produce a symbolic state; a number of simplification lemmas which transform a symbolic state into an equivalent one; and a checker of symbolic states to compare the symbolic states produced for the two EVM blocks under comparison.},
  keywords = {Coq, Ethereum Virtual Machine, Smart Contracts, Optimization, Theorem Proving}
}

@article{kirchner2022_57615,
  title = {Abstract Object Theory},
  author = {Kirchner, Daniel},
  year = {2022},
  journal = {Archive of Formal Proofs},
  pages = {392},
  issn = {2150-914x},
  url = {https://fis.uni-bamberg.de/handle/uniba/57615},
  language = {eng}
}

@phdthesis{kirchner2022_57511,
  title = {Computer-Verified Foundations of Metaphysics and an Ontology of Natural Numbers in Isabelle/HOL},
  author = {Kirchner, Daniel},
  year = {2022},
  publisher = {Refubium - Repositorium der Freien Universität Berlin},
  address = {Berlin},
  doi = {10.17169/refubium-35141},
  urn = {urn:nbn:de:kobv:188-refubium-35426-3},
  url = {https://fis.uni-bamberg.de/handle/uniba/57511},
  language = {eng},
  school = {Otto-Friedrich-Universität Bamberg}
}

@article{kirchner2019_55656,
  title = {Computer Science and Metaphysics : a Cross-Fertilization},
  author = {Kirchner, Daniel and Benzmüller, Christoph and Zalta, Edward N.},
  year = {2019},
  journal = {Open Philosophy},
  volume = {2},
  number = {1},
  pages = {230-251},
  publisher = {De Gruyter Poland},
  address = {Warsaw},
  issn = {2543-8875},
  doi = {10.1515/opphil-2019-0015},
  url = {https://fis.uni-bamberg.de/handle/uniba/55656},
  language = {eng}
}

@misc{kirchner2019_55655,
  title = {Computer Science and Metaphysics : a Cross-Fertilization},
  author = {Kirchner, Daniel and Benzmüller, Christoph and Zalta, Edward N.},
  year = {2019},
  pages = {1-39},
  publisher = {arXiv},
  doi = {10.48550/ARXIV.1905.00787},
  url = {https://fis.uni-bamberg.de/handle/uniba/55655},
  language = {eng}
}

@article{kirchner2019_54511,
  title = {Mechanizing prinzipia Logico-Metaphysica in functional type-theory},
  author = {Kirchner, Daniel and Benzmüller, Christoph and Zalta, Edward N.},
  year = {2019},
  journal = {The review of symbolic logic : RSL},
  volume = {13},
  number = {1},
  pages = {206-218},
  publisher = {Cambridge Univ. Press},
  address = {Cambridge},
  issn = {1755-0211},
  doi = {10.1017/S1755020319000297},
  url = {https://fis.uni-bamberg.de/handle/uniba/54511},
  language = {eng}
}

