Sciweavers

6167 search results - page 1093 / 1234
» Can Refinement be Automated
Sort
View
LOPSTR
2005
Springer
14 years 3 months ago
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
Partial evaluation of logic programs which contain impure predicates poses non-trivial challenges. Impure predicates include those which produce side-effects, raise errors (or exc...
Elvira Albert, Germán Puebla, John P. Galla...
OTM
2005
Springer
14 years 3 months ago
Document Flow Model: A Formal Notation for Modelling Asynchronous Web Services Composition
This paper presents a formal notation for modelling asynchronous web services composition, using context and coordination mechanisms. Our notation specifies the messages that can b...
Jingtao Yang, Corina Cîrstea, Peter Henderso...
TLCA
2005
Springer
14 years 3 months ago
Privacy in Data Mining Using Formal Methods
There is growing public concern about personal data collected by both private and public sectors. People have very little control over what kinds of data are stored and how such da...
Stan Matwin, Amy P. Felty, István T. Hern&a...
ASSETS
2004
ACM
14 years 3 months ago
Semantic bookmarking for non-visual web access
Bookmarks are shortcuts that enable quick access of the desired Web content. They have become a standard feature in any browser and recent studies have shown that they can be very...
Saikat Mukherjee, I. V. Ramakrishnan, Michael Kife...
ICLP
2004
Springer
14 years 3 months ago
Applying CLP to Predict Extra-Functional Properties of Component-Based Models
A component is the basic re-usable unit of composition to build composite systems by connecting to others through their provided and required ports. Checking the functional complia...
Olivier Defour, Jean-Marc Jézéquel, ...
« Prev « First page 1093 / 1234 Last » Next »