History of Abstract Interpretation

Giacobazzi, Roberto; Ranzato, Francesco

doi:10.1109/mahc.2021.3133136

Cited by 15 publications

(2 citation statements)

References 63 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It provides a framework for analyzing programs or systems by approximating their behaviors using abstract representations [101][102][103]. These abstract representations capture essential properties of the system while disregarding irrelevant details, enabling scalable analysis and aiding in the identification of security vulnerabilities [104][105][106].…”

Section: Abstract Interpretationmentioning

confidence: 99%

Formal Methods and Validation Techniques for Ensuring Automotive Systems Security

Krichen

2023

Information

View full text Add to dashboard Cite

The increasing complexity and connectivity of automotive systems have raised concerns about their vulnerability to security breaches. As a result, the integration of formal methods and validation techniques has become crucial in ensuring the security of automotive systems. This survey research paper aims to provide a comprehensive overview of the current state-of-the-art formal methods and validation techniques employed in the automotive industry for system security. The paper begins by discussing the challenges associated with automotive system security and the potential consequences of security breaches. Then, it explores various formal methods, such as model checking, theorem proving, and abstract interpretation, which have been widely used to analyze and verify the security properties of automotive systems. Additionally, the survey highlights the validation techniques employed to ensure the effectiveness of security measures, including penetration testing, fault injection, and fuzz testing. Furthermore, the paper examines the integration of formal methods and validation techniques within the automotive development lifecycle, including requirements engineering, design, implementation, and testing phases. It discusses the benefits and limitations of these approaches, considering factors such as scalability, efficiency, and applicability to real-world automotive systems. Through an extensive review of relevant literature and case studies, this survey provides insights into the current research trends, challenges, and open research questions in the field of formal methods and validation techniques for automotive system security. The findings of this survey can serve as a valuable resource for researchers, practitioners, and policymakers involved in the design, development, and evaluation of secure automotive systems.

show abstract

Section: Abstract Interpretationmentioning

confidence: 99%

Formal Methods and Validation Techniques for Ensuring Automotive Systems Security

Krichen

2023

Information

View full text Add to dashboard Cite

show abstract

“…The technique of Abstract Interpretation [10] allows constructing sound program analysis tools which can extract properties of a program by safely approximating its semantics. Abstract interpretation proved practical and effective in the context of (Constraint) Logic Programming ((C)LP) [17,24,25,31,32,39,40], which was one of its first application areas [18], and the techniques developed in this context have also been applied to the analysis and verification of other programming languages by using semantic translation into (Constraint) Horn Clauses (CHCs) [13,19,27]. Frameworks for abstract interpretation (such as PLAI/CiaoPP [20] or Astrée [12]) provide efficient implementations of algorithms for computing abstract fixpoints as well as several abstract domains, which approximate different program properties.…”

Section: Introductionmentioning

confidence: 99%

Untitled

2023

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

interpretation allows constructing sound static analysis tools by safely approximating program semantics. Frameworks for abstract interpretation typically provide an implementation of a specialized iteration strategy to compute an abstract fixpoint, as well as a number of abstract domains in order to approximate different program properties. However, the design and implementation of additional domains, as well as their combinations, is eventually necessary to successfully prove arbitrary program properties. We propose a rule-based methodology for rapid design and prototyping of new domains and combining existing ones, with a focus on the analysis of logic programs. We provide several examples for domains combining numerical properties and data types and apply them to proving complex program properties.

show abstract