Filters








331,994 Hits in 5.6 sec

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.  ...  Other abstractions based on separation logic might be considered as well. After defining the analysis we turn to locality.  ...  Recent work on shape analysis [14, 15] might be regarded as taking some steps towards separation logic.  ... 
doi:10.1007/11691372_19 fatcat:4awjii5ca5cpthyiyfvlm73cqe

Shape Analysis

Bor-Yuh Evan Chang, Cezara Drăgoi, Roman Manevich, Noam Rinetzky, Xavier Rival
2020 Foundations and Trends® in Programming Languages  
Bor-Yuh Evan Chang, Cezara Drăgoi, Roman Manevich, Noam Rinetzky and Xavier Rival (2020), "Shape Analysis", Foundations and Trends R in Programming Languages: Vol. 6, No. 1-2, pp 1-158.  ...  In: Symposium on Principles of Programming Languages (POPL). ACM. 187-200. Distefano, D., P. O'Hearn, and H. Yang (2006). "A local shape analysis based on separation logic".  ...  and separation logic, do.  ... 
doi:10.1561/2500000037 fatcat:77d5la5xw5alrkkr5oleqjhzbe

Towards Automatic Assertion Refinement for Separation Logic

Andrew Ireland
2006 21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06)  
Separation logic holds the promise of supporting scalable formal reasoning for pointer programs. Here we consider proof automation for separation logic.  ...  Our proposal is based upon proof planning and proof patching via assertion refinement.  ...  Thanks go to Alan Bundy, Bill Ellis, Jamie Gabbay, Paul Jackson, Alberto Momigliano, Alan Smaill, and members of the Dependable Systems and Mathematical Reasoning Groups for their feedback on this work  ... 
doi:10.1109/ase.2006.69 dblp:conf/kbse/Ireland06 fatcat:tv4c7t5axnf2ddvx435s564jp4

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.  ...  In essence, the analysis performed by Summate can be viewed as a method of constructing proofs in standard separation logic (in fact, our proof of the analysis' soundness is based on this observation).  ... 
doi:10.1007/11823230_16 fatcat:jo6ybevimbdkdagtheok5ig7wq

Text Location and Extraction for Business Cards Using Stroke Width Estimation

Cheng Dong Zhang, Guee-Sang Lee
2012 International Journal of Contents  
In our proposed method, the first stage based on line detection and shape feature analysis applied to locate the position of a business card and detect the shape from the complex environment.  ...  In the second stage, several local regions contained the possible text components are separated based on the projection histogram.  ...  Then, the card separated into several local regions based on the projection histogram.  ... 
doi:10.5392/ijoc.2012.8.1.030 fatcat:z4ktjegw6vc23ogw6a3j5ktfuu

A fast general-purpose clustering algorithm based on FPGAs for high-throughput data processing

A. Annovi, M. Beretta
2010 Nuclear Instruments and Methods in Physics Research Section A : Accelerators, Spectrometers, Detectors and Associated Equipment  
In fact, its core does not specifically rely on the kind of data or detector it is working for, while the second step can and should be tailored for a given application.  ...  The algorithm is general purpose in the sense that only minimal assumptions on the kind of clustering to be performed are made.  ...  Readout cluster Column index Row index Propagate "selected": local logic 1 st clock cycle 2 nd clock cycle 3 rd clock cycle 4 th clock cycle LEGEND: Works for any cluster shape HIT  ... 
doi:10.1016/j.nima.2009.10.046 fatcat:zrzli7isbfhtrmom2gsprdgfie

Cooperative reasoning for automatic software verification

Andrew Ireland
2007 Proceedings of the second workshop on Automated formal methods - AFM '07  
A key feature of separation logic is that it focuses the reasoning effort on only those parts of the heap that are relevant to a program, so called local reasoning.  ...  Recently he was a consultant on a project to determine the market feasibility of program analysis tools based on research at Edinburgh and Heriot-Watt universities.  ... 
doi:10.1145/1345169.1345175 fatcat:2c5i67mz4fguzogyeoflfoe2li

A Shape Graph Logic and A Shape System

Zhao-Peng Li, Yu Zhang, Yi-Yun Chen
2013 Journal of Computer Science and Technology  
Analysis and verification of pointer programs are still difficult problems so far. This paper uses a shape graph logic and a shape system to solve these problems in two stages.  ...  The proposed shape graph logic, as an extension to Hoare logic, uses shape graphs directly as assertions.  ...  They described memory states in a manner based largely on separation logic.  ... 
doi:10.1007/s11390-013-1398-1 fatcat:zfh7ucjamreirkcbh4revj5xlu

Thread-modular shape analysis

Alexey Gotsman, Josh Berdine, Byron Cook, Mooly Sagiv
2007 Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation - PLDI '07  
This allows us to use a sequential shape analysis on each thread.  ...  Based on this approach, we have implemented a thread-modular shape analysis tool and applied it to concurrent heap-manipulating code from Windows device drivers.  ...  Thread-modular shape analysis with separated heap abstractions We define a thread-modular analysis based on a sequential shape analysis in which abstract states are represented by separation logic formulae  ... 
doi:10.1145/1250734.1250765 dblp:conf/pldi/GotsmanBCS07 fatcat:3b7hz7cm3bbwdo3pe53ekpxgnm

Thread-modular shape analysis

Alexey Gotsman, Josh Berdine, Byron Cook, Mooly Sagiv
2007 SIGPLAN notices  
This allows us to use a sequential shape analysis on each thread.  ...  Based on this approach, we have implemented a thread-modular shape analysis tool and applied it to concurrent heap-manipulating code from Windows device drivers.  ...  Thread-modular shape analysis with separated heap abstractions We define a thread-modular analysis based on a sequential shape analysis in which abstract states are represented by separation logic formulae  ... 
doi:10.1145/1273442.1250765 fatcat:qknm2ogxdvcuxlkcw26cigov7a

Amortised Resource Analysis with Separation Logic [chapter]

Robert Atkey
2010 Lecture Notes in Computer Science  
In this work we translate the idea of amortised resource analysis to imperative languages by embedding a logic of resources, based on Bunched Implications, within Separation Logic.  ...  We present the logic on a small imperative language with procedures and mutable heap, based on Java bytecode.  ...  procedure, or to interactive systems based on this program logic.  ... 
doi:10.1007/978-3-642-11957-6_6 fatcat:azi2vrr2krez5f7ujdsw4fznnm

Shape analysis with inductive recursion synthesis

Bolei Guo, Neil Vachharajani, David I. August
2007 Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation - PLDI '07  
This technique yields a separation logic based shape analysis that can be effective on a much wider range of programs.  ...  A key strength of separation logic is that it facilitates, via explicit expression of structural separation, local reasoning about heap where the effects of altering one part of a data structure are analyzed  ...  Chapter 9 Conclusion and Future Work This dissertation has taken steps to allow separation logic based shape analysis to be applied to a wide range of programs without a priori restrictions on the types  ... 
doi:10.1145/1250734.1250764 dblp:conf/pldi/GuoVA07 fatcat:ovl3pyb4p5dzhmudly3rqj4rku

Heap Abstractions for Static Analysis

Vini Kanvar, Uday P. Khedker
2016 ACM Computing Surveys  
We describe various summarization techniques based on k-limiting, allocation sites, patterns, variables, other generic instrumentation predicates, and higher-order logics.  ...  We classify the models as storeless, store based, and hybrid.  ...  Acknowledgements An invigorating discussion in the Dagstuhl Seminar on Pointer Analysis [49] sowed the seeds of this survey paper.  ... 
doi:10.1145/2931098 fatcat:ocqh47fovraqtbjd35yrts6svi

Separating Shape Graphs [chapter]

Vincent Laviron, Bor-Yuh Evan Chang, Xavier Rival
2010 Lecture Notes in Computer Science  
This representation has a close connection to particular kinds of formulas in separation logic.  ...  In this paper, we present a shape graph representation of memory that exposes individual fields while largely retaining the convenience of an object-level model.  ...  Similarly, in separation logic [22] and separation logic-based shape analyzers, we might represent the memory shown in Fig. 1b with the following formula: u 1 → {f : u 2 , g : null} * u 2 → {f : null  ... 
doi:10.1007/978-3-642-11957-6_21 fatcat:uiy4sn3mhzfx5nge3wycjqrqcq

Loop Invariant Synthesis in a Combined Domain [chapter]

Shengchao Qin, Guanhua He, Chenguang Luo, Wei-Ngan Chin
2010 Lecture Notes in Computer Science  
involving both shape and numerical properties.  ...  In this paper, we reduce the need of user annotations by automatically inferring loop invariants over an abstract domain with both separation and numerical information.  ...  To conquer this problem, separation logic based shape analysis techniques are brought in, e.g., the SpaceInvader tool [3, 9, 27] .  ... 
doi:10.1007/978-3-642-16901-4_31 fatcat:3w26umevt5hmtgw2upywrbukiy
« Previous Showing results 1 — 15 out of 331,994 results