Titlebook: Reliable Software Technologies -- Ada-Europe 2003; 8th Ada-Europe Inter Jean-Pierre Rosen,Alfred Strohmeier Conference proceedings 2003 Spr

极小量

Modules for Crosscutting Modelsception of the world depends heavily on the context from which it is viewed: Every software system can be viewed from multiple different perspectives, and each of these perspectives may imply a different decomposition of the concerns. The hierarchy which we choose to decompose our software system in

光亮

共和国

High Integrity Ravenscaror deterministic, multi-tasking programming as an integral part of a standardized language. Despite its many advantages, the profile leaves several areas where behaviour is implementation defined and can result in run-time errors; this is unfortunate in a profile aimed clearly at the critical system

喃喃诉苦

Impact of a Restricted Tasking Profile: The Case of the GOCE Platform Application Softwarealyse the binary code to derive bounds on the worst-case execution time for each task, followed by a schedulability analysis using preemptive fixed-priority scheduling. The code-analysis step constrains the sequential coding and the schedulability-analysis step constrains the concurrency design (tas

同时发生

Coronation

A Comparison of the Asynchronous Transfer of Control Features in Ada and the Real-Time Specificationource such as another thread or an interrupt handler. ATC is useful for several purposes; e.g. expressing common idioms such as timeouts and thread termination, and reducing the latency for responses to events. However, ATC presents significant issues semantically, methodologically, and implementati

供过于求

佛刊

Busy Wait Analysised bad practice because (1) system failures may occur due to race conditions and (2) system resources are wasted by busy wait loops. In general finding a busy wait loop is an undecidable problem. To get a handle on the problem, we introduce a decidable predicate for loops that will spot most importa

恶意

Eliminating Redundant Range Checks in GNAT Using Symbolic EvaluationRange checks that cannot be eliminated by the compiler must be executed at run-time, inducing execution time and code size overhead. In this work we propose a new approach for eliminating range checks that is based on symbolic evaluation. Type information provided by the underlying programming langu

干涉