Frama-C

Cuoq, Pascal; Kirchner, Florent; Kosmatov, Nikolaï; Prévosto, Virgile; Signoles, Julien; Yakobowski, Boris

doi:10.1007/978-3-642-33826-7_16

Cited by 249 publications

(59 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our development uses Frama-C [21] and the ANSI C Specification Language (ACSL) [7] but other tools like VeriFast [39] would be viable alternatives.…”

Section: Problemsmentioning

confidence: 99%

LMS-Verify: abstraction without regret for verified systems programming

Amin

Rompf

2017

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages

View full text Add to dashboard Cite

Performance critical software is almost always developed in C, as programmers do not trust high-level languages to deliver the same reliable performance. This is bad because low-level code in unsafe languages attracts security vulnerabilities and because development is far less productive, with PL advances mostly lost on programmers operating under tight performance constraints. Highlevel languages provide memory safety out of the box, but they are deemed too slow and unpredictable for serious system software.Recent years have seen a surge in staging and generative programming: the key idea is to use high-level languages and their abstraction power as glorified macro systems to compose code fragments in first-order, potentially domain-specific, intermediate languages, from which fast C can be emitted. But what about security? Since the end result is still C code, the safety guarantees of the high-level host language are lost.In this paper, we extend this generative approach to emit ACSL specifications along with C code. We demonstrate that staging achieves "abstraction without regret" for verification: we show how high-level programming models, in particular higher-order composable contracts from dynamic languages, can be used at generation time to compose and generate first-order specifications that can be statically checked by existing tools. We also show how type classes can automatically attach invariants to data types, reducing the need for repetitive manual annotations.We evaluate our system on several case studies that varyingly exercise verification of memory safety, overflow safety, and functional correctness. We feature an HTTP parser that is (1) fast (2) high-level: implemented using staged parser combinators (3) secure: with verified memory safety. This result is significant, as input parsing is a key attack vector, and vulnerabilities related to HTTP parsing have been documented in all widely-used web servers.

show abstract

“…Our development uses Frama-C [21] and the ANSI C Specification Language (ACSL) [7] but other tools like VeriFast [39] would be viable alternatives.…”

Section: Problemsmentioning

confidence: 99%

LMS-Verify: abstraction without regret for verified systems programming

Amin

Rompf

2017

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages

View full text Add to dashboard Cite

show abstract

“…It evaluates on basis of syntactical correctness, logical correctness through unit testing (white box testing), style (metrics), efficiency (time and space complexity) and similarity to standard program (SDG and RASCAL).Unit Testing of programs is performed with the help of CUnit [40], CppUnit (MingW) [41] and JUnit [42]. System dependence graph [35] is generated using Frama-c [43]and SDG Library [44].…”

Section: Review Of Related Workmentioning

confidence: 99%

Multiagent System for Management and Evaluation of Examinations

Mittal¹

2017

ijarcs

View full text Add to dashboard Cite

Several efforts have been made to computerize Examination System. Agents are autonomous software components capable of making decision on behalf of other entities to realize desired goals. A Multiagent System is a collection of agents that cooperate to solve a problem. In this paper, a Multiagent System is designed, implemented and tested for Management and Evaluation of Examination (MASMEE). Examination can be subjective, objective or practical based on programming languages. The functions of paper setting, evaluation of answers' and result compilation are performed by intelligent agents. MASMEE mainly consists of two agents: Examiner Agent (EA) and Student Agent (SA). EA sets the paper, evaluates the submitted answers and compiles the results. The SA enables the students' to take the examination by providing question paper and collecting the answers.The paper setting is performed using a database of questions. A web based interface is developed for conduct of examination. The evaluation of subjective and objective examinations is performedbased on techniquesof information retrieval and Ontology.Practical evaluation is done using 4-stage framework, evaluating on the basis of compilation, functional testing, metrics, efficiencyand similarity of programs to standard program. The MASMEE system is implemented using Java andJava Agent Development Environment (JADE).Testing is performed by conducting tests with post-graduate students. The scores generated by MASMEE are compared with scores assigned by human examiner using correlation and are found to be satisfactory. It is concluded that MASMEE system can help to reduce the effort of human examiner.

show abstract

“…1 Second, one proves the VCs using a theorem prover. This approach is common to SPARK Ada [5], Frama-C [13], and Why [20], and we adopt it too. We therefore need to ask whether some of the available theorem provers can automatically prove the VCs obtained for our example verification problem.…”

Section: Related Workmentioning

confidence: 99%

Polynomial function intervals for floating-point software verification

Duracz

Konečný

2014

Ann Math Artif Intell

View full text Add to dashboard Cite

The focus of our work is the verification of tight functional properties of numerical programs, such as showing that a floating-point implementation of Riemann integration computes a close approximation of the exact integral. Programmers and engineers writing such programs will benefit from verification tools that support an expressive specification language and that are highly automated. Our work provides a new method for verification of numerical software, supporting a substantially more expressive language for specifications than other publicly available automated tools.The additional expressivity in the specification language is provided by two constructs. First, the specification can feature inclusions between interval arithmetic expressions. Second, the integral operator from classical analysis can be used in the specifications, where the integration bounds can be arbitrary expressions over real variables. To support our claim of expressivity, we outline the verification of four example programs, including the integration example mentioned earlier.A key component of our method is an algorithm for proving numerical theorems. This algorithm is based on automatic polynomial approximation of non-linear real and real-interval functions defined by expressions. The PolyPaver tool is our implementation of the algorithm and its source code is publicly available. In this paper we report on experiments using PolyPaver that indicate that the additional expressivity does not come at a performance cost when comparing with other publicly available state-of-the-art provers. We also include a scalability study that explores the limits of PolyPaver in proving tight functional specifications of progressively larger randomly generated programs.

show abstract

Frama-C

Cited by 249 publications

References 33 publications

LMS-Verify: abstraction without regret for verified systems programming

LMS-Verify: abstraction without regret for verified systems programming

Multiagent System for Management and Evaluation of Examinations

Polynomial function intervals for floating-point software verification

Contact Info

Product

Resources

About