126 search results - page 4 / 26 » Quantifying the closeness between program components and fea... |
BCS
2008
13 years 8 months ago
2008
Research in formal description of programming languages over the past four decades has led to some significant achievements. These include formal syntax and semantics for complete...
SAC
2008
ACM
13 years 6 months ago
2008
ACM
Complexity in concurrent or distributed systems can be managed by dividing component into smaller components. However, such transformations change the coordination behaviour betwe...
OMER
2001
13 years 8 months ago
2001
: This paper shows how architecture description languages can be tailored to the design of embedded automotive control software. Furthermore, graphical modeling means are put in an...
ISMVL
1999
IEEE
13 years 11 months ago
1999
IEEE
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
ECOOP
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. The expression families problem can be defined as the problem of achieving reusability and composability across the components involved in a family of related datatypes a...