Formal Annotations Research Articles

Basic Computer Architecture and Quantitative Techniques in Computer Design Instruction Pipeline ,Arithmetic Pipeline, Hazards ,Exception and Interrupts

We talk about the quantitative approach to computer architecture in this paper. We also go over Amdahl's Law, scalability, parallelism, and the principle of locality in relation to quantitative measurement. We also demystify computer architecture by focusing on smart technical design and cost- performance-power trade-offs. In the context of computer architecture, we think the field has continued to develop and move toward the exacting quantitative foundation of venerable scientific and technical disciplines. The pipelining principles in processor design are the focus of this study.The fundamentals of the instruction pipeline are covered, and an example-based explanation of how to reduce a pipeline delay is provided.The primary goal is to comprehend how a processor's pipeline functions.The different risks that lead to pipeline deterioration are described, along with ways to reduce them. Architecture-based development environments are emerging as a useful tool for building reliable distributed systems. By means of the abstract characterization of intricate software Software reuse and evolution are encouraged in terms of system topologies that involve the interface- level interaction of software parts. Furthermore, as evidenced by research findings in the field of software architecture, it becomes possible to offer formal annotations for the accurate characterization of configuration behavior together with related CASE tools for automated analysis. Nevertheless, while being essential to attaining software resilience, software fault tolerance—and specifically exception management in that context—has received little attention. Keywords: Instruction Pipeline ,Arithmetic Pipeline, Hazards

Using a whole genome co-expression network to inform the functional characterisation of predicted genomic elements from Mycobacterium tuberculosis transcriptomic data.

A whole genome co-expression network was created using Mycobacterium tuberculosis transcriptomic data from publicly available RNA-sequencing experiments covering a wide variety of experimental conditions. The network includes expressed regions with no formal annotation, including putative short RNAs and untranslated regions of expressed transcripts, along with the protein-coding genes. These unannotated expressed transcripts were among the best-connected members of the module sub-networks, making up more than half of the 'hub' elements in modules that include protein-coding genes known to be part of regulatory systems involved in stress response and host adaptation. This data set provides a valuable resource for investigating the role of non-coding RNA, and conserved hypothetical proteins, in transcriptomic remodelling. Based on their connections to genes with known functional groupings and correlations with replicated host conditions, predicted expressed transcripts can be screened as suitable candidates for further experimental validation.

Formal Semantic Annotations for Models Interoperability in a PLM environment

Nowadays, the need for system interoperability in or across enterprises has become more and more ubiquitous. Lots of research works have been carried out in the information exchange, transformation, discovery and reuse. One of the main challenges in these researches is to overcome the semantic heterogeneity between enterprise applications along the lifecycle of a product. As a possible solution to assist the semantic interoperability, semantic annotation has gained more and more attentions and is widely used in different domains. In this paper, based on the investigation of the context and the related works, we identify some existing drawbacks and propose a formal semantic annotation approach to support the semantics enrichment of models in a PLM environment.

Object-Component Development of Application and Systems Theory and Practice

The Оbject-Componet Development (ОCD) is a variety of the compositional programmings, where a role of elements of assembling is warmed by objects, interfaces and components. For developing application systems, the theory of design of subject domain based on Frege object theory is developed, together with the presentation of their functions by methods and interfaces with formal annotations for saving them in libraries. Mathematical vehicle ОCDs are models, methods, algebra of operations of objective analysis and their configuring with the use of the component algebra of running, evolution and transformation of data types that are passed between objects through interfaces. Row of the theoretical and applied aspects ОCD was realized in the instrumental-technological complex (IТC) as CASE-instruments of web-site http://sestudy.edu-ua.net. With their help the students can study, create, model, certify and accumulate or configure the objects and components into repository of ITC, and also assemble together from them in more complex applied systems.

The syntax and semantics of a domain-specific language for flow-network design

Flow networks are inductively defined, assembled from small components to produce arbitrarily large ones, with interchangeable functionally-equivalent parts. We carry out this induction formally using a domain-specific language (DSL). Associated with our DSL are a semantics and a typing theory. The latter gives rise to a system of formal annotations that enforce desirable properties of flow networks as invariants across their interfaces. A prerequisite for a typing theory is a formal semantics, i.e., a rigorous characterization of flows that are safe for the network (limited to the notion of feasible flows in this paper, unfeasible flows being considered unsafe). We give a detailed presentation of a denotational semantics only, but also point out the elements that an equivalent operational semantics must include.

A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks (Preliminary Report)

We define a domain-specific language (DSL) to inductively assemble flow networks from small networks or modules to produce arbitrarily large ones, with interchangeable functionally-equivalent parts. Our small networks or modules are "small" only as the building blocks in this inductive definition (there is no limit on their size). Associated with our DSL is a type theory, a system of formal annotations to express desirable properties of flow networks together with rules that enforce them as invariants across their interfaces, i.e, the rules guarantee the properties are preserved as we build larger networks from smaller ones. A prerequisite for a type theory is a formal semantics, i.e, a rigorous definition of the entities that qualify as feasible flows through the networks, possibly restricted to satisfy additional efficiency or safety requirements. This can be carried out in one of two ways, as a denotational semantics or as an operational (or reduction) semantics; we choose the first in preference to the second, partly to avoid exponential-growth rewriting in the operational approach. We set up a typing system and prove its soundness for our DSL.

Intentional Control and Operational Constraints in Prosodic Phrasing: A Study of Picture-elicited Narrations by French Children

This study deals with the determinants of prosodic phrasing in French schoolchildren's narratives. Children (aged 7 to 11) told picture stories to a silent same-age peer. The establishment of temporal and/or causal relations between the events was more or less guided by the drawings (ordered vs. arbitrary sequences). The comprehension of the referential links was more or less supported by the way the frames were displayed (simultaneous vs. consecutive display mode). Four storytelling conditions that differed by the constraints imposed on inference-resolving and memory-searching were thus defined. Naïve French listeners were asked to segment tape-recorded narrations using prosodic variation as a criterion, and to decide whether each prosodic segment was "conclusive" or "continuative." The comparison of the listeners' segmentation labels to those of an expert (functional and formal annotation) showed that more than 91% of the labels corresponded to prosodic boundaries and more than 78% of the non-terminal labels corresponded to non-terminal boundaries, but only 55% of the terminal labels corresponded to terminal boundaries. The storytellers' boundaries were then analyzed as a function of age and storytelling conditions. Non-terminal and terminal boundaries varied with the picture-display mode. Terminal boundaries also depended on the type of event sequence, and non-terminal boundaries on the improvement of the linguistic and communicative skills of the narrators. Terminal judgments of non-terminal boundaries mainly occurred in texts where each event was told in a single proposition either without anaphoric references to the main character or with anaphoric pronouns.

Multimedia indexing through multi-source and multi-language information extraction: the MUMIS project

We describe our work on information extraction from multiple sources for the Multimedia Indexing and Searching Environment, a project aiming at developing technology to produce formal annotations about essential events in multimedia programme material. The creation of a composite index from multiple and multi-lingual sources is a unique aspect of this project. The domain chosen for tuning the software components and testing is football. Our information extraction system is based on the use of finite state machinery pipelined with full semantic analysis and discourse interpretation.

A formal approach to object-oriented software engineering

We show how formal specifications can be integrated into one of the current pragmatic object-oriented software development methods. Jacobson's “object-oriented software engineering” process is combined with object-oriented algebraic specifications by extending object and interaction diagrams with formal annotations. The specifications are based on Meseguer's rewriting logic and are written in a meta-level extension of the language Maude by process expressions. As a result any such diagram can be associated with a formal specification, proof obligations ensuring invariant properties can be automatically generated, and the refinement relations between documents at different abstraction levels can be formally stated and proved.

PARFORMAN—AN ASSERTION LANGUAGE FOR SPECIFYING BEHAVIOR WHEN DEBUGGING PARALLEL APPLICATIONS

PARFORMAN (PARallel FORMal ANnotation language) is a high-level specification language for expressing intended behavior or known types of error conditions when debugging or testing parallel programs. Models of intended or faulty target program behavior can be succinctly specified in PARFORMAN. These models are then compared with the actual behavior in terms of execution traces of events, in order to localize possible bugs. PARFORMAN can also be used as a general language for expressing computations over target program execution histories. PARFORM AN is based on a precise model of target program behavior. This model, called H-space (History-space), is formally defined through a set of general axioms about three basic relations, which may or may not hold between two arbitrary events: they may be sequentially ordered (SEQ), they may be parallel (PAR), or one of them might be included in another composite event (IN). The general notion of composite event is exploited systematically, which makes possible more powerful and succinct specifications. The notion of event grammar is introduced to describe allowed event patterns over a certain application domain or language. Auxiliary composite events such as Snapshots are introduced to be able to define the notion “occurred at the same time” at suitable levels of abstraction. Finally, patterns and aggregate operations on events are introduced to make possible short and readable specifications. In addition to debugging and testing, PARFORMAN can also be used to specify profiles and performance measurements.

A Formal Approach to Object-Oriented Software Engineering

The goal of this paper is to show how formal specifications can be integrated into one of the current pragmatic object-oriented software development methods. Jacobson's method OOSE (“Object-Oriented Software-Engineering”) is combined with object-oriented algebraic specifications by extending object and interaction diagrams with formal annotations. The specifications are based on Meseguer's Rewriting Logic and are written in an extension of the language Maude by process expressions. As a result any such diagram can be associated with a formal specification, proof obligations ensuring invariant properties can be automatically generated, and the refinement relations between documents on different abstraction levels can be formally stated and proved. Finally, we provide a schematic translation of the specification to Java and thus an automatic generation of an object-oriented implementation.

LARS DAVIDSON REQUE: PIONEER

LARS DAVIDSON REQUE: PIONEER1 By A. Sophie B0e Lars Davidson Reque was born on June 4, 1818, on the gaard Reque in Voss, Norway. This farmstead was beautifully located on the side of a steep mountain rising above a large lake, and on this place five gaardsmcend (farmers) together with several husmœnd (cotters) and their families lived. Each farm had its own name - Opistaavo , Opigaren, Utegaren , Bortegaren , and Nig ar en - according to its location . All five of the farm owners used the name Reque, although few, if any of them, were related. Lars D. Reque's parents were David Ericksen Reqve2 and Kari Larsdatter Schiple (Skipie) . He had one brother, Erich, and three sisters, Guri, Johanna, and Gudve. The family was one of moderate means, but its members represented an intelligent type of peasant. In April, 1839, when Lars Reque was about twenty years old, he and four of his friends decided to emigrate to America to seek their fortune in the new world. Several Vossings had already emigrated, and their letters were read with great interest. A large group had met in the Reque home to hear the reading of Ole Rynning's True Account of America (1838), and this had inspired others, among them Lars Reque, to go. 1 The present article, written by a granddaughter of Lars Davidson Reque, is based both upon family traditions and upon written records. Since the quotations drawn from the latter can in most cases be readily traced to their sources, no attempt has been made by the editor to supply formal annotations. Ed. 2 In the old family Bible, in Lars Reque's certificate of baptism, and on old family chests brought to this country from Norway, the name is spelled Reqve. Reque himself wrote it this way, but in his later years adopted the use of k instead of q. The form Reque , however, as followed in these pages, is sanctioned by general usage. SO LARS DAVIDSON REQUE : PIONEER 31 In Bergen Reque and his companions went on board a little sailboat bound directly for New York - the first emigrant ship, according to Nils A. Lee, to leave that harbor. According to K. A. Rene there were about twenty men from Voss sailing on this boat, eleven of them being married men with their families. A salute was given from the fort as they left, and it was answered by those on board who had firearms. After nine weeks and two days of stormy and perilous sailing, during which time the pumps had been constantly in operation, the leaky little schooner reached New York on July 4. Cannons were booming in the forts of the harbor, and shooting and other noises were heard from the shore. The emigrants were frightened, for they thought their boat was being bombarded from the fort. They had anticipated an attack by Indians and had, before leaving, equipped themselves with such firearms as they could muster, but they had not expected to be attacked so soon. They were relieved, however, to see that none of the shots struck the boat, and happy when they learned the significance of the day and the true reason for the shooting. Reque was much impressed by the steamboats that he saw in the harbor, and still more by all the wonderful things he witnessed after landing. Locomotives and matches overwhelmed him with wonder, although the latter filled him with a superstitious fear. All this magnificence, however, made him feel depressed, for he thought it would be hard for a greenhorn like himself to make any progress in such a wonderful country. In New York the immigrants met a man from Bergen by the name of Trompsei, who made arrangements for them to travel to Buffalo. Each adult person paid this man four dollars for himself and baggage. From New York they went up the Hudson River to Albany on a steamboat that had nine other vessels, prob- 32 STUDIES AND RECORDS ably freight boats, attached to it. Here all their baggage was weighed. From Albany they went to Schenectady by a train which consisted of fifteen cars, including freight cars and engine. This trip capped the climax...