1,372,982 research outputs found
Recommended from our members
A Study of Transport Protocols for Wide Area Scientific Applications
No full textThis is the final project report of award "A Study of Transport Protocols for Wide Area Scientific Applications", given by DOE in 2003 to Vishal Misra at Columbia University
A Weighted Grid for Measuring Program Robustness
No full textRobustness is a key issue for all the programs, especially safety critical ones. In the literature, Program Robustness is defined as “the degree to which a system or component can function correctly in the presence of invalid input or stressful environment” (IEEE 1990). Robustness measurement is the value that reflects the Robustness Degree of the program.
In this thesis, a new Robustness measurement technique; the Robustness Grid, is introduced. The Robustness Grid measures the Robustness Degree for programs, C programs in this instance, using a relative scale. It allows programmers to find the program’s vulnerable points, repair them, and avoid similar mistakes in the future.
The Robustness Grid is a table that contains Language rules, which is classified into categories with respect to the program’s function names, and calculates the robustness degree. The Motor Industry Software Reliability Association (MISRA) C language rules with the Clause Program Slicing technique will be the basis for the robustness measurement mechanism.
In the Robustness Grid, for every MISRA rule, a score will be given to a function every time it satisfies or violates a rule. Furthermore, Clause program slicing will be used to weight every MISRA rule to illustrate its importance in the program. The Robustness Grid shows how much each part of the program is robust and effective, and assists developers to measure and evaluate the robustness degree for each part of a program.
Overall, the Robustness Grid is a new technique that measures the robustness of C programs using MISRA C rules and Clause program slicing. The Robustness Grid shows the program robustness degree and the importance of each part of the program. An evaluation of the Robustness Grid is performed to show that it offers new measurements that were not provided before
Orthaga mangiferae Misra 1932
No full text34. Orthaga mangiferae Misra, 1932: 539 Type locality: India Distribution. Indian records: India (Misra 1932, Mathew 2006). Global records: unknown.Published as part of Singh, Navneet, Ranjan, Rahul, Talukdar, Avishek, Joshi, Rahul, Kirti, Jagbir Singh, Chandra, Kailash & Mally, Richard, 2022, A catalogue of Indian Pyraloidea (Lepidoptera), pp. 1-423 in Zootaxa 5197 (1) on page 51, DOI: 10.11646/zootaxa.5197.1.1, http://zenodo.org/record/725229
A Rationale-Based Classification of MISRA C Guidelines
No full textMISRA C is the most authoritative language subset for the C programming language that is a de facto standard in several industry sectors where safety and security are of paramount importance. While MISRA C is currently encoded in 175 guidelines (coding rules and directives), it does not coincide with them: proper adoption of MISRA C requires embracing its preventive approach (as opposed to the "bug finding" approach) and a documented development process where justifiable non-compliances are authorized and recorded as deviations. MISRA C guidelines are classified along several axes in the official MISRA documents. In this paper, we add to these an orthogonal classification that associates guidelines with their main rationale. The advantages of this new classification are illustrated for different kinds of projects, including those not (yet) having MISRA compliance among their objectives
MISRA C, for Security's Sake!
No full textA third of United States new cellular subscriptions in Q1 2016 were for cars.
There are now more than 112 million vehicles connected around the world. The
percentage of new cars shipped with Internet connectivity is expected to rise
from 13% in 2015 to 75% in 2020, and 98% of all vehicles will likely be
connected by 2025. Moreover, the news continuously report about "white hat"
hackers intruding on car software. For these reasons, security concerns in
automotive and other industries have skyrocketed. MISRA C, which is widely
respected as a safety-related coding standard, is equally applicable as a
security-related coding standard. In this presentation, we will show that
security-critical and safety-critical software have the same requirements. We
will then introduce the new documents MISRA C:2012 Amendment 1 (Additional
security guidelines for MISRA C:2012) and MISRA C:2012 Addendum 2 (Coverage of
MISRA C:2012 against ISO/IEC TS 17961:2013 "C Secure Coding Rules"). We will
illustrate the relationship between MISRA C, CERT C and ISO/IEC TS 17961, with
a particular focus on the objective of preventing security vulnerabilities (and
of course safety hazards) as opposed to trying to eradicate them once they have
been inserted in the code
The MISRA C Coding Standard and its Role in the Development and Analysis of Safety- and Security-Critical Embedded Software
No full textThe MISRA project started in 1990 with the mission of
providing world-leading best practice guidelines for the
safe and secure application of both embedded control
systems and standalone software. MISRA C is a coding
standard defining a subset of the C language, initially
targeted at the automotive sector, but now adopted
across all industry sectors that develop C software in
safety- and/or security-critical contexts. In this
paper, we introduce MISRA C, its role in the development
of critical software, especially in embedded systems,
its relevance to industry safety standards, as well as
the challenges of working with a general-purpose
programming language standard that is written in natural
language with a slow evolution over the last 40+
years. We also outline the role of static analysis in
the automatic checking of compliance with respect to
MISRA C, and the role of the MISRA C language subset in
enabling a wider application of formal methods to
industrial software written in C
Nonlocality of the Misra-Prigogine-Courbage semigroup
No full textWe show that the Markov semigroups constructed by Misra, Prigogine, and Courbage through nonunitary similarity transformations of Kolmogorov systems are not implementable by local point transformations, i.e. they are not the Frobenius-Perron semigroups associated with noninvertible point transformations, in contrast with the semigroups obtained by coarse-graining projections. Our result is a straightforward generalization of the proof of the nonlocality of the similarity transformation given by Goldstein, Misra, and Courbage and also of the previous illustration by Misra and Prigogine for the baker transformation and completes the characterization of the Misra-Prigogine-Courbage semigroups. © 1994 Plenum Publishing corporation.SCOPUS: ar.jinfo:eu-repo/semantics/publishe
Chess Is Hard Even for a Single Player
No full textWe introduce a generalization of "Solo Chess", a single-player variant of the game that can be played on chess.com. The standard version of the game is played on a regular 8 × 8 chessboard by a single player, with only white pieces, using the following rules: every move must capture a piece, no piece may capture more than 2 times, and if there is a King on the board, it must be the final piece. The goal is to clear the board, i.e, make a sequence of captures after which only one piece is left. We generalize this game to unbounded boards with n pieces, each of which have a given number of captures that they are permitted to make. We show that Generalized Solo Chess is NP-complete, even when it is played by only rooks that have at most two captures remaining. It also turns out to be NP-complete even when every piece is a queen with exactly two captures remaining in the initial configuration. In contrast, we show that solvable instances of Generalized Solo Chess can be completely characterized when the game is: a) played by rooks on a one-dimensional board, and b) played by pawns with two captures left on a 2D board. Inspired by Generalized Solo Chess, we also introduce the Graph Capture Game, which involves clearing a graph of tokens via captures along edges. This game subsumes Generalized Solo Chess played by knights. We show that the Graph Capture Game is NP-complete for undirected graphs and DAGs. © N.R. Aravind, Neeldhara Misra, and Harshil Mittal
Principle of Virtual Work as Foundational Framework for Metamaterial Discovery and Rational Design|Le principe des puissances virtuelles comme cadre de base pour la découverte et la conception rationnelle des métamatériaux
No full textNovel theories are needed for the discovery of innovative and exotic metamaterial and for their rational design. The current practice of mechanical analyses based upon moribund classical theories and experimental trial-error campaigns is caught in an inescapable vortex and illusion of inductive reasoning. The needed novel research paradigm is one in which the formulation of theoretical concepts precede their experimental validation. In the absence of theoretical understanding, the design experiments and collection of experimental evidence will remain unavoidably circumscribed. History of science can provide us guidance in the search for the needed powerful tools required for discovery. The principle of virtual work provides the necessary framework for development of theories that can lead to novel metamaterials, as it was the unifying principle which allowed the French-Italian School, headed by D’Alembert, Lagrange and Gabrio Piola, to found modern continuum mechanics. Based upon this framework we have conceived a metamaterial synthesis schema that exploits micro-macro identification traceable to the early days of the formulation of continuum theories for deformable solids. The schema is illustrated with application to metamaterials with pantographic and granular motifs based upon higher-gradient and higher-order theories
- …
