Sciweavers

184 search results - page 27 / 37
» Formal Verification of an Optimizing Compiler
Sort
View
CASES
2006
ACM
14 years 1 months ago
Memory optimization by counting points in integer transformations of parametric polytopes
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
Rachid Seghir, Vincent Loechner
TLDI
2010
ACM
225views Formal Methods» more  TLDI 2010»
14 years 4 months ago
Race-free and memory-safe multithreading: design and implementation in cyclone
We present the design of a formal low-level multi-threaded language with advanced region-based memory management and synchronization primitives, where well-typed programs are memo...
Prodromos Gerakios, Nikolaos Papaspyrou, Konstanti...
ECAI
2008
Springer
13 years 9 months ago
A BDD Approach to the Feature Subscription Problem
Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important s...
Tarik Hadzic, David Lesaint, Deepak Mehta, Barry O...
ICSE
2005
IEEE-ACM
14 years 7 months ago
Real-time specification patterns
Embedded systems are pervasive and frequently used for critical systems with time-dependent functionality. Dwyer et al. have developed qualitative specification patterns to facili...
Sascha Konrad, Betty H. C. Cheng
FM
1999
Springer
104views Formal Methods» more  FM 1999»
13 years 11 months ago
On Excusable and Inexcusable Failures
Abstract. The classical concepts of partial and total correctness identify all types of runtime errors and divergence. We argue that the associated notions of translation correctne...
Markus Müller-Olm, Andreas Wolf