Sciweavers

1410 search results - page 251 / 282
» Proving theorems by reuse
Sort
View
ICSE
2003
IEEE-ACM
14 years 10 months ago
The Grand Challenge of Trusted Components
Reusable components equipped with strict guarantees of quality can help reestablish software development on a stronger footing, by taking advantage of the scaling effect of reuse ...
Bertrand Meyer
CSMR
2004
IEEE
14 years 1 months ago
Supporting Architectural Restructuring by Analyzing Feature Models
In order to lower the risk, reengineering projects aim at high reuse rates. Therefore, tasks like architectural restructuring have to be performed in a way that developed new syst...
Ilian Pashov, Matthias Riebisch, Ilka Philippow
CHI
2002
ACM
14 years 10 months ago
Specifying preferences based on user history
Many applications require users to specify preferences. We support users in this task by letting them define preferences relative to their personal history or that of other users....
Loren G. Terveen, Jessica McMackin, Brian Amento, ...
SAC
2009
ACM
14 years 4 months ago
Matching ThisType to subtyping
The notion of ThisType has been proposed to promote typesafe reuse of binary methods and recently extended to mutually recursive definitions. It is well-known, however, that This...
Chieri Saito, Atsushi Igarashi
CSL
2009
Springer
14 years 4 months ago
Nested Hoare Triples and Frame Rules for Higher-Order Store
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...
Jan Schwinghammer, Lars Birkedal, Bernhard Reus, H...