Filters








11,259 Hits in 4.8 sec

Towards the Integration of Symbolic and Numerical Static Analysis [chapter]

Arnaud Venet
2008 Lecture Notes in Computer Science  
In that model, pointer aliasing is represented by an equivalence relation over access paths into data structures.  ...  We designed a model in which all data are referenced using a byte-based offset within the memory block where they belong.  ... 
doi:10.1007/978-3-540-69149-5_24 fatcat:cul4tjpxhzfthhcvhjueoxui7m

A Scalable Nonuniform Pointer Analysis for Embedded Programs [chapter]

Arnaud Venet
2004 Lecture Notes in Computer Science  
In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and elements of arrays.  ...  We first perform an inexpensive flow-sensitive analysis of each function in the program that generates semantic equations describing the effect of the function on the memory graph.  ...  Existing scalable pointer analyses [Ste96, FFSA98, Das00, HT01] are uniform, i.e. they do not distinguish between elements of arrays or components of recursive data structures and are therefore of little  ... 
doi:10.1007/978-3-540-27864-1_13 fatcat:x77skhddc5fjnbqicziekpzy2y

Automatic Inference of Frame Axioms Using Static Analysis

Zvonimir Rakamaric, Alan J. Hu
2008 2008 23rd IEEE/ACM International Conference on Automated Software Engineering  
The technique builds on a pointer analysis that generates limited information about all data structures in the heap.  ...  This paper describes a technique for automatically inferring frame axioms of procedures and loops using static analysis.  ...  Adding support for recursive data structures based on the version of the reachability predicate described in [9] is at the top of our list.  ... 
doi:10.1109/ase.2008.19 dblp:conf/kbse/RakamaricH08 fatcat:nq6fapwe5rev5nyx5hlnj7pa7m

A Scalable Memory Model for Low-Level Code [chapter]

Zvonimir Rakamarić, Alan J. Hu
2008 Lecture Notes in Computer Science  
Furthermore, this analysis allows us to create automatically memory models that flexibly use the more scalable memory model for most of memory, but resorting to a more accurate model for memory accesses  ...  ., providing a useful level of soundness and precision) and scalable memory model: First, we compare a recently introduced memory model, specifically designed to more accurately model low-level memory  ...  Data Structure Analysis (DSA). DSA [23] is a highly scalable and fast, contextsensitive (with full heap cloning), field-sensitive (even in a type-unsafe setting), conservative pointer analysis.  ... 
doi:10.1007/978-3-540-93900-9_24 fatcat:4cebfdldkfezvgk44uwhmyxse4

The UPC++ PGAS library for Exascale Computing

John Bachan, Dan Bonachea, Paul H. Hargrove, Steve Hofmeyr, Mathias Jacquelin, Amir Kamil, Brian van Straalen, Scott B. Baden
2017 Proceedings of the Second Annual PGAS Applications Workshop on ZZZ - PAW17  
UPC++ targets distributed data structures where communication is irregular or fine-grained. The key abstractions are global pointers, asynchronous programming via RPC, and futures.  ...  Global pointers incorporate ownership information useful in optimizing for locality.  ...  Atomics are useful in managing distributed lock-free data structures.  ... 
doi:10.1145/3144779.3169108 dblp:conf/sc/BachanBHHJKSB17 fatcat:u3fahjmijzdidhb3me3x327r3u

Brief Announcement

Adones Rukundo, Aras Atalar, Philippas Tsigas
2018 Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18  
The design is tunable and allow for a continuous monotonic trade of weaker semantics for better throughput performance.  ...  Concurrent stacks have an inherent scalability bottleneck due to their single access point for both their operations.  ...  INTRODUCTION To improve performance scalability of concurrent data structures, recent research has focused on expanding the set of legal behaviours, including; weakening consistency and semantic relaxation  ... 
doi:10.1145/3212734.3212794 fatcat:h6a7egngn5eyxccnvfap7vgvcy

Static data race detection for concurrent programs with asynchronous calls

Vineet Kahlon, Nishant Sinha, Erik Kruus, Yun Zhang
2009 Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering on European software engineering conference and foundations of software engineering symposium - ESEC/FSE '09  
A large number of industrial concurrent programs are being designed based on a model which combines threads with event-based communication.  ...  These asynchronous function calls are implemented using function objects, which are essentially wrappers containing a pointer to the function that should be executed on a particular thread with the corresponding  ...  Bootstrapping based Pointer Analysis We review some useful facts about the well-known Steensgaard's points-to analysis [24] and how to leverage it in improving the scalability of flow and context-sensitive  ... 
doi:10.1145/1595696.1595701 dblp:conf/sigsoft/KahlonSKZ09 fatcat:yzcmbm4wyrezfgctgsrbm2qozi

Towards an industrial use of sound static analysis for the verification of concurrent embedded avionics software

Antoine Miné, David Delmas
2015 2015 International Conference on Embedded Software (EMSOFT)  
This article discusses the requirements for sound static analysis of concurrent embedded software at Airbus and presents AstréeA, an extension of Astrée with the potential to address these requirements  ...  : it is scalable and reports soundly all run-time errors with few false positives.  ...  Concrete semantics Astrée analyzes a large subset of C, including integers, floats, pointers, structured data-types, loops, gotos.  ... 
doi:10.1109/emsoft.2015.7318261 dblp:conf/emsoft/MineD15 fatcat:gduz3ancrjadlhlfxyepmxdypu

