988 search results - page 62 / 198 » Pseudo-Genetic Algorithmic Composition |
FASE
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. We present a novel algorithm for interface generation of software components. Given a component, our algorithm uses learning techniques to compute a permissive interface ...
CAV
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...
SIGMOD
1999
ACM
15 years 2 months ago
1999
ACM
We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an algorithm that, given a semistructured query q and a set ...
CAV
2012
Springer
13 years 8 days ago
2012
Springer
Abstract. We develop compositional analysis algorithms for detecting nontermination in multithreaded programs. Our analysis explores fair and ultimatelyperiodic executions—i.e., ...
SWAP
2007
14 years 11 months ago
2007
This paper presents a method for encoding OWL-S atomic processes by means of SWRL rules and composing them using a backward search planning algorithm. A description of the prelimin...