Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Get rid of inline assembly through verification-oriented lifting (1903.06407v2)

Published 15 Mar 2019 in cs.PL

Abstract: Formal methods for software development have made great strides in the last two decades, to the point that their application in safety-critical embedded software is an undeniable success. Their extension to non-critical software is one of the notable forthcoming challenges. For example, C programmers regularly use inline assembly for low-level optimizations and system primitives. This usually results in driving state-of-the-art formal analyzers developed for C ineffective. We thus propose TInA, an automated, generic, trustable and verification-oriented lifting technique turning inline assembly into semantically equivalent C code, in order to take advantage of existing C analyzers. Extensive experiments on real-world C code with inline assembly (including GMP and ffmpeg) show the feasibility and benefits of TInA.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Frédéric Recoules (3 papers)
  2. Sébastien Bardin (24 papers)
  3. Richard Bonichon (7 papers)
  4. Laurent Mounier (7 papers)
  5. Marie-Laure Potet (11 papers)
Citations (24)

Summary

We haven't generated a summary for this paper yet.