@inproceedings{BandaGallagher2010,
  author    = {Banda, Gourinath and Gallagher, John P.},
  title     = {Constraint-based abstraction of a model checker for infinite state systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41516},
  year      = {2010},
  abstract  = {Abstract interpretation-based model checking provides an approach to verifying properties of infinite-state systems. In practice, most previous work on abstract model checking is either restricted to verifying universal properties, or develops special techniques for temporal logics such as modal transition systems or other dual transition systems. By contrast we apply completely standard techniques for constructing abstract interpretations to the abstraction of a CTL semantic function, without restricting the kind of properties that can be verified. Furthermore we show that this leads directly to implementation of abstract model checking algorithms for abstract domains based on constraints, making use of an SMT solver.},
  language  = {en}
}
@book{SmirnovReijersNugterenetal.2010,
  author    = {Smirnov, Sergey and Reijers, Hajo A. and Nugteren, Thijs and Weske, Mathias},
  title     = {Business process model abstraction : theory and practice},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-054-0},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41782},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {17},
  year      = {2010},
  abstract  = {Business process management aims at capturing, understanding, and improving work in organizations. The central artifacts are process models, which serve different purposes. Detailed process models are used to analyze concrete working procedures, while high-level models show, for instance, handovers between departments. To provide different views on process models, business process model abstraction has emerged. While several approaches have been proposed, a number of abstraction use case that are both relevant for industry and scientifically challenging are yet to be addressed. In this paper we systematically develop, classify, and consolidate different use cases for business process model abstraction. The reported work is based on a study with BPM users in the health insurance sector and validated with a BPM consultancy company and a large BPM vendor. The identified fifteen abstraction use cases reflect the industry demand. The related work on business process model abstraction is evaluated against the use cases, which leads to a research agenda.},
  language  = {en}
}
@inproceedings{HanusKoschnicke2010,
  author    = {Hanus, Michael and Koschnicke, Sven},
  title     = {An ER-based framework for declarative web programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41447},
  year      = {2010},
  abstract  = {We describe a framework to support the implementation of web-based systems to manipulate data stored in relational databases. Since the conceptual model of a relational database is often specified as an entity-relationship (ER) model, we propose to use the ER model to generate a complete implementation in the declarative programming language Curry. This implementation contains operations to create and manipulate entities of the data model, supports authentication, authorization, session handling, and the composition of individual operations to user processes. Furthermore and most important, the implementation ensures the consistency of the database w.r.t. the data dependencies specified in the ER model, i.e., updates initiated by the user cannot lead to an inconsistent state of the database. In order to generate a high-level declarative implementation that can be easily adapted to individual customer requirements, the framework exploits previous works on declarative database programming and web user interface construction in Curry.},
  language  = {en}
}
@inproceedings{GoltzPieth2010,
  author    = {Goltz, Hans-Joachim and Pieth, Norbert},
  title     = {A tool for generating partition schedules of multiprocessor systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41556},
  year      = {2010},
  abstract  = {A deterministic cycle scheduling of partitions at the operating system level is supposed for a multiprocessor system. In this paper, we propose a tool for generating such schedules. We use constraint based programming and develop methods and concepts for a combined interactive and automatic partition scheduling system. This paper is also devoted to basic methods and techniques for modeling and solving this partition scheduling problem. Initial application of our partition scheduling tool has proved successful and demonstrated the suitability of the methods used.},
  language  = {en}
}
@inproceedings{HerreHummel2010,
  author    = {Herre, Heinrich and Hummel, Axel},
  title     = {A paraconsistent semantics for generalized logic programs},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41496},
  year      = {2010},
  abstract  = {We propose a paraconsistent declarative semantics of possibly inconsistent generalized logic programs which allows for arbitrary formulas in the body and in the head of a rule (i.e. does not depend on the presence of any specific connective, such as negation(-as-failure), nor on any specific syntax of rules). For consistent generalized logic programs this semantics coincides with the stable generated models introduced in [HW97], and for normal logic programs it yields the stable models in the sense of [GL88].},
  language  = {en}
}