TY - JOUR TI - HOL in HOL over a set-theoretic universe : consistency of NK with infinity and choice AU - Benzmüller, Christoph AU - Kirchner, Daniel PY - 2026 JO - Archive of Formal Proofs PB - SourceForge CY - San Diego, CA SN - 2150-914x UR - https://fis.uni-bamberg.de/handle/uniba/117778 LA - eng ER - TY - JOUR TI - A Deep Embedding of HOL in HOL : Soundness, Completeness, Consistency (Isabelle/HOL dataset) AU - Benzmüller, Christoph AU - Kirchner, Daniel PY - 2026 JO - Archive of Formal Proofs PB - SourceForge CY - San Diego, CA SN - 2150-914x UR - https://fis.uni-bamberg.de/handle/uniba/117132 LA - eng ER - TY - JOUR TI - Monadic Second-Order Logic in HOL : Deep and Shallow Embeddings with Automated Faithfulness (Isabelle/HOL dataset) AU - Benzmüller, Christoph AU - Kirchner, Daniel PY - 2026 JO - Archive of Formal Proofs PB - SourceForge CY - San Diego, CA SN - 2150-914x UR - https://fis.uni-bamberg.de/handle/uniba/117133 LA - eng ER - TY - GEN TI - First-Order Modal Logic in HOL : Deep and Shallow Embeddings with Automated Faithfulness (Extended Preprint) AU - Benzmüller, Christoph AU - Kirchner, Daniel PY - 2026 PB - arXiv DO - 10.48550/arxiv.2607.10880 UR - https://fis.uni-bamberg.de/handle/uniba/117136 LA - eng ER - TY - GEN TI - Monadic Second-Order Logic in HOL : Deep and Shallow with Automated Faithfulness (Extended Preprint) AU - Benzmüller, Christoph AU - Kirchner, Daniel PY - 2026 PB - arXiv DO - 10.48550/arxiv.2609.07345 UR - https://fis.uni-bamberg.de/handle/uniba/117134 LA - eng ER - TY - GEN TI - Many Logics, One Methodology : A Plea for Logical Pluralism in Formalised Reasoning (preprint) AU - Benzmüller, Christoph AU - Kirchner, Daniel AU - Pasetto, Luca PY - 2026 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/115589 LA - eng AB - 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. KW - Logical Pluralism KW - Meta-Logical Reasoning KW - Proof Assistants KW - Higher-Order Logic KW - Classical and Non-Classical Logics ER - TY - GEN TI - Many Logics, One Methodology : A Plea for Logical Pluralism in Formalised Reasoning (preprint) AU - Benzmüller, Christoph AU - Kirchner, Daniel AU - Pasetto, Luca PY - 2026 PB - arXiv DO - 10.48550/arxiv.2605.27246 UR - https://fis.uni-bamberg.de/handle/uniba/115304 LA - eng AB - 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. KW - Logical Pluralism KW - Meta-Logical Reasoning KW - Proof Assistants KW - Higher-Order Logic KW - Classical and Non-Classical Logics ER - TY - JOUR TI - Neural-guided superoptimization in ethereum AU - Aguiar, Matheus Araújo AU - Albert, Elvira AU - Genaim, Samir AU - Gordillo, Pablo AU - Hernández-Cerezo, Alejandro AU - Kirchner, Daniel AU - Rubio, Albert PY - 2026 SP - 1-15 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/113119 LA - eng AB - 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. KW - Smart contracts KW - Ethereum KW - Optimization KW - Machine learning ER - TY - JOUR TI - Secure Optimizations on Ethereum Bytecode Jump-Free Sequences AU - Albert, Elvira AU - Genaim, Samir AU - Kirchner, Daniel AU - Martin-Martin, Enrique PY - 2025 JO - IEEE Transactions on Dependable and Secure Computing VL - 22 IS - 4 SP - 3676-3691 PB - IEEE CY - New York, NY SN - 1941-0018 DO - 10.1109/tdsc.2025.3536803 UR - https://fis.uni-bamberg.de/handle/uniba/110286 LA - eng ER - TY - JOUR TI - Neural-guided superoptimization in ethereum AU - Aguiar, Matheus Araújo AU - Albert, Elvira AU - Genaim, Samir AU - Gordillo, Pablo AU - Hernández-Cerezo, Alejandro AU - Kirchner, Daniel AU - Rubio, Albert PY - 2025 JO - Information and Software Technology VL - 186 IS - October 2025, 107800 SP - 1-15 PB - Elsevier Science CY - Amsterdam [u.a.] SN - 0950-5849 DO - 10.1016/j.infsof.2025.107800 UR - https://fis.uni-bamberg.de/handle/uniba/110288 LA - eng AB - 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. KW - Smart contracts KW - Ethereum KW - Optimization KW - Machine learning ER - TY - JOUR TI - Computer-Verified Foundations of Metaphysics AU - Kirchner, Daniel PY - 2025 SP - 95-98 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106098 LA - eng AB - - KW - Metaphysics ER - TY - JOUR TI - Computer-Verified Foundations of Metaphysics AU - Kirchner, Daniel PY - 2024 JO - Künstliche Intelligenz : KI ; Forschung, Entwicklung, Erfahrungen VL - 38 IS - 1-2 SP - 95-98 PB - Springer CY - Berlin SN - 1610-1987 DO - 10.1007/s13218-024-00834-z UR - https://fis.uni-bamberg.de/handle/uniba/104324 LA - eng AB - - KW - Metaphysics ER - TY - GEN TI - Artifact of the Paper "Formally Verified EVM Block-Optimizations" AU - Albert, Elvira AU - Genaim, Samir AU - Kirchner, Daniel AU - Martin-Martin, Enrique PY - 2023 IS - Published April 24, 2023 PB - Zenodo DO - 10.5281/zenodo.7858277 UR - https://fis.uni-bamberg.de/handle/uniba/110285 LA - eng ER - TY - CPAPER TI - Formally Verified EVM Block-Optimizations AU - Kirchner, Daniel AU - Genaim, Samir AU - Albert, Elvira AU - Martin-Martin, Enrique PY - 2023 SP - 176-189 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/90216 LA - eng AB - 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. KW - Coq KW - Ethereum Virtual Machine KW - Smart Contracts KW - Optimization KW - Theorem Proving ER - TY - CPAPER TI - Formally Verified EVM Block-Optimizations AU - Kirchner, Daniel AU - Genaim, Samir AU - Albert, Elvira AU - Martin-Martin, Enrique PY - 2023 T2 - Computer Aided Verification : 35th International Conference, CAV 2023, Paris, France, July 17–22, 2023, Proceedings, Part III SP - 176-189 PB - Springer Nature Switzerland CY - Cham T3 - Lecture Notes in Computer Science SN - 978-3-031-37709-9 DO - 10.1007/978-3-031-37709-9_9 UR - https://fis.uni-bamberg.de/handle/uniba/89789 LA - eng AB - 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. KW - Coq KW - Ethereum Virtual Machine KW - Smart Contracts KW - Optimization KW - Theorem Proving ER - TY - JOUR TI - Abstract Object Theory AU - Kirchner, Daniel PY - 2022 JO - Archive of Formal Proofs SP - 392 SN - 2150-914x UR - https://fis.uni-bamberg.de/handle/uniba/57615 LA - eng ER - TY - THES TI - Computer-Verified Foundations of Metaphysics and an Ontology of Natural Numbers in Isabelle/HOL AU - Kirchner, Daniel PY - 2022 PB - Refubium - Repositorium der Freien Universität Berlin CY - Berlin DO - 10.17169/refubium-35141 UR - https://fis.uni-bamberg.de/handle/uniba/57511 LA - eng ER - TY - JOUR TI - Computer Science and Metaphysics : a Cross-Fertilization AU - Kirchner, Daniel AU - Benzmüller, Christoph AU - Zalta, Edward N. PY - 2019 JO - Open Philosophy VL - 2 IS - 1 SP - 230-251 PB - De Gruyter Poland CY - Warsaw SN - 2543-8875 DO - 10.1515/opphil-2019-0015 UR - https://fis.uni-bamberg.de/handle/uniba/55656 LA - eng ER - TY - GEN TI - Computer Science and Metaphysics : a Cross-Fertilization AU - Kirchner, Daniel AU - Benzmüller, Christoph AU - Zalta, Edward N. PY - 2019 SP - 1-39 PB - arXiv DO - 10.48550/ARXIV.1905.00787 UR - https://fis.uni-bamberg.de/handle/uniba/55655 LA - eng ER - TY - JOUR TI - Mechanizing prinzipia Logico-Metaphysica in functional type-theory AU - Kirchner, Daniel AU - Benzmüller, Christoph AU - Zalta, Edward N. PY - 2019 JO - The review of symbolic logic : RSL VL - 13 IS - 1 SP - 206-218 PB - Cambridge Univ. Press CY - Cambridge SN - 1755-0211 DO - 10.1017/S1755020319000297 UR - https://fis.uni-bamberg.de/handle/uniba/54511 LA - eng ER -