Substructural Type Systems for Program Analysis

2008 ◽  
pp. 14-14 ◽  
Author(s):  
Naoki Kobayashi
Keyword(s):  
Program Analysis ◽  
Type Systems

scholarly journals Annotated Type Systems for Program Analysis

1995 ◽  
Vol 24 (498) ◽  
Author(s):  
Kirsten Lackner Solberg
Keyword(s):  
Program Analysis ◽  
Abstract Interpretation ◽  
Operational Semantics ◽  
Type System ◽  
Denotational Semantics ◽  
Type Systems ◽  
Strictness Analysis ◽  
Binding Time ◽  
The One ◽  
Treat All

<p>In this Ph.D. thesis, we study four program analyses. Three of them are specified by annotated type systems and the last one by abstract interpretation.</p><p>We present a combined strictness and totality analysis. We are specifying the analysis as an annotated type system. The type system allows conjunctions of annotated types, but only at the top-level. The analysis is somewhat more powerful than the strictness analysis by Kuo and Mishra due to the conjunctions and in that we also consider totality. The analysis is shown sound with respect to a natural-style operational semantics. The analysis is not immediately extendable to full conjunction.</p><p>The second analysis is also a combined strictness and totality analysis, however with ``full´´ conjunction. Soundness of the analysis is shown with respect to a denotational semantics. The analysis is more powerful than the strictness analyses by Jensen and Benton in that it in addition to strictness considers totality. So far we have only specified the analyses, however in order for the analyses to be practically useful we need an algorithm for inferring the annotated types. We construct an algorithm for the second analysis using the lazy type approach by Hankin and Le Métayer. The reason for choosing the second analysis from the thesis is that the approach is not applicable to the first analysis.</p><p>The third analysis we study is a binding time analysis. We take the analysis specified by Nielson and Nielson and we construct a more efficient algorithm than the one proposed by Nielson and Nielson. The algorithm collects constraints in a structural manner like the type inference algorithm by Damas. Afterwards the minimal solution to the set of constraints is found.</p><p>The last analysis in the thesis is specified by abstract interpretation. Hunt shows that projection based analyses are subsumed by PER (partial equivalence relation) based analyses using abstract interpretation. The PERs used by Hunt are strict, i.e. bottom is related to bottom. Here we lift this restriction by requiring the PERs to be uniform, in the sense that they treat all the integers equally. By allowing non-strict PERs we get three properties on the integers, corresponding to the three annotations used in the first and second analysis in the thesis.</p>

scholarly journals Particpants' Proceedings on the Workshop: Types for Program Analysis

1995 ◽  
Vol 24 (493) ◽  
Author(s):  
Hanne Riis Nielson ◽  
Kirsten Lackner Solberg
Keyword(s):  
Programming Languages ◽  
Program Analysis ◽  
Abstract Interpretation ◽  
Recent Trend ◽  
Type Systems ◽  
Program Committee ◽  
Program Optimization ◽  
Proof Techniques ◽  
Areas Of Interest

<p>As a satellite meeting of the TAPSOFT'95 conference we organized a small workshop on program analysis. The title of the workshop, ``Types for Program Analysis´´, was motivated by the recent trend of letting the presentation and development of program analyses be influenced by annotated type systems, effect systems, and more general logical systems. The contents of the workshop was intended to be somewhat broader; consequently the call for participation listed the following areas of interest:</p><p>- specification of specific analyses for programming languages,</p><p>- the role of effects, polymorphism, conjunction/disjunction types, dependent types etc.in specification of analyses,</p><p>- algorithmic tools and methods for solving general classes of type-based analyses,</p><p>- the role of unification, semi-unification etc. in implementations of analyses,</p><p>- proof techniques for establishing the safety of analyses,</p><p>- relationship to other approaches to program analysis, including abstract interpretation and constraint-based methods,</p><p>- exploitation of analysis results in program optimization and implementation.</p><p>The submissions were not formally refereed; however each submission was read by several members of the program committee and received detailed comments and suggestions for improvement. We expect that several of the papers, in slightly revised forms, will show up at future conferences. The workshop took place at Aarhus University on May 26 and May 27 and lasted two half days.</p>

A Semantic Perspective on Omission Abstraction in ASP

2020 ◽  
Author(s):  
Zeynep G. Saribatur ◽  
Thomas Eiter
Keyword(s):  
Problem Solving ◽  
Program Analysis ◽  
Abstract Level ◽  
Answer Sets

