• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 226
Next 10 →

Implicit dynamic frames: Combining dynamic frames and separation logic (soundness proof

by Jan Smans, Bart Jacobs, Frank Piessens , 2009
"... Abstract. The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annotations. In this paper, we propose a variant of the dynamic frames approach that eliminates the need to explicit ..."
Abstract - Cited by 41 (5 self) - Add to MetaCart
to explicitly write and check frame annotations. Reminiscent of separation logic’s frame rule, programmers write access assertions inside pre- and postconditions instead of writing frame annotations. From the precondition, one can then infer an upper bound on the set of locations writable or readable

Combining dynamic frames and separation logic (soundness proof)

by Jan Smans, Bart Jacobs, Frank Piessens , 2009
"... The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annotations. In this paper, we propose a variant of the dynamic frames approach that eliminates the need to explicitly write a ..."
Abstract - Add to MetaCart
its expressiveness by verifying several challenging examples from related work. Implicit Dynamic Frames: Combining dynamic frames and separation logic (soundness proof) Jan Smans Bart Jacobs Frank Piessens The dynamic frames approach has proven to be a powerful formalism for specifying and verifying

Implicit Dynamic Frames

by Jan Smans, Bart Jacobs, Frank Piessens , 2011
"... An important, challenging problem in the verification of imperative programs with shared, mutable state is the frame problem in the presence of data abstraction. That is, one must be able to specify and verify upper bounds on the set of memory locations a method can read and write without exposing t ..."
Abstract - Cited by 20 (6 self) - Add to MetaCart
implicit dynamic frames, that supports heap-dependent expressions inside assertions. Conformance with an implicit dynamic frames specification can be checked by proving validity of a number of first-order verification conditions. To show that these verification

The Relationship Between Separation Logic and Implicit Dynamic Frames

by Matthew J. Parkinson, Alexander J. Summers
"... Separation logic is a concise method for specifying programs that manipulate dynamically allocated storage. Partially inspired by separation logic, Implicit Dynamic Frames has recently been proposed, aiming at first-order tool support. In this paper, we provide a total heap semantics for a standard ..."
Abstract - Cited by 20 (3 self) - Add to MetaCart
Separation logic is a concise method for specifying programs that manipulate dynamically allocated storage. Partially inspired by separation logic, Implicit Dynamic Frames has recently been proposed, aiming at first-order tool support. In this paper, we provide a total heap semantics for a

An automatic encoding from VeriFast Predicates into Implicit Dynamic Frames

by Daniel Jost, Alexander J. Summers
"... VeriFast is a symbolic-execution-based verifier, based on separation logic specifications. Chalice is a verifier based on verification condition generation, which employs specifications in implicit dynamic frames. Recently, theoretical work has shown how the cores of these two verification logics ..."
Abstract - Add to MetaCart
VeriFast is a symbolic-execution-based verifier, based on separation logic specifications. Chalice is a verifier based on verification condition generation, which employs specifications in implicit dynamic frames. Recently, theoretical work has shown how the cores of these two verification logics

An Admissible Second Order Frame Rule in Region Logic

by David A. Naumann , 2008
"... Shared mutable objects and reentrant callacks can subvert encapsulation in objectbased programs. For modular reasoning, verifiers rely on methodologies. These combine special annotations or types with instrumentation (ghost state) and syntactic restrictions on programs and specifications, which pose ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
pose challenges for proving soundness and for comparing/combining methodologies. This paper formalizes a second order frame rule, similar to that of separation logic but for a logic with explicit regions. The rule captures proof obligations of invariant methodologies such as ownership for dynamically

2 Translating Separation Logic into Dynamic Frames Using Fine-Grained Region Logic

by Yuyan Bao, Gary T. Leavens, Gidon Ernst, Yuyan Bao, Gary T. Leavens, Gidon Ernst , 2014
"... logics of programs, pre- and post-conditions, specification techniques; Submitted for publication. Computer Science ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
logics of programs, pre- and post-conditions, specification techniques; Submitted for publication. Computer Science

DYNAMIC BEHAVIOR OF FRAMED STRUCTURES WITH AN ELASTIC INTERNAL HINGE

by A. R. Ratazzi, D. V. Bambill, C. A. Rossit
"... Abstract. The study of the dynamic properties of framed structures is extremely impor-tant in the field of structural engineering. In this paper the first natural frequencies of transverse vibration of frames are determined. The elastic structural system consists of a beam supported by a column. The ..."
Abstract - Add to MetaCart
Abstract. The study of the dynamic properties of framed structures is extremely impor-tant in the field of structural engineering. In this paper the first natural frequencies of transverse vibration of frames are determined. The elastic structural system consists of a beam supported by a column

Local reasoning and dynamic framing for the composite pattern and its clients

by Stan Rosenberg , Anindya Banerjee , David A Naumann - In VSTTE , 2010
"... Abstract. The Composite design pattern is an exemplar of specification and verification challenges for sequential object-oriented programs. Region logic is a Hoare logic augmented with state dependent "modifies" specifications based on simple notations for object sets. Using ordinary firs ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
first order logic assertions, it supports local reasoning and also the hiding of invariants on encapsulated state, in ways similar to separation logic but suited to off-the-shelf SMT solvers. This paper uses region logic to specify and verify a representative implementation of the Composite design

A Logical Account of Hoare’s Mismatch Information Hiding via Second Order Framing in Region Logic

by Anindya Banerjee, David A. Naumann
"... We investigate information hiding in object-based programs and the associated mismatch. While client reasoning is in terms of interface specifications, the implementation of an interface is verified against different specifications that involve invariants about internal data structures. Soundness of ..."
Abstract - Add to MetaCart
conditions that are imposed on client effects. Effects are tracked using ghost state and separation assertions in a style that has been used in a number of verification tools. Our approach permits the formulation of encapsulation disciplines (such as ownership, or package confinement) as part
Next 10 →
Results 1 - 10 of 226
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2016 The Pennsylvania State University