ing Allocation

ing Abstraction in Search II: Complexity Analysis Christer Bäckström and Peter Jonsson Department of Computer Science, Linköping University SE-581 83 Linköping, Sweden [email protected] [email protected]

The use of abstraction in problem solving is an eeective approach to reducing search, but nding good abstractions is a diicult problem. The rst algorithm that completely automates the generation of abstraction hierarchies is Knoblock's ALPINE, but this algorithm is only able to automatically abstract the preconditions of operators. In this paper we present an algorithm that automatically abstra...

The algorithms and execution policies specified by the Parallelism TS are designed to permit implementation on the broadest range of platforms. In addition to preemptive thread pools common on some platforms, implementations of these algorithms may want to take advantage of a number of mechanisms for parallel execution, including cooperative fibers, GPU threads, and SIMD vector units, among oth...

ing Positions for Indoor Location Based Services Teemu Pulkkinen, Sourav Bhattacharya, Petteri Nurmi Helsinki Institute for Information Technology HIIT PO Box 68, FI-00014 University of Helsinki, Finland [email protected]

ing Object Interactions Using Composition Filters Mehmet Aksit1, Ken Wakita2, Jan Bosch1, Lodewijk Bergmans1 and Akinori Yonezawa3 1TRESE project, Department of Computer Science, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands. email: {aksit, bosch, bergmans}@cs.utwente.nl 2Department of Information Science, Tokyo Institute of Technology, 2-12-1 Ohokayama, Meguro-ku, Tokyo...

As Internet connectivity grows executing untrusted code becomes an increasingly serious threat. Public Key Infrastructure (PKI) and digital signatures offer some degree of protection, but are only part of a solution. In this paper we propose a mechanism of forcing applications to “declare what they intend to do” by means of an abstract behavioural model. A monitoring process is employed to dyna...

ing Cryptographic Protocols with Tree Automata ?

ing Path Conditions for Effective Symbolic Execution Marek Trt́ık [email protected]