Filters








6,770 Hits in 5.5 sec

An Inference Algorithm for Guaranteeing Safe Destruction [chapter]

Manuel Montenegro, Ricardo Peña, Clara Segura
2009 Lecture Notes in Computer Science  
Safe is a first-order eager language with facilities for programmer-controlled destruction and copying of data structures.  ...  In this paper we present an inference algorithm, we describe its implementation, and give a number of successfully typed examples. Also the correctness of the algorithm is proved.  ...  More interesting is the definition of a type system [MPS08] guaranteeing that destruction facilities and region management can be done in a safe way.  ... 
doi:10.1007/978-3-642-00515-2_10 fatcat:u53woquztbgtpd44hpjfb56wz4

A Space Consumption Analysis by Abstract Interpretation [chapter]

Manuel Montenegro, Ricardo Peña, Clara Segura
2010 Lecture Notes in Computer Science  
Safe is a first-order functional language with an implicit region-based memory system and explicit destruction of heap cells.  ...  Its static analysis for inferring regions, and a type system guaranteeing the absence of dangling pointers have been presented elsewhere.  ...  Space Inference Algorithms Given a recursive function f with n + m arguments, the algorithms for inferring ∆ f and σ f do not depend on each other, while the algorithm for inferring µ f needs a correct  ... 
doi:10.1007/978-3-642-15331-0_3 fatcat:njzn5tbofbdmpg3u72hxhvivgm

A Simple Region Inference Algorithm for a First-Order Functional Language [chapter]

Manuel Montenegro, Ricardo Peña, Clara Segura
2010 Lecture Notes in Computer Science  
Safe is a first-order eager language with facilities for programmer controlled destruction and copying of data structures.  ...  In this paper we present a simple region inference algorithm for annotating programs with regions arguments and region types.  ...  More interesting is the definition of a type system [6, 7] guaranteeing that destruction facilities can be used in a safe way.  ... 
doi:10.1007/978-3-642-11999-6_10 fatcat:tffzt7yrtvfs5iurjabhairroa

Certified Absence of Dangling Pointers in a Language with Explicit Deallocation [chapter]

Javier de Dios, Manuel Montenegro, Ricardo Peña
2010 Lecture Notes in Computer Science  
Safe is a first-order eager functional language with facilities for programmer controlled destruction of data structures.  ...  The one relevant to this paper is a type system and a type inference algorithm guaranteeing that well-typed programs will be free of dangling pointers at runtime.  ...  An inference algorithm for this type system has been developed in [12] .  ... 
doi:10.1007/978-3-642-16265-7_22 fatcat:f5t3bcnbljd55d3zcexzyrgkti

Physical type checking for C

Satish Chandra, Thomas Reps
1999 Software engineering notes  
This paper describes an inference-based physical type checking algorithm and its implementation.  ...  Our algorithm can be used to perform static safety checks, as well as compute useful information for software engineering applications.  ...  Acknowledgements We thank Michael Si and Thomas Ball for their many contributions to this work.  ... 
doi:10.1145/381788.316183 fatcat:5skycpzmm5dgnf73sxcp26elby

A bottom-up pointer analysis using the update history

Hyun-Goo Kang, Taisook Han
2009 Information and Software Technology  
Pointer analysis is an important part for the source code analysis of C programs.  ...  In this paper, we propose a bottom-up and flow-and context-sensitive pointer analysis algorithm, where bottom-up refers to the ability to perform the analysis from callee modules to caller modules.  ...  that is formulated as an inference algorithm for the memory type system.  ... 
doi:10.1016/j.infsof.2008.11.003 fatcat:6xjmjw4ptzdlrnsdvlsqqmqsqe

A type system for safe memory management and its proof of correctness

Manuel Montenegro, Ricardo Peña, Clara Segura
2008 Proceedings of the 10th international ACM SIGPLAN symposium on Principles and practice of declarative programming - PPDP '08  
We present a destruction-aware type system for the functional language Safe, which is a first-order eager language with facilities for programmer controlled destruction and copying of data structures.  ...  The type system guarantees that, in spite of sharing and of the use of implicit and explicit memory deallocation operations, well-typed programs will be free of dangling pointers at runtime.  ...  It will even be possible to show that an algorithm runs in constant heap space, independently of input size; and (3), as an ultimate goal regions will allow us to statically infer sizes for them and eventually  ... 
doi:10.1145/1389449.1389468 dblp:conf/ppdp/MontenegroPS08 fatcat:mgqptg3surg57cxxfpeljgoudu

Privacy-preserving Data Mining, Sharing and Publishing [article]

Katarzyna Pasierb, Tomasz Kajdanowicz, Przemyslaw Kazienko
2013 arXiv   pre-print
That is not necessarily consistent with preserving data-mining quality. o Cons: Verifying privacy guarantees for tabular data is challenging because of the potential for disclosure by inference [4] .  ...  ALGORITHMS AND METHODS In this paragraph, an overview of the popular approaches for doing PPDS is presented.  ... 
arXiv:1304.1877v1 fatcat:rywiusiyineelia255nnuudmwm

