Sciweavers

3374 search results - page 627 / 675
» Explaining Similarity of Terms
Sort
View
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 11 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
FP
1989
124views Formal Methods» more  FP 1989»
13 years 11 months ago
Deriving the Fast Fourier Algorithm by Calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
Geraint Jones
ACMICEC
2007
ACM
168views ECommerce» more  ACMICEC 2007»
13 years 11 months ago
Designing novel review ranking systems: predicting the usefulness and impact of reviews
With the rapid growth of the Internet, users' ability to publish content has created active electronic communities that provide a wealth of product information. Consumers nat...
Anindya Ghose, Panagiotis G. Ipeirotis
AOSD
2007
ACM
13 years 11 months ago
Using natural language program analysis to locate and understand action-oriented concerns
Most current software systems contain undocumented high-level ideas implemented across multiple files and modules. When developers perform program maintenance tasks, they often wa...
David Shepherd, Zachary P. Fry, Emily Hill, Lori L...
AOSD
2007
ACM
13 years 11 months ago
Join point selectors
One of the main issues in modern aspect-oriented programming languages and frameworks is the expressiveness of the pointcut language or mechanism. The expressiveness of pointcut l...
Cristiano Breuel, Francisco Reverbel