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>

scholarly journals Theoretical Aspects of Semantics-Based Language Implementation

1990 ◽  
Vol 19 (329) ◽  
Author(s):  
Flemming Nielson
Keyword(s):  
Programming Languages ◽  
Program Analysis ◽  
Code Generation ◽  
Program Transformation ◽  
Abstract Interpretation ◽  
Language Implementation

The research summarised here concerns theoretical aspects involved in the implementation of programming languages directly from a description of their semantics. This involves a study of the subtasks <em> abstract interpretation</em> (a framework for program analysis), <em> code generation</em> and <em> program transformation</em> and the main aim has been to ensure the <em> correctness</em> of these subtasks.

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>

Making abstract models complete

2014 ◽  
Vol 26 (4) ◽  
pp. 658-701 ◽  
Author(s):  
ROBERTO GIACOBAZZI ◽  
ISABELLA MASTROENI
Keyword(s):  
Programming Languages ◽  
Program Analysis ◽  
Abstract Interpretation ◽  
False Alarms ◽  
Program Transformations ◽  
Monotone Functions ◽  
Complete Lattices ◽  
Semantics Of Programming Languages ◽  
Mathematical Properties ◽  
Predicate Transformer

Completeness is a key feature of abstract interpretation. It corresponds to exactness of the abstraction of fix-points and relies upon the need of absence of false alarms in static program analysis. Making abstract interpretation complete is therefore a major problem in approximating the semantics of programming languages. In this paper, we consider the problem of making abstract interpretations complete by minimally modifying the predicate transformer, i.e. the semantics, of a program. We study the mathematical properties of complete functions on complete lattices and prove the existence of minimal transformations of monotone functions to achieve completeness. We then apply minimal complete transformers to prove the minimality of standard program transformations in security, such as static program monitoring.

scholarly journals Sequence-based abstract interpretation of Prolog

2001 ◽  
Vol 2 (1) ◽  
pp. 25-84 ◽  
Author(s):  
BAUDOUIN LE CHARLIER ◽  
SABINA ROSSI ◽  
PASCAL VAN HENTENRYCK
Keyword(s):  
Programming Languages ◽  
Abstract Interpretation ◽  
General Interest ◽  
Program Optimization ◽  
Control Structures ◽  
Abstract Domains ◽  
Systematic Development ◽  
Interpretation Algorithm ◽  
Search Rule ◽  
New Framework

Abstract interpretation is a general methodology for systematic development of program analyses. An abstract interpretation framework is centered around a parametrized non-standard semantics that can be instantiated by various domains to approximate different program properties. Many abstract interpretation frameworks and analyses for Prolog have been proposed, which seek to extract information useful for program optimization. Although motivated by practical considerations, notably making Prolog competitive with imperative languages, such frameworks fail to capture some of the control structures of existing implementations of the language. In this paper, we propose a novel framework for the abstract interpretation of Prolog which handles the depth-first search rule and the cut operator. It relies on the notion of substitution sequence to model the result of the execution of a goal. The framework consists of (i) a denotational concrete semantics, (ii) a safe abstraction of the concrete semantics defined in terms of a class of post-fixpoints, and (iii) a generic abstract interpretation algorithm. We show that traditional abstract domains of substitutions may easily be adapted to the new framework, and provide experimental evidence of the effectiveness of our approach. We also show that previous work on determinacy analysis, that was not expressible by existing abstract interpretation frameworks, can be seen as an instance of our framework. The ideas developed in this paper can be applied to other logic languages, notably to constraint logic languages, and the theoretical approach should be of general interest for the analysis of many non-deterministic programming languages.

Forensic learning disability nursing: what's it really like?

2014 ◽  
Vol 5 (4) ◽  
pp. 167-177
Author(s):  
Mark F Dalgarno ◽  
Sharon A Riordan
Keyword(s):  
Learning Disability ◽  
Design Methodology ◽  
Nursing Practice ◽  
Structured Interview ◽  
Phenomenological Analysis ◽  
Forensic Nursing ◽  
Content Type ◽  
Emotional Challenge ◽  
Areas Of Interest

