1226 search results - page 78 / 246 » Proofs, Programs and Abstract Complexity |
105
click to vote
SUM
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of infor...
133
click to vote
APLAS
2003
ACM
15 years 7 months ago
2003
ACM
Abstract. Much work has been done in verifying a compiler specification, both in hand-written and mechanical proofs. However, there is still a gap between a correct compiler specif...
119
click to vote
CPP
2011
14 years 3 months ago
2011
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
117
click to vote
CAISE
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. This paper presents a method to compute metrics that predict maintainability of a system with respect to its event processing. The metrics reflect the complexity of event...
116
click to vote
ESOP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract We present the semantics and proof system for an objectoriented language with active objects, asynchronous method calls, and futures. The language, based on Creol, disting...