Provably correct runtime monitoring

被引:5
|
作者
Aktug, Irem [1 ]
Dam, Mads [1 ]
Gurov, Dilian
机构
[1] KTH, Sch Comp Sci & Commun, ACCESS Linnaeus Ctr, Stockholm, Sweden
来源
基金
瑞典研究理事会;
关键词
Runtime monitoring; Policy enforcement; Monitor inlining; Proof-carrying code; !text type='JAVA']JAVA[!/text; ENFORCEMENT;
D O I
10.1016/j.jlap.2008.12.002
中图分类号
学科分类号
摘要
Runtime monitoring is an established technique to enforce a wide range of program safety and security properties. We present a formalization of monitoring and monitor inlining, for the Java Virtual Machine. Monitors are security automata given in a special-purpose monitor specification language, ConSpec. The automata operate on finite or infinite strings of calls to a fixed API, allowing local dependencies on parameter values and heap content. We use a two-level class file annotation scheme to characterize two key properties: (i) that the program is correct with respect to the monitor as a constraint on allowed program behavior, and (ii) that the program has a copy of the given monitor embedded into it. As the main application of these results we sketch a simple inlining algorithm and show how the two-level annotations can be completed to produce a fully annotated program which is valid in the standard sense of Floyd/Hoare logic. This establishes the mediation property that inlined programs are guaranteed to adhere to the intended policy. Furthermore, validity can be checked efficiently using a weakest precondition based annotation checker, thus preparing the ground for on-device checking of policy adherence in a proof-carrying code setting. (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码:304 / 339
页数:36
相关论文
共 50 条
  • [1] Provably correct runtime monitoring
    School of Computer Science and Communication, KTH, Sweden
    不详
    [J]. J. Logic. Algebraic Program., 1600, 5 (304-339):
  • [2] Provably correct runtime monitoring (extended abstract)
    Aktug, Irem
    Dam, Mads
    Gurov, Dilian
    [J]. FM 2008: FORMAL METHODS, PROCEEDINGS, 2008, 5014 : 262 - +
  • [3] Provably correct runtime enforcement of non-interference properties
    Venkatakrishnan, V. N.
    Xu, Wei
    DuVarney, Daniel C.
    Sekar, R.
    [J]. INFORMATION AND COMMUNICATIONS SECURITY, PROCEEDINGS, 2006, 4307 : 332 - +
  • [4] Provably-Robust Runtime Monitoring of Neuron Activation Patterns
    Cheng, Chih-Hong
    [J]. PROCEEDINGS OF THE 2021 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE 2021), 2021, : 1310 - 1313
  • [5] A PROVABLY CORRECT COMPILER GENERATOR
    PALSBERG, J
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 582 : 418 - 434
  • [6] PROVABLY CORRECT CRITICAL PATHS
    MCGEER, PC
    BRAYTON, RK
    [J]. ADVANCED RESEARCH IN VLSI : PROCEEDINGS OF THE DECENNIAL CALTECH CONFERENCE ON VLSI, 1989, : 119 - 142
  • [7] PROVABLY CORRECT THEORIES OF ACTION
    LIN, FZ
    SHOHAM, Y
    [J]. JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, 1995, 42 (02): : 293 - 320
  • [8] Provably Correct Implementations of Services
    Bruni, Roberto
    De Nicola, Rocco
    Loreti, Michele
    Mezzina, Leonardo Gaetano
    [J]. TRUSTWORTHY GLOBAL COMPUTING, 2009, 5474 : 69 - +
  • [9] Provably correct inline monitoring for multithreaded Java']Java-like programs
    Dam, Mads
    Jacobs, Bart
    Lundblad, Andreas
    Piessens, Frank
    [J]. JOURNAL OF COMPUTER SECURITY, 2010, 18 (01) : 37 - 59
  • [10] DISCONTINUITIES OF PROVABLY CORRECT OPERATORS ON THE PROVABLY RECURSIVE REAL NUMBERS
    COLLINS, WJ
    YOUNG, P
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1983, 48 (04) : 913 - 920