Filters








8,162 Hits in 6.5 sec

A semantics for procedure local heaps and its abstractions

Noam Rinetzky, Jörg Bauer, Thomas Reps, Mooly Sagiv, Reinhard Wilhelm
2005 SIGPLAN notices  
In this semantics, objects are treated specially when they separate the "local heap" that can be mutated by a procedure from the rest of the heap, which-from the viewpoint of that procedure-is non-accessible  ...  The second part concerns abstract interpretation of LSL and develops a new static-analysis algorithm using canonical abstraction. It also provides insight into Deutsch's mayalias algorithm.  ...  We are grateful for the helpful comments of E. Yahav, G. Yorsh, and the anonymous referees of the POPL paper [37] .  ... 
doi:10.1145/1047659.1040330 fatcat:dqmn7mi7jvbalbjs7wrn4a5sha

A semantics for procedure local heaps and its abstractions

Noam Rinetzky, J�rg Bauer, Thomas Reps, Mooly Sagiv, Reinhard Wilhelm
2005 Proceedings of the 32nd ACM SIGPLAN-SIGACT sysposium on Principles of programming languages - POPL '05  
In this semantics, objects are treated specially when they separate the "local heap" that can be mutated by a procedure from the rest of the heap, which-from the viewpoint of that procedure-is non-accessible  ...  The second part concerns abstract interpretation of LSL and develops a new static-analysis algorithm using canonical abstraction. It also provides insight into Deutsch's mayalias algorithm.  ...  We are grateful for the helpful comments of E. Yahav, G. Yorsh, and the anonymous referees of the POPL paper [37] .  ... 
doi:10.1145/1040305.1040330 dblp:conf/popl/RinetzkyBRSW05 fatcat:ipb3o44bbjd2jhngsh2wouhgre

Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs [chapter]

J. Kreiker, T. Reps, N. Rinetzky, M. Sagiv, Reinhard Wilhelm, E. Yahav
2013 Lecture Notes in Computer Science  
We present a framework for local interprocedural shape analysis that computes procedure summaries as transformers of procedure-local heaps (the parts of the heap that the procedure may reach).  ...  This limitation (and certain variations of it, which we also describe) simplifies the local-reasoning about procedure calls because the analysis needs not track cutpoints.  ...  A procedure-local heap semantics and its abstractions benefit from not having to represent irrelevant objects. However, in general, the semantics needs to take special care of cutpoints.  ... 
doi:10.1007/978-3-642-37651-1_17 fatcat:robitlvuwvbrtibezx6cc2yemq

Interprocedural Shape Analysis for Cutpoint-Free Programs [chapter]

Noam Rinetzky, Mooly Sagiv, Eran Yahav
2005 Lecture Notes in Computer Science  
This makes the analysis modular in the heap and thus allows reusing the effect of a procedure at different call-sites and even between different contexts occurring at the same call-site.  ...  We have implemented a prototype of our framework and used it to verify interesting properties of cutpoint-free programs, including partial correctness of a recursive quicksort implementation.  ...  We are grateful for the helpful comments of N. Dor, S. Fink, T. Lev-Ami, R. Manevich, R. Shaham, G. Yorsh, and the anonymous referees of the SAS paper [35] .  ... 
doi:10.1007/11547662_20 fatcat:3pncexkidffmjge2ajlnxizrje

Interacting via the Heap in the Presence of Recursion

Jurriaan Rot, Irina Măriuca Asăvoae, Frank de Boer, Marcello M. Bonsangue, Dorel Lucanu
2012 Electronic Proceedings in Theoretical Computer Science  
We present an improved semantics for this language, using an abstraction that is precise.  ...  In the presence of recursive procedures and local variables the interactions of a program with the heap can become rather complex, as an unbounded number of objects can be allocated either on the call  ...  We introduce Shylock and its formal semantics in Section 2. In Section 3 the abstraction of this semantics is introduced, together with a proof of its correctness.  ... 
doi:10.4204/eptcs.104.9 fatcat:q633v4o5cbaznnyy3mkhrdbesa

Modular Shape Analysis for Dynamically Encapsulated Programs [chapter]

N. Rinetzky, A. Poetzsch-Heffter, G. Ramalingam, M. Sagiv, E. Yahav
2007 Lecture Notes in Computer Science  
We present a modular static analysis which identifies structural (shape) invariants for a subset of heap-manipulating programs.  ...  The subset is defined by means of a non-standard operational semantics which places certain restrictions on aliasing and sharing across modules.  ...  We are grateful for the helpful comments of T. Lev-Ami, R. Manevich, S. Rajamani, J. Reineke, G. Yorsh, and the anonymous referees.  ... 
doi:10.1007/978-3-540-71316-6_16 fatcat:42xciars5bffzdz475ngvqrkty

Interprocedural Shape Analysis with Separated Heap Abstractions [chapter]

Alexey Gotsman, Josh Berdine, Byron Cook
2006 Lecture Notes in Computer Science  
We describe an interprocedural shape analysis that makes use of spatial locality (i.e. the fact that most procedures modify only a small subset of the heap) in its representation of abstract states.  ...  Computing the effect of procedure calls and returns on an abstract state is easy because the representation exhibits spatial locality mirroring the locality that is present in the concrete semantics.  ...  The authors would also like to thank Noam Rinetzky for providing the test programs used in [15] and the anonymous reviewers for useful suggestions.  ... 
doi:10.1007/11823230_16 fatcat:jo6ybevimbdkdagtheok5ig7wq

Unbounded Allocation in Bounded Heaps [chapter]

