Search Sciweavers | Sciweavers

27

TLCA
2009
Springer

147views Theoretical Computer Science» more TLCA 2009»

On the Values of Reducibility Candidates

14 years 2 months ago

The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly...

Colin Riba

claim paper

Read More »

19

click to vote

SEFM
2009
IEEE

128views Software Engineering» more SEFM 2009»

Adjusted Verification Rules for Loops Are More Complete and Give Better Diagnostics for Less

14 years 2 months ago

Download users.encs.concordia.ca

—Increasingly, tools and their underlying theories are able to cope with “real code” written as part of industrial grade applications almost as is. It has been our experience...

Patrice Chalin

claim paper

Read More »

21

click to vote

DAWAK
2005
Springer

125views Information Technology» more DAWAK 2005»

Semantic Query Expansion Combining Association Rules with Ontologies and Information Retrieval Techniques

14 years 1 months ago

Download www.cis.drexel.edu

Min Song, Il-Yeol Song, Xiaohua Hu, Robert B. Alle...

claim paper

Read More »

22

click to vote

GG
2004
Springer

73views Theoretical Computer Science» more GG 2004»

Rule Execution in Graph-Based Incremental Interactive Integration Tools

14 years 1 months ago

Download www.easst.org

Abstract. Development processes in engineering disciplines are inherently complex. Throughout the development process, different kinds of inter-dependent design documents are creat...

Simon M. Becker, Sebastian Lohmann, Bernhard Westf...

claim paper

Read More »

16

click to vote

KCAP
2003
ACM

107views Information Technology» more KCAP 2003»

Evaluating expert-authored rules for military reasoning

14 years 1 months ago