In this paper, a sample set of 510 simple searches from the TEL action log 2009 is analyzed for query content and query language. More than half of the queries are for named entiti...
Abstract. Ariola and Felleisen's call-by-need -calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substituti...
We address the problem of analyzing the interaction between WS-BPEL processes. We present a technology chain that starts out with a WS-BPEL process and translates it into a Petri ...
Niels Lohmann, Peter Massuthe, Christian Stahl, Da...
We address the problem of verifying planning domains as used in model-based planning, for example in space missions. We propose a methodology for testing flight rules of planning...
An approach for detecting feature interactions in IETF’s Call Processing Language (CPL) scripts is presented. The approach is logic based in the sense that it uses a logic repre...