A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Filters
A Formally Verified Compiler Back-end
2009
Journal of automated reasoning
Preserved Fulltext
Other Versions
Such a verified compiler is useful in the context of formal methods applied to the certification of critical software: the verification of the compiler guarantees that the safety properties proved on the ...
This article describes the development and formal verification (proof of semantic preservation) of a compiler back-end from Cminor (a simple imperative intermediate language) to PowerPC assembly code, ...
of a verified validator Validate with an unverified compiler Comp does provide formal guarantees as strong as those provided by a verified compiler. ...
doi:10.1007/s10817-009-9155-4
fatcat:ofhgseu6hfda7fki4cyofq27bi
A formally verified compiler for Lustre
2017
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The second is the verified compilation of an imperative language with encapsulated state to C code where the state is realized by nested records. ...
We describe the specification and verification in an Interactive Theorem Prover of a compilation chain that treats the key aspects of Lustre: sampling, nodes, and delays. ...
We generate a Clight AST that CompCert's formally verified or validated algorithms compile into assembly code. ...
doi:10.1145/3140587.3062358
fatcat:iy4vaorlefcbto7qa6zh7el6ke
A Formally-Verified C Compiler Supporting Floating-Point Arithmetic
2013
2013 IEEE 21st Symposium on Computer Arithmetic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The CompCert formally-verified compiler provides a solution to this problem: this compiler comes with a mathematical specification of the semantics of its source language (a large subset of ISO C90) and ...
As a result, we obtain the first formally verified compiler that provably preserves the semantics of floating-point programs. ...
To build our compiler, we started from CompCert [25] , a formally-verified compiler described in Section III and extended it with FP arithmetic. ...
doi:10.1109/arith.2013.30
dblp:conf/arith/BoldoJLM13
fatcat:enjkv2q5sje6vhkpauim4vgoza
Formalizing and verifying semantic type soundness of a simple compiler
2007
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized assembly language. ...
Inductive instruction : The mutable heap of our machine is a function from naturals to naturals, which we represent using a record type with a single field and an implicit coercion to (nat → nat): Record ...
More recent examples include Leroy's verified compiler for a C-like language [19] . ...
doi:10.1145/1273920.1273922
dblp:conf/ppdp/BentonZ07
fatcat:7cjcwvk3dzafrcnoqrtz7g3ryi
What can you say and what does it mean?
2006
2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
The separation of statement from action enables organizations to set their own policies and therefore control what is authorized in response to a statement. ...
This paper examines some of the criteria for a certificate architecture that supports trusted collaboration. ...
The problem with supporting arbitrary statements are two-fold, (1) What does the statement mean? and (2) What should happen as a result of some statements? ...
doi:10.1109/colcom.2006.361889
dblp:conf/colcom/Solworth06
fatcat:ua73ajzf4zc6nlosatlvioqcw4
What Does it Mean that PRIMES is in P?
2009
Social Studies of Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It is true that prime numbers play a 'crucial role in cryptography', but the article does not state what role. ...
and what it includes. ...
doi:10.1177/0306312708101131
fatcat:p46ixfcfpfb6dntyun7ypjpwj4
Plotting in a Formally Verified Way
2021
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2021 pre-print arXiv:2108.03974v1 fatcat:dkolllvv5zf5bjz3h7qfkoma74
This paper investigates what it means for a plot to be correct and how to formally verify this property. ...
The Coq proof assistant is then turned into a tool for plotting function graphs using reliable polynomial approximations. This feature is provided as part of the CoqInterval library. ...
Formal Specification The very first step is to state what it means for a plot to be correct. We have some function f from real numbers to real numbers. ...
doi:10.4204/eptcs.338.6
fatcat:bqejx6ey6nafhpdwce565472na
TRX: A Formally Verified Parser Interpreter
2011
Logical Methods in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
From this formalization we can extract a parser for an arbitrary PEG grammar with the warranty of total correctness, i.e., the resulting parser is terminating and correct with respect to its grammar and ...
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. ...
And yet there does seem to be hardly any work on formally verified parsing. ...
doi:10.2168/lmcs-7(2:18)2011
fatcat:vb5h7eqflfha5ilepdsrabreb4
TRX: A Formally Verified Parser Interpreter
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
From this formalization we can extract a parser for an arbitrary PEG grammar with the warranty of total correctness, i.e., the resulting parser is terminating and correct with respect to its grammar and ...
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. ...
And yet there does seem to be hardly any work on formally verified parsing. ...
doi:10.1007/978-3-642-11957-6_19
fatcat:arxejkwpafgwhjy3e7ktzyicwa
A Formally-Verified C Static Analyzer
2015
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
A. Fouilhé, S. Boulmé, D. Monniaux and M. Périn developed the VPL library and the verified validator mentioned in section 6.3. J. Feret and A. ...
Moreover, Verasco is connected to the CompCert C formally-verified compiler [26] , ensuring that the safety guarantees established by Verasco carry over to the compiled code. ...
P , does not go wrong, and if it terminates, it does so on a state satisfying Q. ...
doi:10.1145/2775051.2676966
fatcat:dfk4ah6ugbd3pl5lvsc65mbcwq
A Formally-Verified C Static Analyzer
2015
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
A. Fouilhé, S. Boulmé, D. Monniaux and M. Périn developed the VPL library and the verified validator mentioned in section 6.3. J. Feret and A. ...
Moreover, Verasco is connected to the CompCert C formally-verified compiler [26] , ensuring that the safety guarantees established by Verasco carry over to the compiled code. ...
P , does not go wrong, and if it terminates, it does so on a state satisfying Q. ...
doi:10.1145/2676726.2676966
dblp:conf/popl/JourdanLBLP15
fatcat:u7iu24f475avtac2apq25jq7uq
Formalizing and Verifying a Modern Build Language
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
This paper formally and mechanically verifies the correctness of central CLOUDMAKE algorithms. ...
compilers, linkers, and other tools. ...
Other work of formally verifying the correctness of compiler optimizations was done by Lerner et al. [8] . ...
doi:10.1007/978-3-319-06410-9_43
fatcat:3i54ualkovcanmx4q2vk2s6trm
WhyMP, a formally verified arbitrary-precision integer library
2020
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a C library that has been formally verified using the Why3 verification platform in about four person-years. ...
It has been performed using a mixture of mechanically checked handwritten proofs and automated theorem proving. ...
This does not mean that GMP is now formally verified, although our work increases further the (already high) confidence in its correctness. ...
doi:10.1145/3373207.3404029
dblp:conf/issac/MelquiondR20
fatcat:k75jtpvcpreedamhvd2ni6josq
A Formally Verified Calculus for Full Java Card
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
The calculus is formally proved correct with respect to a natural semantics. It is implemented in the KIV system and used for smart card applications. ...
We present a calculus for the verification of sequential Java programs. It supports all Java language constructs and has additional support for Java Card. ...
However, that may depend on the problem domain, i.e. what kind of Java programs are verified. ...
doi:10.1007/978-3-540-27815-3_37
fatcat:nxq4unamavgatkbxz4ag5ez3pq
A Road to a Formally Verified General-Purpose Operating System
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
The contribution of this paper is the shift of focus from attempts to use a single "silver-bullet" formal verification method which would be able to verify everything to a combination of multiple formalisms ...
However, in reality only a small subset of the existing operating systems were ever formally verified, despite the fact that an operating system is a critical part of almost any other software system. ...
Although this level of abstraction is coarse-grained and conservative, it can be called semi-formal, since the properties which are being verified can be actually defined quite exactly and they are reasonably ...
doi:10.1007/978-3-642-13556-9_5
fatcat:epv2bt5rlbdz7f3dcmmk5aoluq
« Previous
Showing results 1 — 15 out of 51,641 results