@phdthesis{Wolter2010,
  author    = {Wolter, Christian},
  title     = {A methodology for model-driven process security},
  address   = {Potsdam},
  pages     = {xv, 144 S. : graph. Darst.},
  year      = {2010},
  language  = {en}
}
@book{Vogel2010,
  author    = {Vogel, Tobias},
  title     = {Web service generation and data quality web services},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@book{Vogel2010,
  author    = {Vogel, Thomas},
  title     = {Models at runtime for Monitoring and adapting software systems},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@phdthesis{Uflacker2010,
  author    = {Uflacker, Matthias},
  title     = {Monitoring virtual team collaboration : methods, applications and experiences in engineering design},
  address   = {Potsdam},
  pages     = {203 S.},
  year      = {2010},
  language  = {en}
}
@article{Uflacker2010,
  author    = {Uflacker, Matthias},
  title     = {Computational analysis of virtual team collaboration in teh early stages of engineering design},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@book{Truemper2010,
  author    = {Tr{\"u}mper, Jonas},
  title     = {Towards visualization of complex, service-based software systems},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{Thomas2010,
  author    = {Thomas, Ivonne},
  title     = {Reliable digital identities for SOA and the Web},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{Schoebel2010,
  author    = {Sch{\"o}bel, Michael},
  title     = {A runtime environment for online processing of operating system kernel events},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{Schmidt2010,
  author    = {Schmidt, Alexander},
  title     = {Automatic extraction of locking protocols},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{Polyvyanyy2010,
  author    = {Polyvyanyy, Artem},
  title     = {Abstraction of process specifications},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{Perscheid2010,
  author    = {Perscheid, Michael},
  title     = {Requirements traceability in service-oriented computing},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{Pascalau2010,
  author    = {Pascalau, Emilian},
  title     = {An overview on teh current approaches for building and executing mashups},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{Overdick2010,
  author    = {Overdick, Hagen},
  title     = {Introducing the model mapper enactor pattern},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@phdthesis{Noll2010,
  author    = {Noll, Michael G.},
  title     = {Understanding and leveraging the social web for information retrieval},
  address   = {Potsdam},
  pages     = {xi, 223 S. : Ill., graph. Darst.},
  year      = {2010},
  language  = {en}
}
@article{Menzel2010,
  author    = {Menzel, Michael},
  title     = {Modelling security in service-oriented architectures},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@book{Kowark2010,
  author    = {Kowark, Thomas},
  title     = {Towards a service landscape for a real-time project manager dasboard},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{Kluth2010,
  author    = {Kluth, Stephan},
  title     = {Handling of closed networks in FMC-QE},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@phdthesis{Ishebabi2010,
  author    = {Ishebabi, Harold},
  title     = {Architecture synthesis for adaptive multiprocessor systems on chip},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41316},
  school      = {Universit{\"a}t Potsdam},
  year      = {2010},
  abstract  = {This thesis presents methods for automated synthesis of flexible chip multiprocessor systems from parallel programs targeted at FPGAs to exploit both task-level parallelism and architecture customization. Automated synthesis is necessitated by the complexity of the design space. A detailed description of the design space is provided in order to determine which parameters should be modeled to facilitate automated synthesis by optimizing a cost function, the emphasis being placed on inclusive modeling of parameters from application, architectural and physical subspaces, as well as their joint coverage in order to avoid pre-constraining the design space. Given a parallel program and a set of an IP library, the automated synthesis problem is to simultaneously (i) select processors (ii) map and schedule tasks to them, and (iii) select one or several networks for inter-task communications such that design constraints and optimization objectives are met. The research objective in this thesis is to find a suitable model for automated synthesis, and to evaluate methods of using the model for architectural optimizations. Our contributions are a holistic approach for the design of such systems, corresponding models to facilitate automated synthesis, evaluation of optimization methods using state of the art integer linear and answer set programming, as well as the development of synthesis heuristics to solve runtime challenges.},
  language  = {en}
}
@article{Hildebrandt2010,
  author    = {Hildebrandt, Dieter},
  title     = {Towards service-oriented, standards-based, image-based provisioning, interaction with and styling of geovirtual 3D environments},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{HermenegildoSchaub2010,
  author    = {Hermenegildo, Manuel and Schaub, Torsten},
  title     = {Introduction to the technical communications of the 26th International Conference on Logic Programming : special issue},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068410000153},
  year      = {2010},
  language  = {en}
}
@book{Hentschel2010,
  author    = {Hentschel, Uwe M.Sc.},
  title     = {Services for real -time computing},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{Hagedorn2010,
  author    = {Hagedorn, Benjamin},
  title     = {Service-Based, interactive portrayal of 3D geovirtual environments},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@inproceedings{GeskeWolf2010,
  author    = {Geske, Ulrich and Wolf, Armin},
  title     = {Preface},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41401},
  year      = {2010},
  abstract  = {The workshops on (constraint) logic programming (WLP) are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases, artificial intelligence and operations research. In this decade, previous workshops took place in Dresden (2008), W{\"u}rzburg (2007), Vienna (2006), Ulm (2005), Potsdam (2004), Dresden (2002), Kiel (2001), and W{\"u}rzburg (2000). Contributions to workshops deal with all theoretical, experimental, and application aspects of constraint programming (CP) and logic programming (LP), including foundations of constraint/ logic programming. Some of the special topics are constraint solving and optimization, extensions of functional logic programming, deductive databases, data mining, nonmonotonic reasoning, , interaction of CP/LP with other formalisms like agents, XML, JAVA, program analysis, program transformation, program verification, meta programming, parallelism and concurrency, answer set programming, implementation and software techniques (e.g., types, modularity, design patterns), applications (e.g., in production, environment, education, internet), constraint/logic programming for semantic web systems and applications, reasoning on the semantic web, data modelling for the web, semistructured data, and web query languages.},
  language  = {en}
}
@inproceedings{GeskeGoltz2010,
  author    = {Geske, Ulrich and Goltz, Hans-Joachim},
  title     = {Efficiency of difference-list programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41563},
  year      = {2010},
  abstract  = {The difference-list technique is described in literature as effective method for extending lists to the right without using calls of append/3. There exist some proposals for automatic transformation of list programs into differencelist programs. However, we are interested in construction of difference-list programs by the programmer, avoiding the need of a transformation step. In [GG09] it was demonstrated, how left-recursive procedures with a dangling call of append/3 can be transformed into right-recursion using the unfolding technique. For simplification of writing difference-list programs using a new cons/2 procedure was introduced. In the present paper, we investigate how efficieny is influenced using cons/2. We measure the efficiency of procedures using accumulator technique, cons/2, DCG's, and difference lists and compute the resulting speedup in respect to the simple procedure definition using append/3. Four Prolog systems were investigated and we found different behaviour concerning the speedup by difference lists. A result of our investigations is, that an often advice given in the literature for avoiding calls append/3 could not be confirmed in this strong formulation.},
  language  = {en}
}
@inproceedings{GebserHinrichsSchaubetal.2010,
  author    = {Gebser, Martin and Hinrichs, Henrik and Schaub, Torsten and Thiele, Sven},
  title     = {xpanda: a (simple) preprocessor for adding multi-valued propositions to ASP},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41466},
  year      = {2010},
  abstract  = {We introduce a simple approach extending the input language of Answer Set Programming (ASP) systems by multi-valued propositions. Our approach is implemented as a (prototypical) preprocessor translating logic programs with multi-valued propositions into logic programs with Boolean propositions only. Our translation is modular and heavily benefits from the expressive input language of ASP. The resulting approach, along with its implementation, allows for solving interesting constraint satisfaction problems in ASP, showing a good performance.},
  language  = {en}
}
@book{Feinbube2010,
  author    = {Feinbube, Frank},
  title     = {On Programming models for multi-core computers},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{CsuhajVarjuDassowVaszil2010,
  author    = {Csuhaj-Varj{\´u}, Erzs{\´e}bet and Dassow, Juergen and Vaszil, Gy{\"o}rgy},
  title     = {Variants of competence-based derivations in CD grammar systems},
  issn      = {0129-0541},
  doi       = {10.1142/S0129054110007428},
  year      = {2010},
  abstract  = {In this paper we introduce and study some new cooperation protocols for cooperating distributed (CD) grammar systems. These derivation modes depend on the number of different nonterminals present in the sentential form obtained when a component finished a derivation phase. This measure describes the competence of the grammar on the string (the competence is high if the number of the different nonterminals is small). It is also a measure of the efficiency of the grammar on the given string (a component is more efficient than another one if it is able to decrease the number of nonterminals in the string to a greater extent). We prove that if the underlying derivation mode is the t-mode derivation, then some variants of these systems determine the class of random context ET0L languages. If these CD grammar systems use the k step limited derivations as underlying derivation mode, then they are able to generate any recursively enumerable language.},
  language  = {en}
}
@phdthesis{Cheng2010,
  author    = {Cheng, Feng},
  title     = {Physical separation technology and its lock-keeper implementation},
  address   = {Potsdam},
  pages     = {114 S.},
  year      = {2010},
  language  = {en}
}
@article{BordihnDassowHolzer2010,
  author    = {Bordihn, Henning and Dassow, Juergen and Holzer, Markus},
  title     = {Extending regular expressions with homomorphic replacement},
  issn      = {0988-3754},
  doi       = {10.1051/Ita/2010013},
  year      = {2010},
  abstract  = {We define H- and EH-expressions as extensions of regular expressions by adding homomorphic and iterated homomorphic replacement as new operations, resp. The definition is analogous to the extension given by Gruska in order to characterize context-free languages. We compare the families of languages obtained by these extensions with the families of regular, linear context-free, context-free, and EDT0L languages. Moreover, relations to language families based on patterns, multi-patterns, pattern expressions, H-systems and uniform substitutions are also investigated. Furthermore, we present their closure properties with respect to TRIO operations and discuss the decidability status and complexity of fixed and general membership, emptiness, and the equivalence problem.},
  language  = {en}
}
@phdthesis{Bohnet2010,
  author    = {Bohnet, Johannes},
  title     = {Visualization of Execution Traces and its Application to Software Maintenance},
  address   = {Potsdam},
  pages     = {150 S.},
  year      = {2010},
  language  = {en}
}
@article{BlumBoldeaMagedanzetal.2010,
  author    = {Blum, Niklas and Boldea, Irina and Magedanz, Thomas and Margaria, Tiziana},
  title     = {Service-oriented access to next generation networks : from service creation to execution},
  issn      = {1383-469X},
  doi       = {10.1007/s11036-010-0222-1},
  year      = {2010},
  abstract  = {Existing telecommunication networks and classical roles of operators are subject to fundamental change. Many network operators are currently seeking for new sources to generate revenue by exposing network capabilities to 3rd party service providers. At the same time we can observe that services on the World Wide Web (WWW) are becoming mature in terms of the definition of APIs that are offered towards other services. The combinations of those services are commonly referred to as Web 2.0 mash-ups. Rapid service design and creation becomes therefore important to meet the requirements in a changing technology and competitive market environment. This report describes our approach to include Next Generation Networks (NGN)-based telecommunications application enabler into complex services by defining a service broker that mediates between 3rd party applications and NGN service enablers. It provides policy-driven orchestration mechanisms for service enablers, a service authorization functionality, and a service discovery interface for Service Creation Environments. The work has been implemented as part of the Open SOA Telco Playground testbed at Fraunhofer FOKUS.},
  language  = {en}
}
@phdthesis{Blum2010,
  author    = {Blum, Niklas},
  title     = {Formalization of a converged internet and telecommunications service environment},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-51146},
  school      = {Universit{\"a}t Potsdam},
  year      = {2010},
  abstract  = {The programmable network envisioned in the 1990s within standardization and research for the Intelligent Network is currently coming into reality using IPbased Next Generation Networks (NGN) and applying Service-Oriented Architecture (SOA) principles for service creation, execution, and hosting. SOA is the foundation for both next-generation telecommunications and middleware architectures, which are rapidly converging on top of commodity transport services. Services such as triple/quadruple play, multimedia messaging, and presence are enabled by the emerging service-oriented IPMultimedia Subsystem (IMS), and allow telecommunications service providers to maintain, if not improve, their position in the marketplace. SOA becomes the de facto standard in next-generation middleware systems as the system model of choice to interconnect service consumers and providers within and between enterprises. We leverage previous research activities in overlay networking technologies along with recent advances in network abstraction, service exposure, and service creation to develop a paradigm for a service environment providing converged Internet and Telecommunications services that we call Service Broker. Such a Service Broker provides mechanisms to combine and mediate between different service paradigms from the two domains Internet/WWW and telecommunications. Furthermore, it enables the composition of services across these domains and is capable of defining and applying temporal constraints during creation and execution time. By adding network-awareness into the service fabric, such a Service Broker may also act as a next generation network-to-service element allowing the composition of crossdomain and cross-layer network and service resources. The contribution of this research is threefold: first, we analyze and classify principles and technologies from Information Technologies (IT) and telecommunications to identify and discuss issues allowing cross-domain composition in a converging service layer. Second, we discuss service composition methods allowing the creation of converged services on an abstract level; in particular, we present a formalized method for model-checking of such compositions. Finally, we propose a Service Broker architecture converging Internet and Telecom services. This environment enables cross-domain feature interaction in services through formalized obligation policies acting as constraints during service discovery, creation, and execution time.},
  language  = {en}
}
@phdthesis{Bleiholder2010,
  author    = {Bleiholder, Jens},
  title     = {Data fusion and conflict resolution in integrated information systems},
  address   = {Potsdam},
  pages     = {171 S.},
  year      = {2010},
  language  = {en}
}
@book{Becker2010,
  author    = {Becker, Basil},
  title     = {Model-based extension of AUTOSAR for architectural online reconfiguration},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@phdthesis{Awad2010,
  author    = {Awad, Ahmed Mahmoud Hany Aly},
  title     = {A compliance management framework for business process models},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-49222},
  school      = {Universit{\"a}t Potsdam},
  year      = {2010},
  abstract  = {Companies develop process models to explicitly describe their business operations. In the same time, business operations, business processes, must adhere to various types of compliance requirements. Regulations, e.g., Sarbanes Oxley Act of 2002, internal policies, best practices are just a few sources of compliance requirements. In some cases, non-adherence to compliance requirements makes the organization subject to legal punishment. In other cases, non-adherence to compliance leads to loss of competitive advantage and thus loss of market share. Unlike the classical domain-independent behavioral correctness of business processes, compliance requirements are domain-specific. Moreover, compliance requirements change over time. New requirements might appear due to change in laws and adoption of new policies. Compliance requirements are offered or enforced by different entities that have different objectives behind these requirements. Finally, compliance requirements might affect different aspects of business processes, e.g., control flow and data flow. As a result, it is infeasible to hard-code compliance checks in tools. Rather, a repeatable process of modeling compliance rules and checking them against business processes automatically is needed. This thesis provides a formal approach to support process design-time compliance checking. Using visual patterns, it is possible to model compliance requirements concerning control flow, data flow and conditional flow rules. Each pattern is mapped into a temporal logic formula. The thesis addresses the problem of consistency checking among various compliance requirements, as they might stem from divergent sources. Also, the thesis contributes to automatically check compliance requirements against process models using model checking. We show that extra domain knowledge, other than expressed in compliance rules, is needed to reach correct decisions. In case of violations, we are able to provide a useful feedback to the user. The feedback is in the form of parts of the process model whose execution causes the violation. In some cases, our approach is capable of providing automated remedy of the violation.},
  language  = {en}
}
@article{Appeltauer2010,
  author    = {Appeltauer, Malte},
  title     = {declarative and event-based context-oriented programming},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{Alnemr2010,
  author    = {Alnemr, Rehab},
  title     = {Context-aware Reputation in SOA and future internet},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{AbuJarour2010,
  author    = {AbuJarour, Mohammed},
  title     = {Information integration in services computing},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@inproceedings{OPUS4-3955,
  title     = {Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009},
  editor    = {Geske, Ulrich and Wolf, Armin},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-026-7},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-37977},
  pages     = {187},
  year      = {2010},
  abstract  = {The workshops on (constraint) logic programming (WLP) are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases, artificial intelligence and operations research. The 23rd WLP was held in Potsdam at September 15 - 16, 2009. The topics of the presentations of WLP2009 were grouped into the major areas: Databases, Answer Set Programming, Theory and Practice of Logic Programming as well as Constraints and Constraint Handling Rules.},
  language  = {en}
}