Concrete and abstract semantics to check secure information flow in concurrent programs

被引:0
|
作者
Bernardeschi, C [1 ]
De Francesco, N [1 ]
Lettieri, G [1 ]
机构
[1] Univ Pisa, Dipartimento Ingn Informaz, Pisa, Italy
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper presents a technique for verifying secure information flow in concurrent programs consisting of a number of independently executing sequential processes with private memory. Communications between processes are synchronous. Moreover, processes are open systems that can accept inputs from the environment and produce outputs towards the environment. The technique is based on an abstract interpretation. First we define a concrete instrumented semantics where each value is annotated with the security level of the information on which it depends. Then we define an abstract semantics of the language that abstracts from actual data and maintains only the annotations on the security level.
引用
收藏
页码:81 / 98
页数:18
相关论文
共 50 条
  • [21] SEMANTICS FOR LOGIC PROGRAMS WITHOUT OCCUR CHECK
    WEIJLAND, WP
    [J]. THEORETICAL COMPUTER SCIENCE, 1990, 71 (01) : 155 - 174
  • [22] FULLY ABSTRACT COMPOSITIONAL SEMANTICS FOR LOGIC PROGRAMS
    GAIFMAN, H
    SHAPIRO, E
    [J]. CONFERENCE RECORD OF THE SIXTEENTH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES, 1989, : 134 - 142
  • [23] A Sound Analysis for Secure Information Flow Using Abstract Memory Graphs
    Ghindici, Dorina
    Simplot-Ryl, Isabelle
    Talbot, Jean-Marc
    [J]. FUNDAMENTALS OF SOFTWARE ENGINEERING, 2010, 5961 : 355 - +
  • [24] A fully abstract may testing semantics for concurrent objects
    Jeffrey, A
    Rathke, J
    [J]. THEORETICAL COMPUTER SCIENCE, 2005, 338 (1-3) : 17 - 63
  • [25] Generalized abstract non-interference: Abstract secure information-flow analysis for automata
    Giacobazzi, R
    Mastroeni, I
    [J]. COMPUTER NETWORK SECURITY, PROCEEDINGS, 2005, 3685 : 221 - 234
  • [26] A fully abstract may testing semantics for concurrent objects
    Jeffrey, A
    Rathke, J
    [J]. 17TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2002, : 101 - 112
  • [27] Backwards-directed information flow analysis for concurrent programs
    Winter, Kirsten
    Coughlin, Nicholas
    Smith, Graeme
    [J]. 2021 IEEE 34TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2021), 2021, : 33 - 48
  • [28] Phase semantics and verification of concurrent constraint programs
    Fages, F
    Ruet, P
    Soliman, S
    [J]. THIRTEENTH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1998, : 141 - 152
  • [29] DENOTATIONAL SEMANTICS OF CONCURRENT PROGRAMS WITH SHARED MEMORY
    BROY, M
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1984, 166 : 163 - 173
  • [30] Verifying Optimizations of Concurrent Programs in the Promising Semantics
    Zha, Junpeng
    Liang, Hongjin
    Feng, Xinyu
    [J]. PROCEEDINGS OF THE 43RD ACM SIGPLAN INTERNATIONAL CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI '22), 2022, : 903 - 917