The recently introduced notion of ASP abstraction is on reducing the vocabulary of a program while ensuring over-approximation of its answer sets, with a focus on having a syntactic operator that constructs an abstract program. It has been shown that such a notion has the potential for program analysis at the abstract level by getting rid of irrelevant details to problem solving while preserving the structure, that aids in the explanation of the solutions. We take here a further look on ASP abstraction, focusing on abstraction by omission with the aim to obtain a better understanding of the notion. We distinguish the key conditions for omission abstraction which sheds light on the differences to the well-studied notion of forgetting. We demonstrate how omission abstraction fits into the overall spectrum, by also investigating its behavior in the semantics of a program in the framework of HT logic.

Mobile Software Assurance Informed through Knowledge Graph Construction: The OWASP Threat of Insecure Data Storage

2020 ◽  
Vol 2 (2) ◽  
Author(s):  
Suzanna Schmeelk ◽  
Lixin Tao
Keyword(s):  
Data Storage ◽  
Program Analysis ◽  
Web Application ◽  
Security Analysis ◽  
Knowledge Graph ◽  
Healthcare Applications ◽  
Sensitive Data ◽  
Knowledge Graphs ◽  
Mobile Malware Detection ◽  
Software Assurance

Many organizations, to save costs, are movinheg to t Bring Your Own Mobile Device (BYOD) model and adopting applications built by third-parties at an unprecedented rate.  Our research examines software assurance methodologies specifically focusing on security analysis coverage of the program analysis for mobile malware detection, mitigation, and prevention.  This research focuses on secure software development of Android applications by developing knowledge graphs for threats reported by the Open Web Application Security Project (OWASP).  OWASP maintains lists of the top ten security threats to web and mobile applications.  We develop knowledge graphs based on the two most recent top ten threat years and show how the knowledge graph relationships can be discovered in mobile application source code.  We analyze 200+ healthcare applications from GitHub to gain an understanding of their software assurance of their developed software for one of the OWASP top ten moble threats, the threat of “Insecure Data Storage.”  We find that many of the applications are storing personally identifying information (PII) in potentially vulnerable places leaving users exposed to higher risks for the loss of their sensitive data.

Effects of activated carbon on treatment of photo-processing waste by sulfur-oxidizing bacteria

1997 ◽  
Vol 35 (7) ◽  
pp. 187-195 ◽  
Author(s):  
Binle Lin ◽  
K. Futono ◽  
A. Yokoi ◽  
M. Hosomi ◽  
A. Murakami
Keyword(s):  
Activated Carbon ◽  
Treatment Effectiveness ◽  
Environmental Concern ◽  
Type Systems ◽  
Continuous Treatment ◽  
Processing Waste ◽  
Treatment Technology ◽  
Adsorption Effect ◽  
Sulfur Oxidizing ◽  
Sulfur Oxidizing Bacteria

Establishing economic treatment technology for safe disposal of photo-processing waste (PW) has most recently become an urgent environmental concern. This paper describes a new biological treatment process for PW using sulfur-oxidizing bacteria (SOB) in conjunction with activated carbon (AC). Batch-type acclimation and adsorption experiments using SOB/PAC, SOB/PNAC, and SOB reactor type systems demonstrated that AC effectively adsorbs the toxic/refractory compounds which inhibit thiosulfate oxidization of SOB in PW. Thus, to further clarify the effect of AC, we performed a long-term (≈ 160 d) continuous-treatment experiment on 4- to 8-times dilution of PW using a SOB/GAC system which simulated a typical wastewater treatment system based on an aerobic activated sludge process that primarily uses acclimated SOB. The thiosulfate load and hydraulic retention time (HRT) were fixed during treatment such that they ranged from 0.8-3.7 kg S2O32-/l/d and 7.7-1.9 d, respectively. As expected, continuous treatment led to breakthrough of the adsorption effect of GAC. Renewing the GAC and continuing treatment for about 10 d demonstrated good treatment effectiveness.

MEDICAL CYBERNETICS AND BIOMECHANICS: THIRD TYPE SYSTEMS

2020 ◽  
Author(s):  
V. M. Es'kov ◽  
◽  
V. V. Grigorenko ◽  
N. B. Nazina ◽  
◽  
...  
Keyword(s):  
Type Systems
Sign in / Sign up

Export Citation Format

Share Document