Filters








6,140 Hits in 4.6 sec

Abstract interpretation-based approaches to Security - A Survey on Abstract Non-Interference and its Challenging Applications

Isabella Mastroeni
2013 Electronic Proceedings in Theoretical Computer Science  
In this paper we provide a survey on the framework of abstract non-interference.  ...  Finally, we consider two challenging research fields concerning security where abstract non-interference seems a promising approach providing new perspectives and new solutions to open problems: Code injection  ...  The abstract approach to non-interference A different abstract interpretation-based approach to non-interference can be obtained by modelling attackers as static analyzers of programs.  ... 
doi:10.4204/eptcs.129.4 fatcat:ijzdyl5hcvebjdozaxl5t77oeu

A Weakest Precondition Approach to Robustness [chapter]

Musard Balliu, Isabella Mastroeni
2010 Lecture Notes in Computer Science  
In this paper, we extend a method recently proposed for checking declassified non-interference in presence of passive attackers only, in order to check robustness by means of weakest precondition semantics  ...  E-government, web-based financial transactions or military and health care information systems are only a few examples where large amount of information can reside on different hosts distributed worldwide  ...  The authors define declassified non interference as a completeness problem in abstract interpretation and the semantic function corresponds to the Wlp semantics.  ... 
doi:10.1007/978-3-642-17499-5_11 fatcat:z3rgqparvjdwzink4iygieq44e

An abstract stack based approach to verified compositional compilation to machine code

Yuting Wang, Pierre Wilke, Zhong Shao
2019 Proceedings of the ACM on Programming Languages (PACMPL)  
This research is based on work supported in part by NSF grants 1521523, 1715154, and 1763399 and DARPA grant FA8750-15-C-0082. The U.S.  ...  (the first pass is an identity transformation that translates C programs with a non-deterministic semantics into those with a deterministic one).  ...  In order to formalize the non-interference properties of memory operations across (heterogeneous) modules, Stewart et al. designed structured memory injections, which generalize memory injections to keep  ... 
doi:10.1145/3290375 fatcat:vfg7amihejfhnmhxilxqi55v74

SoK: Practical Foundations for Software Spectre Defenses [article]

Sunjay Cauligi, Craig Disselkoen, Daniel Moghimi, Gilles Barthe, Deian Stefan
2022 arXiv   pre-print
As a result of our analysis, we suggest practical choices for developers of analysis and mitigation tools, and we identify several open problems in this area to guide future work on grounded software defenses  ...  To defend against Spectre, developers of verification tools and compiler-based mitigations are forced to reason about microarchitectural details such as speculative execution.  ...  We refer to this simple extension as a direct non-interference property, or direct NI. Definition 1 (Direct non-interference).  ... 
arXiv:2105.05801v3 fatcat:456zmxojcbc2hllvattuuckhpu

Relational bytecode correlations

Lennart Beringer
2010 The Journal of Logic and Algebraic Programming  
The material is based on a complete formalisation in Isabelle/HOL.  ...  Contrary to previous type systems for non-interference, no restrictions are imposed on the control flow structure of programs.  ...  We are grateful to the members of both projects for discussions on type systems and program logics for information flow.  ... 
doi:10.1016/j.jlap.2010.07.005 fatcat:cs2xqciovbhori3r4q7hljgsoa

Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions [chapter]

Raphaël Monat, Antoine Miné
2017 Lecture Notes in Computer Science  
We build on previous work that formalized rely-guarantee verification methods as a concrete, fixpoint-based semantics, and then apply classic numeric abstractions to abstract independently thread states  ...  and thread interference.  ...  ; while [16] proposes a related approach based on constraints.  ... 
doi:10.1007/978-3-319-52234-0_21 fatcat:mghcniaftnclfnssz6qhcwvujq

Fault-Tolerant Non-interference [chapter]

Filippo Del Tedesco, Alejandro Russo, David Sands
2014 Lecture Notes in Computer Science  
We develop a software-based technique to achieve this faulttolerant non-interference property.  ...  The method is defined on a simple assembly language, and guarantees security for any assembly program provided as input.  ...  Fault Tolerance vs Non-Interference As we have shown in our result, fault tolerance and non-interference present interesting connections, and we believe that our combination is a novel one.  ... 
doi:10.1007/978-3-319-04897-0_5 fatcat:ntd3mb6i25go5pb6hgrxk7vaji

Hyper Static Analysis of Programs – An Abstract Interpretation-Based Framework for Hyperproperties Verification

Michele Pasqua, Isabella Mastroeni
2019 Zenodo  
Information flows verification is based on a notion of dependency between a system's objects, which requires specifications expressing relations between different executions of a system.  ...  Unhandled information flows potentially leave the door open to very dangerous types of security attacks, such as code injection or sensitive information leakage.  ...  A common approach is to compute the collecting semantics with a denotational semantics inductively defined on the program's code.  ... 
doi:10.5281/zenodo.6584085 fatcat:gllzqtqscrgfhbce6cm3lw7gnq

A new verified compiler backend for CakeML

