3914 search results - page 171 / 783 » Automating SLA modeling |
116
Voted
LICS
2000
IEEE
15 years 7 months ago
2000
IEEE
We introduce a new model based on coherence spaces for interpreting large impredicative type systems such as the Extended Calculus of Constructions (ECC). Moreover, we show that t...
128
Voted
TPHOL
1999
IEEE
15 years 6 months ago
1999
IEEE
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
ECSQARU
1997
Springer
15 years 6 months ago
1997
Springer
Abstract. Today, different formalisms exist to solve reasoning problems under uncertainty. For most of the known formalisms, corresponding computer implementations are available. ...
136
Voted
LICS
1990
IEEE
15 years 6 months ago
1990
IEEE
E cient automatic model checking algorithms for real-time systems have been obtained in recent years based on the state region graph technique of Alur, Courcoubetis and Dill. Howev...
86
Voted
CSL
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In [6] J. Laird has shown that an infinitary sequential extenPCF has a fully abstract model in his category of locally boolean domains (introduced in [8]). In this paper ...