Sciweavers

251 search results - page 6 / 51
» Retrenchment, Refinement, and Simulation
Sort
View
GLOBECOM
2010
IEEE
14 years 9 months ago
Routing and Scheduling in Distributed Advance Reservation Networks
Advance reservation of connection requests is a growing focus area and a range of solutions have been proposed. However, most efforts here have focused on scheduling algorithm desi...
Chongyang Xie, Hamad Alazemi, Nasir Ghani
MEMOCODE
2010
IEEE
14 years 9 months ago
LTSs for translation validation of (multi-clocked) SIGNAL specifications
Design of critical embedded systems demands for guarantees on the reliability of the implementation/compilation of a specification. In general, this guarantee takes either the form...
Julio C. Peralta, Thierry Gautier, Loïc Besna...
ENTCS
2008
75views more  ENTCS 2008»
14 years 11 months ago
On the Refinement of Atomic Actions
Inspired by the properties of the refinement development of the Mondex Electronic Purse, we view an atomic action as a family of transitions with a common before-state, and differ...
Richard Banach, Gerhard Schellhorn
ICSE
2003
IEEE-ACM
15 years 4 months ago
A Tutorial on Feature Oriented Programming and Product-Lines
ct Feature Oriented Programming (FOP) is a design methodology and tools for program synthesis. The goal is to specify a target program in terms of the features that it offers, and ...
Don S. Batory
95
Voted
CORR
2008
Springer
108views Education» more  CORR 2008»
14 years 11 months ago
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen