We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
The majority of work on protection in single-language mobile code environments focuses on information security issues and depends on the language environment for solutions to the ...
abstraction a use case model offers makes it an appropriate startingpointforsoftwaresecurityanalysis and design activities. In contrast, a misuse case describes potential system be...
Modern software codebases are frequently large, heterogeneous, and constantly evolving. The languages and tools for software construction, including code builds and configuration m...