Linear Resources in Isabelle/HOL

被引:0
|
作者
Smola, Filip [1 ]
Fleuriot, Jacques D. [1 ]
机构
[1] Univ Edinburgh, Sch Infomat, Edinburgh, Scotland
基金
英国工程与自然科学研究理事会;
关键词
Process models; Isabelle/HOL; Intuitionistic linear logic; Deep emebedding; LOGIC; PROPOSITIONS; PROOFS;
D O I
10.1007/s10817-024-09698-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a formal framework for process composition based on actions that are specified by their input and output resources. The correctness of these compositions is verified by translating them into deductions in intuitionistic linear logic. As part of the verification we derive simple conditions on the compositions which ensure well-formedness of the corresponding deduction when satisfied. We mechanise the whole framework, including a deep embedding of ILL, in the proof assistant Isabelle/HOL. Beyond the increased confidence in our proofs, this allows us to automatically generate executable code for our verified definitions. We demonstrate our approach by formalising part of the simulation game Factorio and modelling a manufacturing process in it. Our framework guarantees that this model is free of bottlenecks.
引用
收藏
页数:49
相关论文
共 50 条
  • [31] A Denotational Semantics of Solidity in Isabelle/HOL
    Marmsoler, Diego
    Brucker, Achim D.
    SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM 2021), 2021, 13085 : 403 - 422
  • [32] Automating Free Logic in Isabelle/HOL
    Benzmueller, Christoph
    Scott, Dana
    MATHEMATICAL SOFTWARE, ICMS 2016, 2016, 9725 : 43 - 50
  • [33] Extracting a normalization algorithm in Isabelle/HOL
    Berghofer, S
    TYPES FOR PROOFS AND PROGRAMS, 2006, 3839 : 50 - 65
  • [34] Verified Real Asymptotics in Isabelle/HOL
    Eberl, Manuel
    PROCEEDINGS OF THE 2019 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION (ISSAC '19), 2019, : 147 - 154
  • [35] On the mechanization of real analysis in Isabelle/HOL
    Fleuriot, JD
    THEOREM PROVING IN HIGHER ORDER LOGICS, PROCEEDINGS, 2000, 1869 : 145 - 161
  • [36] Formalizing O notation in Isabelle/HOL
    Avigad, J
    Donnelly, K
    AUTOMATED REASONING, PROCEEDINGS, 2004, 3097 : 357 - 371
  • [37] Imperative functional programming with Isabelle/HOL
    Bulwahn, Lukas
    Krauss, Alexander
    Haftmann, Horian
    Erkoek, Levent
    Matthews, John
    THEOREM PROVING IN HIGHER ORDER LOGICS, PROCEEDINGS, 2008, 5170 : 134 - +
  • [38] Stateful Protocol Composition in Isabelle/HOL
    Hess, Andreas V.
    Modersheim, Sebastian A.
    Brucker, Achim D.
    ACM TRANSACTIONS ON PRIVACY AND SECURITY, 2023, 26 (03)
  • [39] Weak alternating automata in Isabelle/HOL
    Merz, S
    THEOREM PROVING IN HIGHER ORDER LOGICS, PROCEEDINGS, 2000, 1869 : 424 - 441
  • [40] Bounded Model Generation for Isabelle/HOL
    Weber, Tjark
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 125 (03) : 103 - 116