Results 1  10
of
152
Separation logic for smallstep Cminor
 IN: THEOREM PROVING IN HIGHER ORDER LOGICS, 20TH INT. CONF. TPHOLS 2007
, 2007
"... ..."
7 Separation Logic for Smallstep Cminor
"... Abstract. Cminor is a midlevel imperative programming language; there are provedcorrect optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor so that it is suitable for Hoare Logic reasoning and we have designed a Separation Logic for Cminor. In this ..."
Abstract
 Add to MetaCart
Separation Logic w.r.t. a smallstep semantics. The work presented in this paper has been carried out in the Coq proof assistant. It is a first step towards an environment in which concurrent Cminor programs can be verified using Separation Logic and also compiled by a provedcorrect compiler with formal end
Separation logic for smallstep C minor
 IN 20TH INTERNATIONAL CONFERENCE ON THEOREM PROVING IN HIGHERORDER LOGICS (TPHOLS
, 2007
"... C minor is a midlevel imperative programming language (just below C), and there exist provedcorrect optimizing compilers from C to C minor and from C minor to machine language. We have redesigned C minor so that it is suitable for Hoarelogic reasoning, we have designed a Separation Logic for C ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
minor, we have given a smallstep operational semantics so that extensions to concurrent C minor will be possible, and we have a machinechecked proof of soundness of our Separation Logic. This is the first largescale machinechecked proof of a Hoare logic w.r.t. a smallstep semantics. Our sequential
Practical tactics for separation logic
 In TPHOLs, volume 5674 of LNCS
, 2009
"... Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctness properties of complex pointerintensive programs. Our goal is to make separation logic as easy to use as the standard ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctness properties of complex pointerintensive programs. Our goal is to make separation logic as easy to use as the standard
Behavioral theories and the neurophysiology of reward,
 Annu. Rev. Psychol.
, 2006
"... ■ Abstract The functions of rewards are based primarily on their effects on behavior and are less directly governed by the physics and chemistry of input events as in sensory systems. Therefore, the investigation of neural mechanisms underlying reward functions requires behavioral theories that can ..."
Abstract

Cited by 187 (0 self)
 Add to MetaCart
. Indeed, these theories can very well define the different functions of rewards on behavior. It is then a small step on firm ground to base the investigation of neural mechanisms underlying the different reward functions onto the phenomena characterized by these theories. Although each theory has its own
Oracle Semantics for Concurrent Separation Logic (preliminary version) Abstract
"... We define in Coq with machinechecked proofs a modular operational semantics for Concurrent C minor, a language with shared memory, spawnable threads, and firstclass locks. By modular we mean that one can reason about sequential control and dataflow knowing almost nothing about concurrency, and one ..."
Abstract
 Add to MetaCart
, it should be straightforward to generalize Leroy’s proof of Cminor compiler correctness to the concurrent case without becoming entangled in issues of concurrency. Thus we will obtain endtoend proofs: the properties you prove in Concurrent Separation Logic will be true of the program that actually
Separation Logic for Nonlocal Control Flow and Block Scope Variables
"... Abstract. We present an approach for handling nonlocal control flow (goto and return statements) in the presence of allocation and deallocation of block scope variables in imperative programming languages. We define a small step operational semantics and an axiomatic semantics (in the form of a sep ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
separation logic) for a small Clike language that combines these two features, and which also supports pointers to block scope variables. Our operational semantics represents the program state through a generalization of Huet’s zipper data structure. We prove soundness of our axiomatic semantics
A Concurrent Logical Framework: The Propositional Fragment
, 2003
"... We present the propositional fragment CLF0 of the Concurrent Logical Framework (CLF). CLF extends the Linear Logical Framework to allow the natural representation of concurrent computations in an object language. The underlying type theory uses monadic types to segregate values from computations ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
computations. This separation leads to a tractable notion of definitional equality that identifies computations di#ering only in the order of execution of independent steps. From a logical point of view our type theory can be seen as a novel combination of lax logic and dual intuitionistic linear logic
SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in a Separation Logic Solver
 In Proc. TACAS’06, volume 3920 of LNCS
, 2006
"... Existing difference logic (DL) solvers can be broadly classified as eager or lazy, each with its own merits and demerits. We propose a novel difference logic solver SDSAT that combines the strengths of both these approaches and provides a robust performance over a wide set of benchmarks. The solver ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
improvement in performance and smaller ranges for variables. Furthermore, the difference logic formula is not transformed into an equisatisfiable Boolean formula in a single step, but rather done lazily in the following phase. In the solve phase, SDSAT uses a lazy refinement approach to search for a
Software Bug Localization with Markov Logic
"... Software bug localization is the problem of determining buggy statements in a software system. It is a crucial and expensive step in the software debugging process. Interest in it has grown rapidly in recent years, and many approaches have been proposed. However, existing approaches tend to use iso ..."
Abstract
 Add to MetaCart
isolated information to address the problem, and are often ad hoc. In particular, most existing approaches predict the likelihood of a statement being buggy sequentially and separately. This paper proposes a wellfounded, integrated solution to the software bug localization problem based on Markov logic
Results 1  10
of
152