Sciweavers

1410 search results - page 197 / 282
» Proving theorems by reuse
Sort
View
ICTAC
2005
Springer
14 years 3 months ago
Finding Resource Bounds in the Presence of Explicit Deallocation
Abstract. A software program requesting a resource that is not available usually raises an out-of-resource exception. Component software is software that has been assembled from st...
Hoang Truong, Marc Bezem
EMSOFT
2003
Springer
14 years 3 months ago
Constraint-Based Design-Space Exploration and Model Synthesis
An important bottleneck in model-based design of embedded systems is the cost of constructing models. This cost can be significantly decreased by increasing the reuse of existing m...
Sandeep Neema, Janos Sztipanovits, Gabor Karsai, K...
FM
2003
Springer
107views Formal Methods» more  FM 2003»
14 years 3 months ago
Verifying Emulation of Legacy Mission Computer Systems
Processor obsolescence is a serious maintenance problem for long-lived embedded control systems. A practical solution is to interpose an emulator program between the ‘legacy’ s...
Colin J. Fidge
ICLP
2003
Springer
14 years 3 months ago
Termination Analysis with Types Is More Accurate
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
Vitaly Lagoon, Frédéric Mesnard, Pet...
PFE
2001
Springer
14 years 2 months ago
Quantifying Product Line Benefits
Software product lines promise benefits like development and maintenance effort reduction, time to market decrease, and quality improvement, all resulting from planned and systemat...
Peter Knauber, Jesús Bermejo Muñoz, ...