We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
Pavel Avgustinov, Elnar Hajiyev, Neil Ongkingco, O...
This paper describes a language independent linearization engine, oxyGen. This system compiles target language grammars into programs that take feature graphs as inputs and genera...
Software developers create a variety of artifacts that model viour of applications at different levels of abstraction; e.g. use cases, sequence diagrams, and source code. Aspect-o...
Jonathan Sillito, Christopher Dutchyn, Andrew Davi...
Agent-oriented programming has been motivated in part by the conception that high-level programming constructs based on common tions such as beliefs and goals provide appropriate a...