3914 search results - page 369 / 783 » Automating SLA modeling |
193
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
154
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
The study of type isomorphisms for different -calculi started over twenty years ago, and a very wide body of knowledge has been established, both in terms of results and in terms o...
192
click to vote
EWCBR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. This paper describes a web-based CBR application competing at the first Computer Cooking Contest at the ECCBR 2008. It describes the technical realisation of our system, ...
194
click to vote
FM
2008
Springer
15 years 8 months ago
2008
Springer
Interface automata provide a formalism capturing the high level interactions between software components. Checking compatibility, and other safety properties, in an automata-based ...
252
click to vote
SPLC
2010
15 years 8 months ago
2010
This paper presents a case study of creating a software product line for the train signaling domain. The Train Control Language (TCL) is a DSL which automates the production of sou...