Sciweavers

1665 search results - page 197 / 333
» Design Patterns as Language Constructs
Sort
View
AOSD
2011
ACM
14 years 9 months ago
Closure joinpoints: block joinpoints without surprises
Block joinpoints allow programmers to explicitly mark regions of base code as “to be advised”, thus avoiding the need to extract the block into a method just for the sake of c...
Eric Bodden
ERSHOV
2009
Springer
15 years 9 months ago
Standardization and Testing of Mathematical Functions
Abstract. The article concerns problems of formulating standard requirements to implementations of mathematical functions working with floating-point numbers and conformance test ...
Victor V. Kuliamin
110
Voted
FM
2009
Springer
104views Formal Methods» more  FM 2009»
15 years 9 months ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene
133
Voted
IEAAIE
2007
Springer
15 years 8 months ago
An Ontology-Supported and Fully-Automatic Annotation Technology for Semantic Portals
We employ the techniques of ontology and linguistics to develop a fully-automatic annotation technique, which, when coupled with an automatic ontology construction method, can play...
Sheng-Yuan Yang
126
Voted
TLCA
2007
Springer
15 years 8 months ago
Initial Algebra Semantics Is Enough!
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
Patricia Johann, Neil Ghani