Sciweavers

1023 search results - page 173 / 205
» A Formal Method for Program Slicing
Sort
View
WWW
2005
ACM
16 years 2 months ago
OWL DL vs. OWL flight: conceptual modeling and reasoning for the semantic Web
The Semantic Web languages RDFS and OWL have been around for some time now. However, the presence of these languages has not brought the breakthrough of the Semantic Web the creat...
Axel Polleres, Dieter Fensel, Jos de Bruijn, Rub&e...
RECOMB
2005
Springer
16 years 1 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
IWPC
2008
IEEE
15 years 7 months ago
Ensuring Well-Behaved Usage of APIs through Syntactic Constraints
Libraries are the most widespreaded form of software reuse. In order to properly use a library API, its clients should fulfill a series of (many times implicit) assumptions made ...
Martin Feilkas, Daniel Ratiu
MEMOCODE
2007
IEEE
15 years 7 months ago
Scheduling as Rule Composition
Bluespec is a high-level hardware description language used for architectural exploration, hardware modeling and synthesis of semiconductor chips. In Bluespec, one views hardware ...
Nirav Dave, Arvind, Michael Pellauer
CASES
2006
ACM
15 years 7 months ago
Memory optimization by counting points in integer transformations of parametric polytopes
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
Rachid Seghir, Vincent Loechner