scholarly journals Model checking security properties of control flow graphs

2001 ◽  
Vol 9 (3) ◽  
pp. 217-250 ◽  
Author(s):  
Frédéric Besson ◽  
Thomas Jensen ◽  
Daniel Le Métayer ◽  
Tommy Thorn
Keyword(s):  
Model Checking ◽  
Control Flow ◽  
Security Properties ◽  
Flow Graphs

scholarly journals Call Graph and Model Checking for Fine-Grained Android Malicious Behaviour Detection

2020 ◽  
Vol 10 (22) ◽  
pp. 7975
Author(s):  
Giacomo Iadarola ◽  
Fabio Martinelli ◽  
Francesco Mercaldo ◽  
Antonella Santone
Keyword(s):  
Data Structure ◽  
Model Checking ◽  
Private Information ◽  
Control Flow ◽  
Graph Data ◽  
Call Graph ◽  
Fine Grained ◽  
Call Graphs ◽  
Android Applications ◽  
Flow Graphs

The increasing diffusion of mobile devices, widely used for critical tasks such as the transmission of sensitive and private information, corresponds to an increasing need for methods to detect malicious actions that can undermine our data. As demonstrated in the literature, the signature-based approach provided by antimalware is not able to defend users from new threats. In this paper, we propose an approach based on the adoption of model checking to detect malicious families in the Android environment. We consider two different automata representing Android applications, based respectively on Control Flow Graphs and Call Graphs. The adopted graph data structure allows to detect potentially malicious behaviour and also localize the code where the malicious action happens. We experiment the effectiveness of the proposed method evaluating more than 3000 real-world Android samples (with 2552 malware belonging to 21 malicious family), by reaching an accuracy ranging from 0.97 to 1 in malicious family detection.

scholarly journals Generating Functionally Equivalent Programs Having Non-isomorphic Control-Flow Graphs

2017 ◽  
pp. 265-279 ◽  
Author(s):  
Rémi Géraud ◽  
Mirko Koscina ◽  
Paul Lenczner ◽  
David Naccache ◽  
David Saulpic
Keyword(s):  
Control Flow ◽  
Flow Graphs

A Unified Software Reengineering Approach towards Model Driven Architecture Environment

2011 ◽  
pp. 55-100
Author(s):  
Bing Qiao ◽  
Hongji Yang ◽  
Alan O’Callaghan
Keyword(s):  
Control Flow ◽  
Point Of View ◽  
Software System ◽  
Model Driven Architecture ◽  
Unified Framework ◽  
Software Reengineering ◽  
Model Driven ◽  
Incremental Development ◽  
Flow Graphs ◽  
And Control

When developing a software system, there are a number of principles, paradigms, and tools available to choose from. For a specific platform or programming language, a standard way can usually be found to archive the ultimate system; for example, a combination of an incremental development process, object-oriented analysis and design, and a well supported CASE (Computer-Aided Software Engineering) tool. Regardless of the technology to be adopted, the final outcome of the software development is always a working software system. However, when it comes to software reengineering, there is rather less consensus on either approaches or outcomes. Shall we use black-box or white-box reverse engineering for program understanding? Shall we produce data and control flow graphs, or some kind of formal specifications as the output of analysis? Each of these techniques has its pros and cons of tackling various software reengineering problems, and none of them on its own suffices to a whole reengineering project. A proper integration of various techniques capable of solving a specific issue could be an effective way to unravel a complicated software system. This kind of integration has to be done from an architectural point of view. One of the most exciting outcomes of recent efforts on software architecture is the Object Management Group’s (OMG) Model-Driven Architecture (MDA). MDA provides a unified framework for developing middleware-based modern distributed systems, and also a definite goal for software reengineering. This chapter presents a unified software reengineering methodology based on Model-Driven Architecture, which consists of a framework, a process, and related techniques.

Generating Control Flow Graphs from NATURAL

2017 ◽  
pp. 395-402
Author(s):  
Strauss Cunha Carvalho ◽  
Renê Esteves Maria ◽  
Leonardo Schmitt ◽  
Luiz Alberto Vieira Dias
Keyword(s):  
Control Flow ◽  
Flow Graphs

A SAT-Based Planning Approach for Finding Logical Attacks on Cryptographic Protocols

2020 ◽  
Vol 14 (4) ◽  
pp. 1-21
Author(s):  
Noureddine Aribi ◽  
Yahia Lebbah
Keyword(s):  
Model Checking ◽  
State Of The Art ◽  
Cryptographic Protocols ◽  
Protocol Verification ◽  
Planning Problem ◽  
Multiparty Communication ◽  
Planning Approach ◽  
Security Properties ◽  
Sat Solver ◽  
Security Property

Cryptographic protocols form the backbone of digital society. They are concurrent multiparty communication protocols that use cryptography to achieve security goals such as confidentiality, authenticity, integrity, etc., in the presence of adversaries. Unfortunately, protocol verification still represents a critical task and a major cost to engineer attack-free security protocols. Model checking and SAT-based techniques proved quite effective in this context. This article proposes an efficient automatic model checking approach that exemplifies a security property violation. In this approach, a protocol verification is abstracted as a compact planning problem, which is efficiently solved by a state-of-the-art SAT solver. The experiments performed on some real-world cryptographic protocols succeeded in detecting new logical attacks, violating some security properties. Those attacks encompass both “type flaw” and “replay” attacks, which are difficult to tackle with the existing planning-based approaches.

Sign in / Sign up

Export Citation Format

Share Document