Sciweavers

1722 search results - page 273 / 345
» Ontology Formalism Transformation
Sort
View
ECOOP
2003
Springer
14 years 3 months ago
A Calculus of Untyped Aspect-Oriented Programs
Abstract. Aspects have emerged as a powerful tool in the design and development of systems, allowing for the encapsulation of program transformations. The dynamic semantics of aspe...
Radha Jagadeesan, Alan Jeffrey, James Riely
ERSHOV
2003
Springer
14 years 3 months ago
On the Possibility of Provably Secure Obfuscating Programs
By obfuscation we mean any efficient semantic-preserving transformation of computer programs aimed at bringing a program into such a form, which impedes the understanding of its al...
Nikolay P. Varnovsky, Vladimir A. Zakharov
PKDD
1998
Springer
123views Data Mining» more  PKDD 1998»
14 years 2 months ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
Jean-François Boulicaut, Mika Klemettinen, ...
APN
1994
Springer
14 years 2 months ago
Coloured Petri Nets Extended with Channels for Synchronous Communication
This paper shows how Coloured Petri Nets (CP-nets) can be extended to support synchronous communication. We introduce coloured communication channels through which transitions are...
Søren Christensen, Niels Damgaard Hansen
PEPM
1994
ACM
14 years 2 months ago
The Essence of Eta-Expansion in Partial Evaluation
Abstract. Selective eta-expansion is a powerful "binding-time improvement", i.e., a sourceprogram modification that makes a partial evaluator yield better results. But li...
Olivier Danvy, Karoline Malmkjær, Jens Palsb...