Jurriaan Rot, Frank de Boer, Marcello Bonsangue
2013 Lecture Notes in Computer Science  
In this paper we introduce a new symbolic semantics for a class of recursive programs which feature dynamic creation and unbounded allocation of objects.  ...  However, assuming the number of reachable objects in the visible heap is bounded in all the computations of a program with pointers, we show how to construct a program without pointers that simulates it  ...  The research of this author has been funded by the Netherlands Organisation for Scientific Research (NWO), CoRE project, dossier number: 612.063.920.  ... 
doi:10.1007/978-3-642-40213-5_1 fatcat:h3qd7rdshvfmlaszxlyj3ff7fm

A Formalisation of Smallfoot in HOL [chapter]

Thomas Tuerk
2009 Lecture Notes in Computer Science  
It contains a model of an abstract, imperative programming language as well as an abstract specification logic for this language.  ...  While the formalisation mainly follows the original definition of Abstract Separation Logic, it contains some additional features. Most noticeably is added support for procedures.  ...  Acknowledgements I would like to thank Matthew Parkinson, Mike Gordon, Alexey Gotsman, Magnus Myreen and Viktor Vafeiadis for a lot of discussions, comments and criticism. Bibliography  ... 
doi:10.1007/978-3-642-03359-9_32 fatcat:zez6rlf5vbg6pgi74d27wxl3pi

Modular Heap Analysis for Higher-Order Programs [chapter]

Ravichandhran Madhavan, G. Ramalingam, Kapil Vaswani
2012 Lecture Notes in Computer Science  
The key and first step is to formulate a compositional concrete semantics for a language with higher order procedures in a form suitable for abstraction, as shown in Section 3.  ...  We then mimic the same structure to define an abstract semantics for procedures and libraries (Sections 4 and 5), which serves as the basis for our analysis, which can be applied to a library independent  ...  Abstract Semantics Let (LP, LL) be a library, consisting of a set of procedures LP and a set of other libraries LL it links to. Let LLP denote the set of all procedures in LL.  ... 
doi:10.1007/978-3-642-33125-1_25 fatcat:mkrnodtii5dctik3tr3qt4dpe4

Balancing the Load

Eyad Alkassar, Mark A. Hillebrand, Dirk C. Leinenbach, Norbert W. Schirmer, Artem Starostin, Alexandra Tsyban
2009 Journal of automated reasoning  
We have developed a stack of semantics for a high-level C-like language and low-level assembly code, which has been carefully crafted to support the pervasive verification of system software.  ...  This verification target is of particular interest because it has a relatively simple top-level specification and it exercises all parts of our semantics stack.  ...  Already in the big-step semantics there is no need for a frame stack, because it abstracts the whole procedure call to one single step in the execution.  ... 
doi:10.1007/s10817-009-9123-z fatcat:ctiars2cofhy5lp2n2kuh6axgm

Verifying pointer safety for programs with unknown calls

Chenguang Luo, Florin Craciun, Shengchao Qin, Guanhua He, Wei-Ngan Chin
2010 Journal of symbolic computation  
Given a Hoare-style partial correctness specification S = {Pre}C{Post} in separation logic, where the program C contains calls to some unknown procedure U, we infer a specification S U for the unknown  ...  We study the automated verification of pointer safety for heapmanipulating imperative programs with unknown procedure calls.  ...  We thank Hongseok Yang for his encouragement and invaluable comments and Dino Distefano for very useful discussions. We also acknowledge the very valuable insights from the anonymous reviewers.  ... 
doi:10.1016/j.jsc.2010.06.003 fatcat:pka3kqfnxjdybn35gbcvblbeqi

Simple Isolation for an Actor Abstract Machine [chapter]

Benoit Claudel, Quentin Sabah, Jean-Bernard Stefani
2015 Lecture Notes in Computer Science  
The actor model is an old but compelling concurrent programming model in this age of multicore architectures and distributed services.  ...  In addition, we show, via a formal proof using the Coq proof assistant, that our approach indeed enforces actor isolation.  ...  e with a set of local variables lv and a heap h reduces to expression e with local variables lv and heap h .  ... 
doi:10.1007/978-3-319-19195-9_14 fatcat:jxcfjvhrojfndlkm7hnfazowmm

A Local Shape Analysis Based on Separation Logic [chapter]

Dino Distefano, Peter W. O'Hearn, Hongseok Yang
2006 Lecture Notes in Computer Science  
We describe a program analysis for linked list programs where the abstract domain uses formulae from separation logic.  ...  But, after labouring for the better part of a year, we decided to aim lower: to define an abstract domain and abstract post operator, together with an account of its locality, for a language without procedures  ...  execution semantics σ, A =⇒ σ takes a symbolic heap σ and an atomic command, and transforms it into an output symbolic heap or .  ... 
doi:10.1007/11691372_19 fatcat:4awjii5ca5cpthyiyfvlm73cqe

Compositional shape analysis by means of bi-abduction

Cristiano Calcagno, Dino Distefano, Peter O'Hearn, Hongseok Yang
2009 SIGPLAN notices  
The analysis uses an abstract domain based on a restricted fragment of separation logic, and assigns a collection of Hoare triples to each procedure; the triples provide an over-approximation of data structure  ...  This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers.  ...  We would like to thank Jan Tobias Mühlberg for providing the benchmarks which initially sparked this work, Paul Kelly for giving us access to his group's 8-core machine, and Wei-Ngan Chin for useful comments  ... 
doi:10.1145/1594834.1480917 fatcat:qp673bju6bahfaucp5voqbkmtm
« Previous Showing results 1 — 15 out of 8,162 results