Semantics of ModPascal

A denotational semantics is given for the programming language ModPascal, an object oriented procedural language. It employs concepts of abstract data type theory: heterogenous order algebras with strict operations describe the semantics of types and of a complete program, and the parameterization concept of ModPascal is based on explicit actualization by signature morphisms. This allows to treat standard language objects and user-defined objects in a uniform and sound way. Additionally; the semantic domain structure is able to support equivalence proofs in the transition from applicative languages to ModPascal as it is necessary in software development environments

On a Connection between Procedural and Applicative Languages

This paper reports on the connection between procedural and applicative languages. It presents features, notions and methods derived from abstract data type theory that in our judgement are helpful and necessary for multi-level software engineering environments in general, and especially for the treatment of verification issues there. Reference is made to an existing software engineering system and exemplary languages of it. A denotational semantics based on algebraic structures is introduced and employed. Since object-orientedness is looked at as one of the most important properties of such environments the notion of correctness is applied to objects and object relations. Finally a realistic semi-automatic method for the check of correctness criteria is given, accompanied by remarks on our existing implementation

ModPascal report

The object oriented programming language ModPascal and its programming environment are introduced. ModPascal extends Standard Pascal by constructs that have shown usefullness in abstract data type- theory: module types, enrichments, instantiations and instantiate types. In fact, ModPascal has been designed as procedural counterpart of a specification language based on abstract data types; and its semantics also employs algebraic structures. ModPascal programs may be edited, compiled and executed by using the ModPascal Programming System that includes a multi-user data base for ModPascal objects

V-SUIT Model Validation Using PLSS 1.0 Test Results

The dynamic portable life support system (PLSS) simulation software Virtual Space Suit (V-SUIT) has been under development at the Technische Universitat Munchen since 2011 as a spin-off from the Virtual Habitat (V-HAB) project. The MATLAB(trademark)-based V-SUIT simulates space suit portable life support systems and their interaction with a detailed and also dynamic human model, as well as the dynamic external environment of a space suit moving on a planetary surface. To demonstrate the feasibility of a large, system level simulation like V-SUIT, a model of NASA's PLSS 1.0 prototype was created. This prototype was run through an extensive series of tests in 2011. Since the test setup was heavily instrumented, it produced a wealth of data making it ideal for model validation. The implemented model includes all components of the PLSS in both the ventilation and thermal loops. The major components are modeled in greater detail, while smaller and ancillary components are low fidelity black box models. The major components include the Rapid Cycle Amine (RCA) CO2 removal system, the Primary and Secondary Oxygen Assembly (POS/SOA), the Pressure Garment System Volume Simulator (PGSVS), the Human Metabolic Simulator (HMS), the heat exchanger between the ventilation and thermal loops, the Space Suit Water Membrane Evaporator (SWME) and finally the Liquid Cooling Garment Simulator (LCGS). Using the created model, dynamic simulations were performed using same test points also used during PLSS 1.0 testing. The results of the simulation were then compared to the test data with special focus on absolute values during the steady state phases and dynamic behavior during the transition between test points. Quantified simulation results are presented that demonstrate which areas of the V-SUIT model are in need of further refinement and those that are sufficiently close to the test results. Finally, lessons learned from the modelling and validation process are given in combination with implications for the future development of other PLSS models in V-SUIT

Psychosocial Developmental Levels of Freshman Urban University Students With Learning Disabilities

This research study addressed the question, Is there a difference in psychosocial developmental levels, as defined by Arthur Chickering, between male and female traditional-aged urban university freshmen with and without learning disabilities? Twenty students with learning disabilities, as diagnosed by independent practitioners who exhibited spelling disabilities on a writing sample placement test, were compared to two comparable groups of twenty students. One comparison group did not exhibit spelling disability. The second group while demonstrating spelling problems, did not have documentation of learning disabilities. The Student Developmental Task and Lifestyle Inventory, a measure of Arthur Chickering\u27s theory of psychosocial development, was administered by university personnel during the summer prior to matriculation. Scores were analyzed by an analysis of covariance using Scholastic Aptitude Test scores as the covariate. Structured interviews to confirm the data were conducted with eight of the students in the group with learning disabilities. Findings revealed no significant differences between the three groups. This knowledge is helpful to professionals in higher education as they work with students needing accommodations for learning disabilities. Programs should emphasize the academic needs for these students. These findings contrast with the professional literature which predicts that these students would be less developed in psychosocial characteristics

Ape: An Expert System for Automatic Programming from Abstract Specifications of Data Types and Algorithms

The APE (Automatic Programming Expert) system constructs executable and efficient programs from algebraic specifications of abstract data types, and abstract algorithms given as conditional term-rewrite-rule-systems with terms built up from operation symbols of the abstract data types involved. The APE is an experimental system devised to develop methods for codifying a rather Broad extent of programming knowledge required to construct implementations of data types and algorithms. For data type specifications, the APE admits hidden operations, conditional axioms, and parameterized data types. The APE automatically implements algebraic specifications of all commonly known data types in terms of clusters of INTERLISP-functions. The APE constructs executable implementations of a variety of sorting and searching algorithms. As an experimental prototype, the APE demonstrates that a knowledge-based programming paradigm provides a useful tool for partially automating an important phase of software development