Today’s software systems often use many different computation features and span different abstraction levels (e.g., user code and runtime-system code). To build foundational certified systems, it is hard to have a single verification system supporting all computation features. In this paper we present an open framework for foundational proof-carrying code (FPCC). It allows program modules to be specified and certified separately using different type systems or program logics. Certified modules (i.e., code and proof) can be linked together to build fully certified systems. The framework supports modular verification and proof reuse. It is also expressive enough so that invariants established in specific verification systems are preserved eve...
This paper presents a logical framework derived from the Edinburgh Logical Framework (LF) [5] that c...
I present Pyrosome1 , a generic framework for the verification of extensible, compositional compiler...
The foundational goal of this work is the development of mechanizable proof rules and a verification...
Abstract. Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of ma...
We present the Open Verifier approach for verifying untrusted code using customized verifiers. This ...
We present the Open Verifier approach for verifying untrusted code using customized verifiers. This ...
I report on an experience using the Coq proof assistant to develop a program verification tool with ...
Proof-Carrying Code (PCC) is a general framework for the mechanical verification of safety propertie...
We present a program verification framework based on coinduction, which makes it feasible to verif...
International audienceFor all the successes in verifying low-level, efficient, security-critical cod...
Abstract We introduce a generic framework for proof carrying code, developed and mechanically verifi...
The Foundational Proof Certificate (FPC) approach to proof evidence offers a flexible framework for ...
Proof checkers for proof-carrying code (and similar) systems can suer from two problems: huge proof ...
Abstract. A certified program analysis is an analysis whose implementation is accompanied by a check...
Previous work on rewriting and reachability logic establishes a vision for a language-agnostic progr...
This paper presents a logical framework derived from the Edinburgh Logical Framework (LF) [5] that c...
I present Pyrosome1 , a generic framework for the verification of extensible, compositional compiler...
The foundational goal of this work is the development of mechanizable proof rules and a verification...
Abstract. Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of ma...
We present the Open Verifier approach for verifying untrusted code using customized verifiers. This ...
We present the Open Verifier approach for verifying untrusted code using customized verifiers. This ...
I report on an experience using the Coq proof assistant to develop a program verification tool with ...
Proof-Carrying Code (PCC) is a general framework for the mechanical verification of safety propertie...
We present a program verification framework based on coinduction, which makes it feasible to verif...
International audienceFor all the successes in verifying low-level, efficient, security-critical cod...
Abstract We introduce a generic framework for proof carrying code, developed and mechanically verifi...
The Foundational Proof Certificate (FPC) approach to proof evidence offers a flexible framework for ...
Proof checkers for proof-carrying code (and similar) systems can suer from two problems: huge proof ...
Abstract. A certified program analysis is an analysis whose implementation is accompanied by a check...
Previous work on rewriting and reachability logic establishes a vision for a language-agnostic progr...
This paper presents a logical framework derived from the Edinburgh Logical Framework (LF) [5] that c...
I present Pyrosome1 , a generic framework for the verification of extensible, compositional compiler...
The foundational goal of this work is the development of mechanizable proof rules and a verification...