374 search results - page 57 / 75 » Using Language Inference to Verify Omega-Regular Properties |
116
click to vote
ICSOC
2009
Springer
14 years 11 months ago
2009
Springer
Several activities in service oriented computing can benefit from knowing ahead of time future properties of a given service composition. In this paper we focus on how statically i...
125
click to vote
FOSSACS
2008
Springer
15 years 2 months ago
2008
Springer
We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor indicating parametric polymorphism. The eras...
189
click to vote
POPL
2009
ACM
16 years 2 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
111
click to vote
GPCE
2007
Springer
15 years 7 months ago
2007
Springer
Programs of a software product line can be synthesized by composing modules that implement features. Besides high-level domain constraints that govern the compatibility of feature...
100
click to vote
NJC
2006
15 years 1 months ago
2006
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...