Towards a Theory of Genericity Based on Government and Binding

  • Alexander Bienemann
  • Klaus-Dieter Schewe
  • Bernhard Thalheim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4215)


Conceptual modelling in the area of data-intensive systems produces database schemata and a variety of systems characteristics, which ideally could be used to facilitate the generation of an implementation. This paper proposes a framework for the development of patterns and components that will permit a direct computation of the corresponding functions, whenever all system parameters and the schemata of the application are known. For this a theory of genericity that is based on the linguistic theory of government and binding (GB), which consists of a two-step specialization of ideas or raw utterances, is developed. This theory of GB genericity is applied to obtain generic workflows and the functionality involved in them.


Media Type Function Algebra Function Application Housing Allowance Abstract State Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Websters ninth new collegiate dictionary (1991)Google Scholar
  2. 2.
    Aiken, P.: Data Reverse Engineering: Slaying the Legacy Dragon. McGraw-Hill, New York (1995)Google Scholar
  3. 3.
    Binemann-Zdanowicz, A.: Sitelang:edu - towards a context-driven e-learning content utilization model. In: Proc. SAC 2004 (ACM SIGAPP), Nicosia, Cyprus, March 2004, pp. 924–928 (2004); Association for Computing Machinery, 2004Google Scholar
  4. 4.
    Binemann-Zdanowicz, A.: A Generative Approach to Functionality of Interactive Information Systems. PhD thesis, Christian Albrecht University of Kiel, Germany (to be submitted, 2006)Google Scholar
  5. 5.
    Binemann-Zdanowicz, A., Kaschek, R., Schewe, K.-D., Thalheim, B.: Context-aware web information systems. In: Proc. APCCM 2004, January 2004, pp. 37–48 (2004)Google Scholar
  6. 6.
    Börger, E., Stärk, R.: Abstract state machines - A method for high-level system design and analysis. Springer, Berlin (2003)zbMATHGoogle Scholar
  7. 7.
    Chomsky, N.: Some concepts and consequences of the theory of government and binding. MIT Press, Cambridge (1982)Google Scholar
  8. 8.
    Chomsky, N.: Lectures on government and binding - The Pisa lectures. Mouton, De Gryuter (1993)Google Scholar
  9. 9.
    Chomsky, N.: The minimalist program. MIT Press, Cambridge (1995)zbMATHGoogle Scholar
  10. 10.
    Chomsky, N.: Personal communication, August 5-8 (2005)Google Scholar
  11. 11.
    Coplien, J.O., Schmidt, D.C. (eds.): Pattern languages for program design. Addison-Wesley, Reading (1995)Google Scholar
  12. 12.
    Düsterhöft, A., Thalheim, B.: Integrating retrieval functionality in websites based on storyboard design and word fields. In: Andersson, B., Bergholtz, M., Johannesson, P. (eds.) NLDB 2002. LNCS, vol. 2553, pp. 52–63. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  13. 13.
    Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design patterns: Elements of reusable software architecture. Addison-Wesley, Reading (1995)Google Scholar
  14. 14.
    Hay, D.C.: Data model pattern: Conventions of thought, Dorset House, New York (1995)Google Scholar
  15. 15.
    Taligent Inc. (ed.): The power of frameworks - For windows and OS/2 developers. Addison-Wesley, Reading (1995)Google Scholar
  16. 16.
    Klint, P., van der Storm, T., Vinju, J.J.: Term rewriting meets aspect-oriented programming. In: Report SEN-E0421 (December 2004)Google Scholar
  17. 17.
    Nock, C.: Data Access Patterns - Database Interactions in Object Oriented Apploications. Addison-Wesley, Boston (2004)Google Scholar
  18. 18.
    Pittman, T., Peters, J.: The Art of Compiler Design: Theory and Practice. Prentice-Hall, Englewood Cliffs (1992)zbMATHGoogle Scholar
  19. 19.
    Quibeldey-Cirkel, K.: Design patterns. Springer, Berlin (1999)zbMATHGoogle Scholar
  20. 20.
    Schellhorn, G.: Verifikation abstrakter Zustandsmaschinen. PhD thesis, University of Ulm, Germany (1999)Google Scholar
  21. 21.
    Schewe, K.-D., Thalheim, B.: Conceptual modelling of web information systems. Data and Knowledge Engineering (2005)Google Scholar
  22. 22.
    Schewe, K.-D., Thalheim, B., Binemann-Zdanowicz, A., Kaschek, R., Kuss, T., Tschiedel, B.: A conceptual view of web-based e-learning systems. Education and Information Technologies 10(1-2), 83–110 (2005)CrossRefGoogle Scholar
  23. 23.
    Stabler, E.: Derivational minimalism. In: Retoré, C. (ed.) LACL 1996. LNCS (LNAI), vol. 1328, pp. 68–95. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  24. 24.
    Stabler, E.: Personal communication, September 3 (2005)Google Scholar
  25. 25.
    Thalheim, B.: Entity-relationship modeling – Foundations of database technology. Springer, Berlin (2000), zbMATHGoogle Scholar
  26. 26.
    Thalheim, B.: Informationssystem-Entwicklung. In: BTU Cottbus, Computer Science Institute, Technical Report I-15-2003, Cottbus (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Alexander Bienemann
    • 1
  • Klaus-Dieter Schewe
    • 2
  • Bernhard Thalheim
    • 1
  1. 1.Department of Computer ScienceChristian Albrechts University KielKielGermany
  2. 2.Information Science Research CentreMassey UniversityPalmerston NorthNew Zealand

Personalised recommendations