Proof-carrying code is an application of software verification techniques to the problem of ensuring the safety of mobile code. However, previous proof-carrying code systems have assumed that mobile code will faithfully execute the instructions of the program. Realistic implementations of computing systems are susceptible to probabilistic behaviours that can alter the execution of a program in ways that can result in corruption or security breaches. We investigate the use of a probabilistic bytecode language to model deterministic programs that are executed on probabilistic computing systems. To model probabilistic safety properties, a probabilistic logic is adapted to out bytecode instruction language, and soundness is proven. A sketch of ...
AbstractProbabilistic annotations generalise standard Hoare Logic [20] to quantitative properties of...
AbstractRecent approaches to mobile code safety, like proof-carrying code, involve associating safet...
This paper presents a novel approach for augmenting proof-based verification with performance-style ...
Probability, be it inherent or explicitly introduced, has become an important issue in the verificat...
In this paper we consider the verification and certification of computations that are done remotely....
Proof-carrying code is a technique that can be used to execute untrusted code safely. A code consum...
AbstractOut of annotated programs proof carrying code systems construct and prove verification condi...
Probabilistic programs [6] are sequential programs, written in languages like C, Java, Scala, or ML,...
Hoare logic can be used to verify properties of deterministic programs by deriving correctness formu...
We present a general framework for provably safe mobile code. It relies on a formal definition of a ...
AbstractWe present a general framework for provably safe mobile code. It relies on a formal definiti...
Abstract. Proof-carrying code (PCC) allows a code producer to asso-ciate to a program a machine-chec...
Classical software verification focuses on answering the question if the implementation of a piece o...
Probabilistic annotations generalise standard Hoare Logic [20] to quantitative properties of probabi...
Traditional assertions express correctness properties that must hold on every program execution. How...
AbstractProbabilistic annotations generalise standard Hoare Logic [20] to quantitative properties of...
AbstractRecent approaches to mobile code safety, like proof-carrying code, involve associating safet...
This paper presents a novel approach for augmenting proof-based verification with performance-style ...
Probability, be it inherent or explicitly introduced, has become an important issue in the verificat...
In this paper we consider the verification and certification of computations that are done remotely....
Proof-carrying code is a technique that can be used to execute untrusted code safely. A code consum...
AbstractOut of annotated programs proof carrying code systems construct and prove verification condi...
Probabilistic programs [6] are sequential programs, written in languages like C, Java, Scala, or ML,...
Hoare logic can be used to verify properties of deterministic programs by deriving correctness formu...
We present a general framework for provably safe mobile code. It relies on a formal definition of a ...
AbstractWe present a general framework for provably safe mobile code. It relies on a formal definiti...
Abstract. Proof-carrying code (PCC) allows a code producer to asso-ciate to a program a machine-chec...
Classical software verification focuses on answering the question if the implementation of a piece o...
Probabilistic annotations generalise standard Hoare Logic [20] to quantitative properties of probabi...
Traditional assertions express correctness properties that must hold on every program execution. How...
AbstractProbabilistic annotations generalise standard Hoare Logic [20] to quantitative properties of...
AbstractRecent approaches to mobile code safety, like proof-carrying code, involve associating safet...
This paper presents a novel approach for augmenting proof-based verification with performance-style ...