Sciweavers

143 search results - page 25 / 29
» Fixed-Parameter Complexity of Semantics for Logic Programs
Sort
View
ESAW
2006
Springer
15 years 1 months ago
Competence Checking for the Global E-Service Society Using Games
Abstract. We study the problem of checking the competence of communicative agents operating in a global society in order to receive and offer electronic services. Such a society wi...
Kostas Stathis, George Lekeas, Christos Kloukinas
SAC
2009
ACM
15 years 4 months ago
Points-to analysis for JavaScript
JavaScript is widely used by web developers and the complexity of JavaScript programs has increased over the last year. Therefore, the need for program analysis for JavaScript is ...
Dongseok Jang, Kwang-Moo Choe
SIGSOFT
2010
ACM
14 years 7 months ago
Language-based replay via data flow cut
A replay tool aiming to reproduce a program's execution interposes itself at an appropriate replay interface between the program and the environment. During recording, it log...
Ming Wu, Fan Long, Xi Wang, Zhilei Xu, Haoxiang Li...
WWW
2002
ACM
15 years 10 months ago
An event-condition-action language for XML
XML repositories are now a widespread means for storing and exchanging information on the Web. As these repositories become increasingly used in dynamic applications such as e-com...
James Bailey, Alexandra Poulovassilis, Peter T. Wo...
POPL
2010
ACM
15 years 6 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins