We present a technique for deriving semantic program analyses from a natural semantics specification of the programming language. The technique is based on a particular kind of semantics called pretty-big-step semantics. We present a pretty-big-step semantics of a language with simple objects called O’While and specify a series of instrumentations of the semantics that explicitates the flows of values in a program. This leads to a semantics-based dependency analysis, at the core, e.g., of tainting analysis in software security. The formalization has been realized with the Coq proof assistant.
Natural semantics specifications have become mainstream in the formal specification of programming l...
In 1997, Cousot introduced a hierarchy where semantics are related with each other by abstract inter...
This thesis is about methods for establishing semantic properties of programs and how those methods ...
National audienceWe present a technique for deriving semantic program analyses from a natural semant...
International audienceThis paper describes an investigation into developing certified abstractinterp...
iv The goal of program analysis is to determine automatically properties of the run-time behavior of...
International audienceSkeletal semantics is a framework to describe semantics of programming languag...
AbstractTwo-level semantics is a variant of Scott/Strachey denotational semantics in which the conce...
National audienceThis paper describes a method to define a correct abstract interpretation from a fo...
MasterThis course is devised as an introduction to different techniques used in studying programming...
This paper describes a methodology for defining an executable abstract interpreter from a formal des...
The Structured Program Analysis Refinement Environment (SPARE) [9] is a tool for rapid prototyping o...
Abstract. The goal of this lecture is to show how modern theorem provers—in this case, the Coq proof...
The research summarised here concerns theoretical aspects involved in the implementation of program...
AbstractIn 1997, Cousot introduced a hierarchy where semantics are related with each other by abstra...
Natural semantics specifications have become mainstream in the formal specification of programming l...
In 1997, Cousot introduced a hierarchy where semantics are related with each other by abstract inter...
This thesis is about methods for establishing semantic properties of programs and how those methods ...
National audienceWe present a technique for deriving semantic program analyses from a natural semant...
International audienceThis paper describes an investigation into developing certified abstractinterp...
iv The goal of program analysis is to determine automatically properties of the run-time behavior of...
International audienceSkeletal semantics is a framework to describe semantics of programming languag...
AbstractTwo-level semantics is a variant of Scott/Strachey denotational semantics in which the conce...
National audienceThis paper describes a method to define a correct abstract interpretation from a fo...
MasterThis course is devised as an introduction to different techniques used in studying programming...
This paper describes a methodology for defining an executable abstract interpreter from a formal des...
The Structured Program Analysis Refinement Environment (SPARE) [9] is a tool for rapid prototyping o...
Abstract. The goal of this lecture is to show how modern theorem provers—in this case, the Coq proof...
The research summarised here concerns theoretical aspects involved in the implementation of program...
AbstractIn 1997, Cousot introduced a hierarchy where semantics are related with each other by abstra...
Natural semantics specifications have become mainstream in the formal specification of programming l...
In 1997, Cousot introduced a hierarchy where semantics are related with each other by abstract inter...
This thesis is about methods for establishing semantic properties of programs and how those methods ...