Sciweavers

1882 search results - page 100 / 377
» Transformational Programming and Forests
Sort
View
PODS
1989
ACM
129views Database» more  PODS 1989»
15 years 1 months ago
The Alternating Fixpoint of Logic Programs with Negation
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
Allen Van Gelder
PODS
2010
ACM
170views Database» more  PODS 2010»
15 years 2 months ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...
EDOC
2006
IEEE
15 years 1 months ago
Combining Analysis of Unstructured Workflows with Transformation to Structured Workflows
Abstract-- Analysis of workflows in terms of structural correctness is important for ensuring the quality of workflow models. Typically, this analysis is only one step in a larger ...
Rainer Hauser, Michael Friess, Jochen Malte Kü...
DAC
1995
ACM
15 years 1 months ago
A Transformation-Based Approach for Storage Optimization
High-level synthesis (HLS) has been successfully targeted towards the digital signal processing (DSP) domain. Both application-speci c integrated circuits (ASICs) and application-...
Wei-Kai Cheng, Youn-Long Lin
ICST
2009
IEEE
15 years 4 months ago
Transforming and Selecting Functional Test Cases for Security Policy Testing
In this paper, we consider typical applications in which the business logic is separated from the access control logic, implemented in an independent component, called the Policy ...
Tejeddine Mouelhi, Yves Le Traon, Benoit Baudry