Purpose – The purpose of this paper is to explore the lived experiences of learning disability nurses working within forensic services, and their views on their practice as a speciality. Design/methodology/approach – A qualitative, semi-structured interview-based design was used and participant's voices were examined through interpretive phenomenological analysis. Findings – Nurses explored a range of topics related to their practice and overall, five superordinate themes were developed. Forensic nursing as being both the same and different to generic nursing, the journey, and the emotional challenge of forensic nursing, the balancing act of everyday practice and the role of language within forensic nursing practice. Originality/value – Very little research has examined the views of learning disability nurses within the forensic field. This study gives both a voice to these nurses and suggests areas of interest both for research and for clinicians to consider in their practice.

Programming languages and program analysis for security

2009 ◽  
Vol 43 (12) ◽  
pp. 32-39 ◽  
Author(s):  
Marco Pistoia ◽  
Úlfar Erlingsson
Keyword(s):  
Programming Languages ◽  
Program Analysis

scholarly journals Protection of the Child’s Creative Output Including Its Legal Protection

2014 ◽  
Vol 12 (1) ◽  
Author(s):  
Anna Sokołowska
Keyword(s):  
Creative Process ◽  
Legal Protection ◽  
Legal Aspects ◽  
Rights Of The Child ◽  
Starting Point ◽  
The Subject ◽  
Education And Development ◽  
Areas Of Interest ◽  
Education Process

AbstractThis paper is an attempt to analyze the necessity of defining and extending the protection of the child’s creative process. The starting point for consideration is the key role of artistic instruction in the child’s education and development which justifies providing appropriate framework for that process. The present text defines artistic output as a personal good covered by legal protection and specifies relevant legal regulations underlying the subject. It also reveals the position of the child as a creator with his/her specific characteristics and possible dangers arising from those characteristics. Another issue discussed here is the creative process and its components. In a further part, legal aspects of the child’s situation in the context of creative activity are analyzed with references to the UN Convention on the Rights of the Child (1989), the (Polish) Family and Guardianship Code (1964), the UN Declaration on Rights of the Child (1959) and other legal acts. Finally, the paper addresses objectives of arts education in the light of the discussed issues. Conclusions include an indication of certain similarity between some areas of interest in pedagogy and in law. The main conclusion comes down to a statement that in the education process we should take into consideration so-called creative integrity which constitutes a personal good of both the adult and the child, and which is covered by legal protection.

PRECISION ASSESSMENT OF THE STATE OF BONE TRABECULAE AND MINERAL SATURATION OF BONE SPONGY STRUCTURES IN WORKERS EXPOSED TO CONTACT ULTRASOUND

2021 ◽  
Author(s):  
V.N. Druginin ◽  
◽  
V.G. Suvorov ◽  
A.E. Shelekhova ◽  
◽  
...  
Keyword(s):  
The State ◽  
Control Groups ◽  
Women Doctors ◽  
Working Age ◽  
Negative Role ◽  
Precision Assessment ◽  
Bone Trabeculae ◽  
Areas Of Interest ◽  
Sensory Polyneuropathy

Abstract: A comparative retrospective analysis of the results of a clinical - X-ray examination of 93 women doctors of ultrasound examinations of working age and 60 people was performed. control groups of age and experience comparable work with persons of major groups (nurses not associated with exposure to occupational ultrasound). Degenerative-dystrophic changes were revealed in the form of: osteorthrosis of the shoulder, elbow, wrist and interphalangeal joints, periarthrosis of the shoulder and elbow joints, small cyst-like clearances and enostoses in the bones of the wrists of the most loaded upper limb. The level of decrease in the mineral saturation and thickness of bone trabeculae in the areas of interest of the radius bones and distal phalanges of the hands was dependent on the severity of the clinical picture of vegetative-sensory polyneuropathy. Indicators of bone density and the state of bone trabeculae in the spongy structures of the distal radial bones and distal phalanges can be a kind of marker of the severity of OP. The use of modern methods for assessing the density and structure of bone tissue allows us to reduce the negative role of the so-called "human factor" and thus

Sign in / Sign up

Export Citation Format

Share Document