Changes publications subsections titles

c124e368 · Allan Blanchard · 8bf901ef · c124e368 · c124e368 · c124e368
Commit c124e368 authored 4 years ago by Allan Blanchard
--- a/_fc-publications/aorai/founding/2009-afadl-gs.md
+++ b/_fc-publications/aorai/founding/2009-afadl-gs.md
@@ -5,7 +5,7 @@ title: "Vérification de propriétés LTL sur des programmes C par génération
 book: "Proceedings of Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL)"
 link: http://hal.archives-ouvertes.fr/inria-00568947
 year: 2009
-category: founding
+category: foundational
 short: "In French."
 ---


--- a/_fc-publications/c2s/founding/2016-scam-bkll.md
+++ b/_fc-publications/c2s/founding/2016-scam-bkll.md
@@ -5,7 +5,7 @@ title: "Conc2Seq: A Frama-C Plugin for Verification of Parallel Compositions of
 book: "16th International Working Conference on Source Code Analysis and Manipulation (SCAM)"
 link: https://hal.archives-ouvertes.fr/hal-01423641/en
 year: 2016
-category: founding
+category: foundational
 ---

 Frama-C is an extensible modular framework for analysis of C programs that offers different analyzers in the form of collaborating plugins. Currently, Frama-C does not support the proof of functional properties of concurrent code. We present Conc2Seq, a new code transformation based tool realized as a Frama-C plugin and dedicated to the verification of concurrent C programs. Assuming the program under verification respects an interleaving semantics, Conc2Seq transforms the original concurrent C program into a sequential one in which concurrency is simulated by interleavings. User specifications are automatically reintegrated into the new code without manual intervention. The goal of the proposed code transformation technique is to allow the user to reason about a concurrent program through the interleaving semantics using existing Frama-C analyzers. 
\ No newline at end of file
--- a/_fc-publications/c2s/founding/2017-vpt-blk.md
+++ b/_fc-publications/c2s/founding/2017-vpt-blk.md
@@ -5,7 +5,7 @@ title: "From Concurrent Programs to Simulating Sequential Programs: Correctness
 book: "Fifth International Workshop on Verification and Program Transformation (VPT)"
 link: https://hal.archives-ouvertes.fr/hal-01495454/en
 year: 2017
-category: founding
+category: foundational
 ---

 Frama-C is a software analysis framework that provides a common infrastructure and a common behavioral specification language to plugins that implement various static and dynamic analyses of C programs. Most plugins do not support concurrency. We have proposed conc2seq, a Frama-C plugin based on program transformation, capable to leverage the existing huge code base of plugins and to handle concurrent C programs. In this paper we formalize and sketch the proof of correctness of the program transformation principle behind conc2seq, and present an effort towards the full mechanization of both the for- malization and proofs with the proof assistant Coq. 
\ No newline at end of file
--- a/_fc-publications/cfp/founding/2017-lopstr-as.md
+++ b/_fc-publications/cfp/founding/2017-lopstr-as.md
@@ -5,7 +5,7 @@ title: "Context Generation from Formal Specifications for C Analysis Tools"
 book: "Logic-based Program Synthesis and Transformation (LOPSTR)"
 link: http://julien.signoles.free.fr/publis/2017_lopstr.pdf
 year: 2017
-category: founding
+category: foundational
 short: "Best paper award."
 ---


--- a/_fc-publications/cost/founding/2012-fmics-amarg.md
+++ b/_fc-publications/cost/founding/2012-fmics-amarg.md
@@ -5,7 +5,7 @@ title: "Certifying and reasoning on cost annotations in C programs"
 book: "Proceedings of the 17th International Workshop on Formal Methods for Industrial Critical Systems (FMICS)"
 link: http://hal.inria.fr/hal-00702665/en
 year: 2012
-category: founding
+category: foundational
 ---

 We present a so-called labelling method to enrich a compiler in order to turn it into a "cost annotating compiler", that is, a compiler which can lift pieces of information on the execution cost of the object code as cost annotations on the source code. These cost annotations characterize the execution costs of code fragments of constant complexity. The first contribution of this paper is a proof methodology that extends standard simulation proofs of compiler correctness to ensure that the cost annotations on the source code are sound and precise with respect to an execution cost model of the object code. As a second contribution, we demonstrate that our label-based instrumentation is scalable because it consists in a modular extension of the compilation chain. To that end, we report our successful experience in implementing and testing the labelling approach on top of a prototype compiler written in OCaml for (a large fragment of) the C language. As a third and last contribution, we provide evidence for the usability of the generated cost annotations as a mean to reason on the concrete complexity of programs written in C. For this purpose, we present a Frama-C plugin that uses our cost annotating compiler to automatically infer trustworthy logic assertions about the concrete worst case execution cost of programs written in a fragment of the C language. These logic assertions are synthetic in the sense that they characterize the cost of executing the entire program, not only constant-time fragments. (These bounds may depend on the size of the input data.) We report our experimentations on some C programs, especially programs generated by a compiler for the synchronous programming language Lustre used in critical embedded software. 
