Welcome to EMSOFT 2013, the 13th International Conference on Embedded Software, held in Montreal, Quebec, Canada, on September 29 - October 4, 2013.
Since 2007, EMSOFT conferences series have been held as part of the Embedded Systems Week (ESWeek), a premier academic forum for embedded systems researchers, also including the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES) and the International Conference on Hardware-Software Codesign and System Synthesis (CODES/ISSS). 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.
Proceeding Downloads
A synchronous embedding of Antescofo, a domain-specific language for interactive mixed music
Antescofo is recently developed software for musical score following and mixed music: it automatically, and in real-time, synchronizes electronic instruments with a musician playing on a classical instrument. Therefore, it faces some of the same major ...
Determinate composition of FMUs for co-simulation
- David Broman,
- Christopher Brooks,
- Lev Greenberg,
- Edward A. Lee,
- Michael Masin,
- Stavros Tripakis,
- Michael Wetter
In this paper, we explain how to achieve deterministic execution of FMUs (Functional Mockup Units) under the FMI (Functional Mockup Interface) standard. In particular, we focus on co-simulation, where an FMU either contains its own internal simulation ...
BPDF: a statically analyzable DataFlow model with integer and Boolean parameters
Dataflow programming models are well-suited to program many-core streaming applications. However, many streaming applications have a dynamic behavior. To capture this behavior, parametric dataflow models have been introduced over the years. Still, such ...
An efficient code update solution for wireless sensor network reprogramming
We present an incremental code update strategy used to efficiently reprogram wireless sensor nodes. We adapt a linear space and quadratic time algorithm (Hirschberg's algorithm) for computing maximal common subsequences to build an edit map specifying ...
Middleware design for physically-asynchronous logically-synchronous (PALS) systems
The Physically-Asynchronous Logically-Synchronous (PALS) system is a recently proposed architectural pattern for cyber-physical systems. It guarantees a logically synchronous design abstraction for real-time distributed computations. In this work, we ...
Diversifying wear index for MLC NAND flash memory to extend the lifetime of SSDs
NAND flash-based solid state drives (SSDs) are replacing magnetic disks because of their fast random access performance, shock resistance, and low power consumption. However, the number of program and erase cycles that can be performed on NAND flash is ...
Safety verification for linear systems
An embedded software controller is safe if the composition of the controller and the plant does not reach any unsafe state starting from legal initial states (in an unbounded time horizon). Linear systems -- specified using linear ordinary differential ...
Bit-precise formal verification of discrete-time MATLAB/Simulink models using SMT solving
Matlab/Simulink is widely used for model-based development of embedded systems. In particular, safety-critical applications are increasingly designed in Matlab/Simulink. At the same time, formal verification techniques for Matlab/Simulink are still rare ...
Verifying simulink diagrams via a hybrid hoare logic prover
Simulink is an industrial de-facto standard for building executable models of embedded systems and their environments, facilitating validation by simulation. Due to the inherent incompleteness of this form of system validation, complementing simulation ...
A characterization of integrated multi-view modeling in the context of embedded and cyber-physical systems
- Magnus Persson,
- Martin Törngren,
- Ahsan Qamar,
- Jonas Westman,
- Matthias Biehl,
- Stavros Tripakis,
- Hans Vangheluwe,
- Joachim Denil
Embedded systems, with their tight technology integration, and multiple requirements and stakeholders, are characterized by tightly interrelated processes, information and tools. Embedded systems will as a consequence be described by multiple, ...
Diversely enumerating system-level architectures
Embedded systems are highly constrained, and modern constraint solvers can be used to synthesize architectures satisfying constraints. However, solvers may enumerate solutions with bias yielding a skewed view of the solution space. In this paper we ...
On the schedulability of real-time discrete-event systems
We consider end-to-end latency specifications for hard real-time embedded systems. We introduce a discrete-event programming model generalizing such specifications, and address its schedulability problem for uniprocessor systems. This turns out to be ...
On composing and proving the correctness of reactive behavior
We present a method and a tool for composing a reactive system and for accompanying the development and documentation process with a proof of its correctness. The approach is based on behavioral programming (BP) and the Z3 SMT solver. We show how ...
Time-aware relational abstractions for hybrid systems
Hybrid Systems model both discrete switches and continuous dynamics and are suitable to represent embedded systems where discrete controllers interact with a physical plant.
Relational abstraction is a new approach for verifying hybrid systems. In ...
Path-sensitive resource analysis compliant with assertions
We consider the problem of bounding the worst-case resource usage of programs, where assertions about valid program executions may be enforced at selected program points. It is folklore that to be precise, path-sensitivity (up to loops) is needed. This ...
Simple analysis of partial worst-case execution paths on general control flow graphs
One of the most important computations in static worst-case execution time analyses is the path analysis which computes the potentially most time-consuming execution path in a program. This is typically done either with an implicit path computation ...
Scheduling of mixed-criticality applications on resource-sharing multicore systems
A common trend in real-time safety-critical embedded systems is to integrate multiple applications on a single platform. Such systems are known as mixed-criticality (MC) systems as the applications are usually characterized by different criticality ...
Limited preemptive scheduling of non-independent task sets
Preemption is a key factor against architectural coupling in concurrent systems. The whole verification process of real-time systems postulates composability in multiple dimensions, including time. As coupling wrecks composability, the design of real-...
A generalized software framework for accurate and efficient management of performance goals
A number of techniques have been proposed to provide run-time performance guarantees while minimizing power consumption. One drawback of existing approaches is that they work only on a fixed set of components (or actuators) that must be specified at ...
StreaMorph: a case for synthesizing energy-efficient adaptive programs using high-level abstractions
This paper presents the concept of adaptive programs, whose computation and communication structures can morph to adapt to environmental and demand changes to save energy and computing resources. In this approach, programmers write one single program ...
Energy-aware thread co-location in heterogeneous multicore processors
Given the wide variety of performance demands for various workloads, the trend in embedded systems is shifting from homogeneous to heterogeneous processors, which have been shown to yield performance and energy saving benefits. A typical heterogeneous ...
Synthesis of fixed-point programs
Several problems in the implementations of control systems, signal-processing systems, and scientific computing systems reduce to compiling a polynomial expression over the reals into an imperative program using fixed-point arithmetic. Fixed-point ...
Stability-aware analysis and design of embedded control systems
Many embedded systems comprise several controllers sharing available resources. It is well known that such resource sharing leads to complex timing behavior that can jeopardize stability of control applications, if it is not properly taken into account ...
Pre-orders for reasoning about stability properties with respect to input of hybrid systems
Pre-orders on systems are the basis for abstraction based verification of systems. In this paper, we investigate pre-orders for reasoning about stability with respect to inputs of hybrid systems. First, we present a superposition type theorem which ...
DIME: time-aware dynamic binary instrumentation using rate-based resource allocation
Program analysis tools are essential for understanding programs, analyzing performance, and optimizing code. Some of these tools use code instrumentation to extract information at runtime. The instrumentation process can alter program behavior such as ...
Verification of annotated models from executions
Simulations can help enhance confidence in system designs but they provide almost no formal guarantees. In this paper, we present a simulation-based verification framework for embedded systems described by non-linear, switched systems. In our framework, ...
WakeScope: runtime WakeLock anomaly management scheme for Android platform
Android provides a WakeLock mechanism for application developers to ensure the proper execution of applications without having to enter the sleep state of a device. When using the WakeLock mechanism, application developers should bear the responsibility ...
Index Terms
Proceedings of the Eleventh ACM International Conference on Embedded Software
Recommendations
Acceptance Rates
| Year | Submitted | Accepted | Rate |
|---|---|---|---|
| EMSOFT '13 | 97 | 27 | 28% |
| EMSOFT '09 | 106 | 33 | 31% |
| Overall | 203 | 60 | 30% |