A framework for the massive knowledge Web

Xiaoping Sun, Hai Zhuge, Qing Li
2009 Concurrency and Computation  
Three major components are discussed herein: (1) semantic data model for massive Web2.0 content, (2) semantics-rich query model, and (3) scalable distributed semantic indexing model.  ...  The architecture incorporates a virtual P2P overlay into the server side platform to support efficient knowledge management, semantics-rich and personalized query processing for huge amounts of dynamic  ...  Scalable Semantic Data Model The semantic data model is the main trunk that eliminates semantic gap between different levels of the system.  ... 
doi:10.1002/cpe.1372 fatcat:sqz3cb4lujdejjvu4eefr3micu

BinPointer: towards precise, sound, and scalable binary-level pointer analysis

Sun Hyoung Kim, Dongrui Zeng, Cong Sun, Gang Tan
2022 Proceedings of the 31st ACM SIGPLAN International Conference on Compiler Construction  
The soundness of BinPointer is also validated through runtime data. CCS Concepts: • Security and privacy → Software reverse engineering.  ...  Our experimental results demonstrate that Bin-Pointer has higher precision over prior work, while maintaining acceptable scalability.  ...  BPA [14] showed that the block memory model could be used to improve the scalability of binary-level pointer analysis. In this model, memory is partitioned into a set of disjoint memory blocks.  ... 
doi:10.1145/3497776.3517776 fatcat:vn7c43xgizfsnkir76d4uxlinq

Implications of a Data Structure Consistency Checking System [chapter]

Viktor Kuncak, Patrick Lam, Karen Zee, Martin Rinard
2008 Lecture Notes in Computer Science  
In particular, it supports the targeted use of very precise, unscalable analyses in the context of a larger analysis and verification system.  ...  Second, it can provide information that insulates other analysis and verification tools from having to deal directly with pointers and data structure implementations, thereby enabling these tools to focus  ...  2) enabling the use of less precise, more scalable analyses outside of the data structure implementations.  ... 
doi:10.1007/978-3-540-69149-5_23 fatcat:xs27fyu7urgzvhl42dppeo5npy

SoK: Introspections on Trust and the Semantic Gap

Bhushan Jain, Mirza Basim Baig, Dongli Zhang, Donald E. Porter, Radu Sion
2014 2014 IEEE Symposium on Security and Privacy  
A fundamental obstacle to this goal is the difficulty in accurately extracting semantic meaning from the hypervisor's hardwarelevel view of a guest OS, called the semantic gap.  ...  Unfortunately, much of this progress has been made at the cost of reintroducing trust into the guest OS, often in direct contradiction to the underlying threat model motivating the introspection.  ...  This research was supported in part by NSF grants CNS-1149229, NSF CNS-1161541, NSF CNS-1228839, NSF CNS-1318572, NSF CNS-1223239, NSF CCF-0937833, by the US ARMY award W911NF-13-1-0142, the Office of  ... 
doi:10.1109/sp.2014.45 dblp:conf/sp/JainBZPS14 fatcat:zpldjgsmcfdvhgx252dewbh33y

Shape Analysis of Low-Level C with Overlapping Structures [chapter]

Jörg Kreiker, Helmut Seidl, Vesal Vojdani
2010 Lecture Notes in Computer Science  
Device drivers often keep data in multiple data structures simultaneously while embedding list or tree related records into the records containing the actual data; this results in overlapping structures  ...  Shape analyses have traditionally relied on a graph-based representation of memory where a node corresponds to a whole record and edges to pointers.  ...  [3] present a shape analysis of composite data-structures which can reason about lists of lists.  ... 
doi:10.1007/978-3-642-11319-2_17 fatcat:yx7xudehave5xhc72x4ivsinty

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.  ...  and analysis, and the scalability of the analysis.  ...  A second useful semantic property focuses on the resolution of pointers so as to determine to which address a pointer may refer, or what pairs of pointers may be equal (alias).  ... 
doi:10.1561/2500000037 fatcat:77d5la5xw5alrkkr5oleqjhzbe

An Environment for Semi-automatic Annotation of Ontological Knowledge with Linguistic Content [chapter]

Maria Teresa Pazienza, Armando Stellato
2006 Lecture Notes in Computer Science  
In past work we introduced OntoLing [7], a Protégé plug-in offering a modular and scalable framework for performing manual annotation of ontological data with information from different, heterogeneous  ...  Both the multilingual aspects which characterize the (Semantic) Web and the demand for more easy-to-share forms of knowledge representation, being equally accessible by humans and machines, push the need  ...  Using a LR's Semantic Structure as a Controlled Vocabulary: Semantic Enrichment of Ontologies In this class of Linguistic Enrichment tasks, the semantic structure of a given LR (provided it has one), is  ... 
doi:10.1007/11762256_33 fatcat:zak25cmcefewjniwsazmxzmgjq
« Previous Showing results 1 — 15 out of 11,259 results