\ No newline at end of file
--- a/_fc-publications/e-acsl/founding/2013-sac-dks.md
+++ b/_fc-publications/e-acsl/founding/2013-sac-dks.md
@@ -5,7 +5,7 @@ title: "Common Specification Language for Static and Dynamic Analysis of C Progr
 book: "Proceedings of Symposium on Applied Computing (SAC)"
 link: https://hal.inria.fr/hal-00853721/en
 year: 2013
-category: founding
+category: foundational
 short: "An overview of the specification language."
 ---


--- a/_fc-publications/e-acsl/founding/2017-ismm-vsk.md
+++ b/_fc-publications/e-acsl/founding/2017-ismm-vsk.md
@@ -5,7 +5,7 @@ title: "Shadow state encoding for efficient monitoring of block-level properties
 book: "International Symposium on Memory Management (ISMM)"
 link: http://julien.signoles.free.fr/publis/2017_ismm.pdf
 year: 2017
-category: founding
+category: foundational
 short: "Presentation of the shadow memory technique used by E-ACSL to monitor memory properties."
 ---


--- a/_fc-publications/e-acsl/founding/2017-rvcubes-skv.md
+++ b/_fc-publications/e-acsl/founding/2017-rvcubes-skv.md
@@ -5,7 +5,7 @@ title: "E-ACSL, a Runtime Verification Tool for Safety and Security of C Program
 book: "International Workshop on Competitions, Usability, Benchmarks, Evaluation, and Standardisation for Runtime Verification Tools (RV-CuBES)"
 link: http://julien.signoles.free.fr/publis/2017_rvcubes_tool.pdf
 year: 2017
-category: founding
+category: foundational
 short: "An overview of the E-ACSL plug-in."
 ---


--- a/_fc-publications/e-acsl/founding/2020-rv-kms.md
+++ b/_fc-publications/e-acsl/founding/2020-rv-kms.md
@@ -5,7 +5,7 @@ title: "Efficient Runtime Assertion Checking for Properties over Mathematical Nu
 book: "International Conference on Runtime Verification (RV)"
 link: http://julien.signoles.free.fr/publis/2020_rv.pdf
 year: 2020
-category: founding
+category: foundational
 ---

 Runtime assertion checking is the discipline of detecting at

--- a/_fc-publications/eva/founding/2011-jfla-bc.md
+++ b/_fc-publications/eva/founding/2011-jfla-bc.md
@@ -5,7 +5,7 @@ title: "A Mergeable Interval Map"
 book: "Journées Francophones des Langages Applicatifs (JFLA)"
 link: "https://pdfs.semanticscholar.org/5972/1d7cac5cf4fdc0cc3947432c6472f1da0f82.pdf"
 year: 2011
-category: founding
+category: foundational
 ---

 This article describes an efficient persistent mergeable data structure for mapping intervals to values. We call this data structure rangemap. We provide an example of application where the need for such a data structure arises (abstract interpretation of programs with pointer casts). We detail different solutions we have considered and dismissed before reaching the solution of rangemaps. We show how they solve the initial problem and eventually describe their implementation. 
\ No newline at end of file
--- a/_fc-publications/eva/founding/2019-vmcai-bby.md
+++ b/_fc-publications/eva/founding/2019-vmcai-bby.md
@@ -5,7 +5,7 @@ title: "Structuring Abstract Interpreters Through State and Value Abstractions"
 book: "Verification, Model Checking, and Abstract Interpretation (VMCAI)"
 link: https://hal-cea.archives-ouvertes.fr/cea-01808886/en
 year: 2019
-category: founding
+category: foundational
 short: "Formalization of the communication mechanism between abstractions in EVA."
 ---


--- a/_fc-publications/fanc/founding/2012-erts-cddml.md
+++ b/_fc-publications/fanc/founding/2012-erts-cddml.md
@@ -5,7 +5,7 @@ title: "Fan-C, a Frama-C plug-in for data flow verification"
 book: "Proceedings of Embedded Real Time Software and Systems (ERTS²)"
 link: https://hal.archives-ouvertes.fr/hal-02263407/en
 year: 2012
-category: founding
+category: foundational
 ---

 DO-178B compliant avionics development processes must both define the data and control flows of embedded software at design level, and verify flows are faithfully implemented in the source code. This verification is traditionally performed during dedicated code reviews, but such intellectual activities are costly and error-prone, especially for large and complex software. In this paper, we present the Fan-C plug-in, developed by Airbus on top of the abstract-interpretation-based value and dataflow analyses of the Frama-C platform, in order to automate this verification activity for C avionics software. We therefore describe the Airbus context, the Frama-C platform, its value analysis and related plug-ins, the Fan-C plug-in, and discuss analysis results and ongoing industrial deployment and qualification activities.
\ No newline at end of file
--- a/_fc-publications/general/founding/2012-sefm-ckkpsy.md
+++ b/_fc-publications/general/founding/2012-sefm-ckkpsy.md
@@ -4,7 +4,7 @@ authors: "Pascal Cuoq, Florent Kirchner, Nikolai Kosmatov, Virgile Prevosto, Jul
 title: "Frama-C, A Software Analysis Perspective"
 book: "Proceedings of International Conference on Software Engineering and Formal Methods 2012 (SEFM)"
 year: 2012
