This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
This poster is a case study on the application of a novel programming model, called Concurrent Collections (CnC), to the implementation of an asynchronous-parallel algorithm for c...
Almost all attempts to monetize internet applications targeted at individuals to date have focused on natural extensions of traditional media or traditional retailing. Most are ei...
Location Based Services (LBS) promise interesting business opportunities. Today, most LBS are either implemented in hardware devices, or downloaded and installed by mobile phone u...
Stephan Karpischek, Fabio Magagna, Florian Michahe...