Welcome to EMSOFT 2014, the 14th International Conference on Embedded Software, held in New Delhi, India, from October 12 to October 17, 2014.
EMSOFT, the International Conference on Embedded Software, is the flagship conference sponsored by ACM SIGBED, the Special Interest Group on Embedded Systems. In this role, EMSOFT seeks to bring together, on an annual basis, researchers and developers from academia, industry, and government to advance the science and the practice of embedded software development. EMSOFT conferences series is part of the Embedded Systems Week (ESWEEK), a premier academic forum for embedded systems researchers.
Proceeding Downloads
Exponentially timed SADF: compositional semantics, reductions, and analysis
This paper presents a rigorous compositional semantics for SADF (Scenario-Aware Data Flow), an extension of SDF for scenario-based embedded system design which has its roots in digital signal processing. We show that Markov automata (MA), a novel ...
Refinement calculus of reactive systems
Refinement calculus is a powerful and expressive tool for reasoning about sequential programs in a compositional manner. In this paper we present an extension of refinement calculus for reactive systems. Refinement calculus is based on monotonic ...
Precise piecewise affine models from input-output data
Formal design and analysis of embedded control software relies on mathematical models of dynamical systems, and such models can be hard to obtain. In this paper, we focus on automatic construction of piecewise affine models from input-output data. Given ...
Embedded software reliability for unreliable hardware
While advancements in chip manufacturing technology has accelerated the growth of embedded systems, it has revealed serious reliability and robustness challenges at various abstraction levels that threaten the applicability of scaled technologies [2, 3]...
Multiple shooting, CEGAR-based falsification for hybrid systems
In this paper, we present an approach for finding violations of safety properties of hybrid systems. Existing approaches search for complete system trajectories that begin from an initial state and reach some unsafe state. We present an approach that ...
SiPTA: signal processing for trace-based anomaly detection
Given a set of historic good traces, trace-based anomaly detection deals with the problem of determining whether or not a specific trace represents a normal execution scenario. Most current approaches mainly focus on application areas outside of the ...
Blaming in component-based real-time systems
In component-based safety-critical real-time systems it is crucial to determine which component(s) caused the violation of a required system-level safety property, be it to issue a precise alert, or to determine liability of component providers. In this ...
A general approach for expressing infeasibility in implicit path enumeration technique
Static timing analysis aims at computing a guaranteed upper bound to the Worst-Case Execution Time (WCET) of a program. It requires both an accurate modeling of the hardware, and a precise analysis of the program in order to reject infeasible executions ...
Computing maximum blocking times with explicit path analysis under non-local flow bounds
Worst-case time (WCET) analyses for single tasks are well established and their results ultimately serve the purpose of providing execution time parameters for schedulability analyses. Besides WCET analysis, an important problem is maximum blocking time ...
Extending typical worst-case analysis using response-time dependencies to bound deadline misses
Weakly-hard time constraints have been proposed for applications where occasional deadline misses are permitted. Recently, a new approach called Typical Worst-Case Analysis (TWCA) has been introduced which exploits similar constraints to bound response ...
Energy efficient DVFS scheduling for mixed-criticality systems
Consolidating functionalities with different safety requirements into a common platform gives rise to mixed-criticality systems. The state-of-the-art research has focused on providing heterogeneous timing guarantees for tasks of varying criticality ...
p-YDS algorithm: an optimal extension of YDS algorithm to minimize expected energy for real-time jobs
The YDS algorithm computes a schedule on a DVS-enabled resource to meet deadlines of all jobs and optimally minimize the total energy consumption. The algorithm requires that an exact execution time of each job be known. For settings where execution ...
Robust strategy synthesis for probabilistic systems applied to risk-limiting renewable-energy pricing
We address the problem of synthesizing control strategies for Ellipsoidal Markov Decision Processes (EMDP), i.e., MDPs whose transition probabilities are expressed using ellipsoidal uncertainty sets. The synthesized strategy aims to maximize the total ...
Deductive control synthesis for alternating-time logics
Algorithmic design of control laws for continuous systems for complex temporal specifications is a key step toward automatic synthesis of controllers for cyber-physical systems. Current approaches either abstract the dynamical system to a finite-state ...
Infinite horizon safety controller synthesis through disjunctive polyhedral abstract interpretation
This paper presents a controller synthesis approach using disjunctive polyhedral abstract interpretation. Our approach synthesizes infinite time-horizon controllers for safety properties with discrete-time, linear plant model and a switching feedback ...
Synthesising optimal timing delays for timed I/O automata
In many real-time embedded systems, the choice of values for the timing delays can crucially affect the safety or quantitative characteristics of their execution. We propose a parameter synthesis algorithm that finds optimal timing delays guaranteeing ...
Automated software testing of memory performance in embedded GPUs
Embedded and real-time software is often constrained by several temporal requirements. Therefore, it is important to design embedded software that meets the required performance goal. The inception of embedded graphics processing units (GPUs) brings ...
On the existence of probe effect in multi-threaded embedded programs
Software instrumentation has been a convenient and portable approach for dynamic analysis, debugging, or profiling of program execution. Unfortunately, instrumentation may change the temporal behavior of multi-threaded program execution and result in ...
Can we put concurrency back into redundant multithreading?
Software-implemented fault tolerance (SIFT) mechanisms allow to tolerate transient hardware faults in commercial off-the-shelf (COTS) systems without using specialized resilient hardware. Unfortunately, existing SIFT methods at both the compiler and the ...
Schedulability analysis of global memory-predictable scheduling
The use of multicore CPUs in real-time systems poses significant challenges in estimating their temporal behavior. A factor that has a large impact on this issue is the contention for access to main memory among multiple cores. To overcome this problem, ...
Supporting read/write applications in embedded real-time systems via suspension-aware analysis
In many embedded real-time systems, applications often interact with I/O devices via read/write operations, which may incur considerable suspension delays. Unfortunately, prior analysis methods for validating timing correctness in embedded systems ...
Task mapping in heterogeneous embedded systems for fast completion time
Graphics processing units are being widely used in embedded systems as they can achieve high performance and energy efficiency. In such systems, the problem of computation and data mapping for multiple applications while minimizing the completion time ...
Contract-based integration of cyber-physical analyses
Developing cyber-physical systems involves multiple engineering domains, e.g., timing, logical correctness, thermal resilience, and mechanical stress. In today's industrial practice, these domains rely on multiple analyses to obtain and verify critical ...
CPSGrader: synthesizing temporal logic testers for auto-grading an embedded systems laboratory
We consider the problem of designing an automatic grader for a laboratory in the area of cyber-physical systems. The goal of this laboratory is to program a robot for specified navigation tasks. Given a candidate student solution (control program for ...
Real-time system support for hybrid structural simulation
- David Ferry,
- Gregory Bunting,
- Amin Maghareh,
- Arun Prakash,
- Shirley Dyke,
- Kunal Agrawal,
- Chris Gill,
- Chenyang Lu
Real-time hybrid simulation (RTHS) is an important tool in the design and testing of civil and mechanical structures when engineers and scientists wish to understand the performance of an isolated component within the context of a larger structure. ...
Parallel many-core avionics systems
Integrated Modular Avionics (IMA) enables incremental qualification by encapsulating avionics applications into software partitions (SWPs), as defined by the ARINC 653 standard. SWPs, when running on top of single-core processors, provide robust time ...
Real-time multi-core virtual machine scheduling in xen
Recent years have witnessed two major trends in the development of complex real-time embedded systems. First, to reduce cost and enhance flexibility, multiple systems are sharing common computing platforms via virtualization technology, instead of being ...
EDF as an arbitration policy for wormhole-switched priority-preemptive NoCs: myth or fact?
A constant increase in the number of processors integrated within multiprocessor platforms led to more apparent contentions for the interconnect medium. Consequently, inter-processor communication latencies significantly outgrew the threshold until ...
Building high-performance smartphones via non-volatile memory: the swap approach
Smartphones are getting increasingly high-performance with advances in mobile processors and larger main memories to support feature-rich applications. However, the storage subsystem has always been a prohibitive factor that slows down the pace of ...
Recommendations
Acceptance Rates
| Year | Submitted | Accepted | Rate |
|---|---|---|---|
| EMSOFT '13 | 97 | 27 | 28% |
| EMSOFT '09 | 106 | 33 | 31% |
| Overall | 203 | 60 | 30% |