Yong Kiam Tan, Magnus O. Myreen, Ramana Kumar, Anthony Fox, Scott Owens, Michael Norrish
2016 SIGPLAN notices  
Our new compiler features a sequence of intermediate languages that allows it to incrementally compile away high-level features and enables verification at the right levels of semantic detail.  ...  We have developed and mechanically verified a new compiler backend for CakeML.  ...  Acknowledgments We thank Mike Gordon, Konrad Slind and the anonymous reviewers for their helpful comments on drafts of this paper.  ... 
doi:10.1145/3022670.2951924 fatcat:xlgjtszrsne37ga7psuyr3e72a

A new verified compiler backend for CakeML

Yong Kiam Tan, Magnus O. Myreen, Ramana Kumar, Anthony Fox, Scott Owens, Michael Norrish
2016 Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming - ICFP 2016  
Our new compiler features a sequence of intermediate languages that allows it to incrementally compile away high-level features and enables verification at the right levels of semantic detail.  ...  We have developed and mechanically verified a new compiler backend for CakeML.  ...  Acknowledgments We thank Mike Gordon, Konrad Slind and the anonymous reviewers for their helpful comments on drafts of this paper.  ... 
doi:10.1145/2951913.2951924 dblp:conf/icfp/TanMKFON16 fatcat:hvqujr36nnaebpprqbiu2j2r7m

Declassification: Dimensions and principles

Andrei Sabelfeld, David Sands, J.D. Guttman
2009 Journal of Computer Security  
While the security community has recognised the importance of the problem, the state-of-the-art in information release is, unfortunately, a number of approaches with somewhat unconnected semantic goals  ...  These principles shed light on existing definitions and may also serve as useful "sanity checks" for emerging models.  ...  This approach can benefit from a non-dual treatment of endorsement.  ... 
doi:10.3233/jcs-2009-0352 fatcat:c6ngeq6bbrgnvfdc6r3jjqz77a

Verifying a Concurrent Garbage Collector with a Rely-Guarantee Methodology

Yannick Zakowski, David Cachera, Delphine Demange, Gustavo Petri, David Pichardie, Suresh Jagannathan, Jan Vitek
2018 Journal of automated reasoning  
In this paper, we address this problem by proposing a mechanized proof methodology based on the Rely-Guarantee proof technique.  ...  We design a compiler intermediate representation with strong type guarantees, dedicated support for abstract concurrent data structures, and high-level iterators on runtime internals.  ...  We also thank Vincent Laporte for his work earlier in this project, and his help on implementing parts of the garbage collector presented here.  ... 
doi:10.1007/s10817-018-9489-x fatcat:56lgvogkubchbkl26o5ta7fsqq

Static Analysis of Embedded Real-Time Concurrent Software with Dynamic Priorities

Antoine Miné
2017 Electronical Notes in Theoretical Computer Science  
In previous work, we developed a sound static analysis by abstract interpretation to check the absence of run-time errors in concurrent programs, focusing on embedded C programs composed of a fixed set  ...  Following previous work, we first provide a concrete semantics in thread-modular denotational form that is complete for safety properties, and then show how to apply classic abstractions to obtain an effective  ...  Concretization for the interference abstraction. Fig. 13 . 13 Interference propagation based on locks. Fig. 14 . 14 Interference propagation based on priorities.  ... 
doi:10.1016/j.entcs.2017.02.002 fatcat:flf6ltmdnfdu7kd7lvlywjvxgi

Formal verification of security protocol implementations: a survey

Matteo Avalle, Alfredo Pironti, Riccardo Sisto
2012 Formal Aspects of Computing  
This paper surveys these attempts, focusing on approaches that target the application code that implements protocol logic, rather than the libraries that implement cryptography.  ...  The two main approaches of model extraction and code generation are presented, along with the main techniques adopted for each approach.  ...  On the code generation side, the steep learning curve to handle abstract models makes this approach usually not affordable by non experts.  ... 
doi:10.1007/s00165-012-0269-9 fatcat:z7bgh5nnuzh4leo7wgf5rwd5ci

Deep Specifications and Certified Abstraction Layers

Ronghui Gu, Jérémie Koenig, Tahina Ramananandro, Zhong Shao, Xiongnan (Newman) Wu, Shu-Chun Weng, Haozhong Zhang, Yu Guo
2015 SIGPLAN notices  
This research is based on work supported in part by DARPA grants FA8750-10-2-0254 and FA8750-12-2-0293, NSF grants 1065451 and 0915888, and ONR Grant N00014-12-1-0478.  ...  A layered approach aims to sort and isolate all components based on a carefully designed set of abstraction levels so we can reason about one small abstraction step at a time and eliminate most unwanted  ...  Whole-machine semantics and contextual refinement Based on the relational transition system which we just defined for LAsm, we can define the whole-machine semantics including not only the code that we  ... 
doi:10.1145/2775051.2676975 fatcat:yfqgugovpvf5dpbfmtjrib7rue
« Previous Showing results 1 — 15 out of 6,140 results