-category: founding
+category: foundational
 short: "This paper presents a synthetic view of Frama-C, its main and composite analyses, and some of its industrial achievements."
 ---


--- a/_fc-publications/general/founding/2015-fac-kkpsy.md
+++ b/_fc-publications/general/founding/2015-fac-kkpsy.md
@@ -5,7 +5,7 @@ title: "Frama-C, A Software Analysis Perspective"
 book: "Formal Aspects of Computing, vol. 27 issue 3"
 link: "http://dx.doi.org/10.1007/s00165-014-0326-7"
 year: 2015
-category: founding
+category: foundational
 ---

 Frama-C is a source code analysis platform that aims at conducting verification of industrial-size C programs. It provides its users with a collection of plug-ins that perform static analysis, deductive verification, and testing, for safety- and security-critical software. Collaborative verification across cooperating plug-ins is enabled by their integration on top of a shared kernel and datastructures, and their compliance to a common specification language. This foundational article presents a consolidated view of the platform, its main and composite analyses, and some of its industrial achievements.
\ No newline at end of file
--- a/_fc-publications/jessie/founding/2007-ccv-m.md
+++ b/_fc-publications/jessie/founding/2007-ccv-m.md
@@ -5,7 +5,7 @@ title: "Union and Cast in Deductive Verification"
 book: "Proceedings of the C/C++ Verification Workshop (CCV)"
 link: https://pdfs.semanticscholar.org/1fce/15dc2c6e8a42c5da1dd7e56fdb224f1e9ed1.pdf
 year: 2007
-category: founding
+category: foundational
 ---

 Deductive verification based on weakest-precondition calculus has

--- a/_fc-publications/jessie/founding/2007-hav-hm.md
+++ b/_fc-publications/jessie/founding/2007-hav-hm.md
@@ -5,6 +5,6 @@ title: "Separation analysis for deductive verification"
 book: "Proceedings of Heap Analysis and Verification (HAV)"
 link: http://www.lri.fr/~marche/hubert07hav.pdf
 year: 2007
-category: founding
+category: foundational
 ---

--- a/_fc-publications/jessie/founding/2007-hav-mm.md
+++ b/_fc-publications/jessie/founding/2007-hav-mm.md
@@ -5,7 +5,7 @@ title: "Inferring local (non-)aliasing and strings for memory safety"
 book: "Proceedings of Heap Analysis and Verification (HAV)"
 link: https://www.researchgate.net/publication/250763933_Inferring_Local_NonAliasing_and_Strings_for_Memory_Safety_1
 year: 2007
-category: founding
+category: foundational
 ---

 We propose an original approach for checking memory safety of C

--- a/_fc-publications/jessie/founding/2007-inria-m.md
+++ b/_fc-publications/jessie/founding/2007-inria-m.md
@@ -5,7 +5,7 @@ title: "Checking C Pointer Programs for Memory Safety"
 book: "INRIA Research Report n°6334"
 link: https://hal.inria.fr/inria-00181950/en
 year: 2007
-category: founding
+category: foundational
 ---

 We propose an original approach for checking memory safety of C

--- a/_fc-publications/jessie/founding/2008-vmcai-m.md
+++ b/_fc-publications/jessie/founding/2008-vmcai-m.md
@@ -5,7 +5,7 @@ title: "Sufficient Preconditions for Modular Assertion Checking"
 book: "Proceedings of the 9th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI)"
 link: https://link.springer.com/chapter/10.1007/978-3-540-78163-9_18
 year: 2008
-category: founding
+category: foundational
 ---

 Assertion checking is the restriction of program verification to

--- a/_fc-publications/jessie/founding/2009-inria-a.md
+++ b/_fc-publications/jessie/founding/2009-inria-a.md
@@ -5,7 +5,7 @@ title: "On formal methods for certifying floating-point C programs"
 book: "Research Report RR-6927, INRIA"
 link: http://hal.inria.fr/inria-00383793/en/
 year: 2009
-category: founding
+category: foundational
 ---

 This paper presents an implementation of an extension of the ACSL specication language in the Frama-C tool in order to prove the correctness of floating-point C programs. A first model checks that there is no over flow, i.e., proof obligations are generated by the Why tool to prove that the result of a fl oating-point operation is not greater than the maximal fl oat allowed in the given type, this model is called the Strict model. A second model, called the Full model, extends the Strict model. The Full model allows over flows and deals with special values: signed infinities, NaNs (Not-a-Number) and signed zeros as in the IEEE-754 Standard. The verification conditions generated by Why are (partially) proved by automatic theorem provers: Alt-Ergo, Simplify, Yices, Z3, CVC3 and Gappa or discharged in the interactive proof assistant Coq using two existing Coq formalization of fl oating-point arithmetic. When the Why proof obligations are written in the syntax of the Gappa library, we can use the gappa and interval tactics to achieve the proof. Several examples of fl oating-point C programs are presented in the paper to prove the efficiency of this implementation. 
\ No newline at end of file