Cooperative reasoning for preemptive execution

Jaeheon Yi, Caitlin Sadowski, Cormac Flanagan
2011 SIGPLAN notices  
We also present dynamic analysis algorithms for detecting cooperability violations, where thread interference is not documented by a yield, and for yield annotation inference for legacy software.  ...  We propose a cooperative methodology for multithreaded software, where threads use traditional synchronization idioms such as locks, but additionally document each point of potential thread interference  ...  The remaining 18 inferred yield annotations are caused by 8 racy variables and 2 destructive atomicity violations.  ... 
doi:10.1145/2038037.1941575 fatcat:c3lulfh63rhx7aibnebdglkvx4

Cooperative reasoning for preemptive execution

Jaeheon Yi, Caitlin Sadowski, Cormac Flanagan
2011 Proceedings of the 16th ACM symposium on Principles and practice of parallel programming - PPoPP '11  
We also present dynamic analysis algorithms for detecting cooperability violations, where thread interference is not documented by a yield, and for yield annotation inference for legacy software.  ...  We propose a cooperative methodology for multithreaded software, where threads use traditional synchronization idioms such as locks, but additionally document each point of potential thread interference  ...  The remaining 18 inferred yield annotations are caused by 8 racy variables and 2 destructive atomicity violations.  ... 
doi:10.1145/1941553.1941575 dblp:conf/ppopp/YiSF11 fatcat:5o44zpdpy5fffbnctmp36duovm

FlexJava: language support for safe and modular approximate programming

Jongse Park, Hadi Esmaeilzadeh, Xin Zhang, Mayur Naik, William Harris
2015 Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2015  
The FlexJava compiler, which is equipped with an approximation safety analysis, automatically infers the operations and data that affect these outputs and selectively marks them approximable while giving  ...  Stateof-the-art approximate programming models require extensive manual annotations on program data and operations to guarantee safe execution of approximate programs.  ...  Then, the EnerJ compiler infers the safe-to-approximate operations for fine-grained approximation.  ... 
doi:10.1145/2786805.2786807 dblp:conf/sigsoft/ParkEZNH15 fatcat:uvbu7ic3nrc6blvii5aomynbhe

SafeGuardPF: Safety Guaranteed Reactive Potential Fields for Mobile Robots in Unknown and Dynamic Environments [article]

Rafael Rodrigues da Silva, Samuel Silva, Grigoriy Dubrovskiy, Hai Lin
2016 arXiv   pre-print
An autonomous navigation with proven collision avoidance in unknown and dynamic environments is still a challenge, particularly when there are moving obstacles.  ...  A popular approach to collision avoidance in the face of moving obstacles is based on model predictive algorithms, which, however, may be computationally expensive.  ...  For example, the PASSVOID [3] computes an online verification algorithm which searches for safe controls that lead a mobile robot to avoid braking inevitable collision states (ICS).  ... 
arXiv:1609.07006v1 fatcat:nan356qssresfbenoohwcbwtfq

SATS: Secure Average-Consensus-Based Time Synchronization in Wireless Sensor Networks

Jianping He, Peng Cheng, Ling Shi, Jiming Chen
2013 IEEE Transactions on Signal Processing  
We prove that SATS guarantees the network time synchronization with an exponentially converging speed.  ...  We first investigate the impact of message manipulation attacks over ATS, and derive a necessary condition for ATS to converge.  ...  , and for each safe node and can be an arbitrary real number for attack node which depends on its attack strategy at time .  ... 
doi:10.1109/tsp.2013.2286102 fatcat:tjj6hq2xlvhnnh2dbhvpnzsmke

Typing with Conditions and Guarantees for Functional In-place Update [chapter]

Michal Konečný
2003 Lecture Notes in Computer Science  
Secondly, we present an algorithm for inferring the strongest sound usage aspects for typable recursive programs.  ...  In this view, the language is suitable for expressing and verifying in-place update algorithms. Correctness of in-place evaluation is guaranteed by a linear typing.  ...  The author is grateful to David Aspinall and Robert Atkey for discussion and comments on this work.  ... 
doi:10.1007/3-540-39185-1_11 fatcat:jaybfpi52fh2nao5bwufwlykgi

Region-Based Memory Management for a Dynamically-Typed Language [chapter]

Akihito Nagata, Naoki Kobayashi, Akinori Yonezawa
2004 Lecture Notes in Computer Science  
In this scheme, a compiler statically estimates the live range of each object by performing an extension of type inference (called region inference) and inserts code for memory allocation and deallocation  ...  Since the region inference is an extension of the ML type inference, however, it was not clear whether the region-based memory management was applicable to dynamically-typed programming languages like  ...  [11] has proposed a type system for region-based memory management for Cyclone (a type-safe dialect of C).  ... 
doi:10.1007/978-3-540-30477-7_16 fatcat:67o3id6eyncr7bxlq3nxkiizq4
« Previous Showing results 1 — 15 out of 6,770 results