@phdthesis{20262, author = {{Hamann, Heiko}}, isbn = {{9783642133763}}, issn = {{1867-4925}}, title = {{{Space-Time Continuous Models of Swarm Robotic Systems}}}, doi = {{10.1007/978-3-642-13377-0}}, year = {{2008}}, } @unpublished{26235, abstract = {{Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory -- in the discrete setting of bits and Turing machines. Over real numbers, on the other hand, the BSS-machine (aka real-RAM) has been established as a major model of computation. This real realm has turned out to exhibit natural counterparts to many notions and results in classical complexity and recursion theory; although usually with considerably different proofs. The present work investigates similarities and differences between discrete and real Kolmogorov Complexity as introduced by Montana and Pardo (1998).}}, author = {{Ziegler, Martin and Koolen, Wouter M.}}, booktitle = {{arXiv:0802.2027}}, title = {{{Kolmogorov Complexity Theory over the Reals}}}, year = {{2008}}, } @inproceedings{26243, abstract = {{Operations on univariate dense polynomials—multiplication, division with remainder, multipoint evaluation—constitute central primitives entering as build-up blocks into many higher applications and algorithms. Fast Fourier Transform permits to accelerate them from naive quadratic to running time O(n·polylogn), that is softly linear in the degree n of the input. This is routinely employed in complexity theoretic considerations and, over integers and finite fields, in practical number theoretic calculations. The present work explores the benefit of fast polynomial arithmetic over the field of real numbers where the precision of approximation becomes crucial. To this end, we study the computability of the above operations in the sense of Recursive Analysis as an effective refinement of continuity. This theo- retical worst-case stability analysis is then complemented by an empirical evaluation: We use GMP and the iRRAM to find the precision required for the intermediate calculations in order to achieve a desired output accuracy.}}, author = {{Köhler, Sven and Ziegler, Martin}}, booktitle = {{Proc. 8th Conference on Real Numbers and Computers}}, pages = {{147--156}}, title = {{{On the Stability of Fast Polynomial Arithmetic}}}, year = {{2008}}, } @article{26255, abstract = {{We turn the physical Church-Turing Hypothesis from an ambiguous source of sensational speculations into a (collection of) sound and well-defined scientific problem(s): Examining recent controversies and causes for misunderstanding concerning the state of the Church- Turing Hypothesis (CTH), it is suggested to study the CTH ‘sharpened’ relative to an arbitrary but specific physical theory—rather than vaguely referring to “nature” in general. For this purpose we combine physical structuralism with computational complexity theory. The benefits of this approach are illustrated by some exemplary results on computability and complexity in computational physics.}}, author = {{Ziegler, Martin}}, journal = {{Applied Mathematics and Computation}}, title = {{{Physically-Relativized Church-Turing Hypotheses}}}, year = {{2008}}, } @inbook{26262, author = {{Ziegler, Martin}}, booktitle = {{Verhandlungen der Deutschen Physikalischen Gesellschaft}}, pages = {{145}}, publisher = {{Deutsche Physikalische Gesellschaft (DPG)}}, title = {{{A Meta-Theory of Physics and Computation}}}, year = {{2008}}, } @article{26280, author = {{Meer, Klaus and Ziegler, Martin}}, issn = {{0885-064X}}, journal = {{Journal of Complexity}}, pages = {{3--15}}, title = {{{An explicit solution to Post's Problem over the reals}}}, doi = {{10.1016/j.jco.2006.09.004}}, year = {{2008}}, } @article{3203, author = {{Wehrheim, Heike}}, journal = {{Electr. Notes Theor. Comput. Sci.}}, pages = {{255----264}}, title = {{{Refinement in the Presence of Unknowns}}}, doi = {{10.1016/j.entcs.2008.02.023}}, year = {{2008}}, } @article{3204, author = {{Estler, H.{-}Christian and Wehrheim, Heike}}, journal = {{Electr. Notes Theor. Comput. Sci.}}, pages = {{331----357}}, title = {{{Alloy as a Refactoring Checker?}}}, doi = {{10.1016/j.entcs.2008.06.015}}, year = {{2008}}, } @article{3205, author = {{Möller, Michael and Olderog, Ernst-Rüdiger and Rasch, Holger and Wehrheim, Heike}}, journal = {{Formal Asp. Comput.}}, number = {{2}}, pages = {{161----204}}, title = {{{Integrating a formal method into a software engineering process with {UML} and Java}}}, doi = {{10.1007/s00165-007-0042-7}}, year = {{2008}}, } @article{3206, author = {{Brückner, Ingo and Dräger, Klaus and Finkbeiner, Bernd and Wehrheim, Heike}}, journal = {{Fundam. Inform.}}, number = {{4}}, pages = {{369----392}}, title = {{{Slicing Abstractions}}}, year = {{2008}}, } @inproceedings{3207, author = {{Engels, Gregor and Kleppe, Anneke and Rensink, Arend and Semenyak, Maria and Soltenborn, Christian and Wehrheim, Heike}}, booktitle = {{Model Driven Architecture - Foundations and Applications, 4th European Conference, {ECMDA-FA} 2008, Berlin, Germany, June 9-13, 2008. Proceedings}}, editor = {{Schieferdecker, Ina and Hartman, Alan}}, pages = {{94----109}}, title = {{{From {UML} Activities to {TAAL} - Towards Behaviour-Preserving Model Transformations}}}, doi = {{10.1007/978-3-540-69100-6_7}}, year = {{2008}}, } @inproceedings{3208, author = {{Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}}, booktitle = {{Formal Methods for Open Object-Based Distributed Systems, 10th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2008, Oslo, Norway, June 4-6, 2008, Proceedings}}, editor = {{Barthe, Gilles and S. de Boer, Frank}}, pages = {{78----95}}, title = {{{Mechanizing a Correctness Proof for a Lock-Free Concurrent Stack}}}, doi = {{10.1007/978-3-540-68863-1_6}}, year = {{2008}}, } @inproceedings{3209, author = {{Metzler, Björn and Wehrheim, Heike and Wonisch, Daniel}}, booktitle = {{Formal Methods and Software Engineering, 10th International Conference on Formal Engineering Methods, {ICFEM} 2008, Kitakyushu-City, Japan, October 27-31, 2008. Proceedings}}, editor = {{Liu, Shaoying and S. E. Maibaum, T. and Araki, Keijiro}}, pages = {{105----125}}, title = {{{Decomposition for Compositional Verification}}}, doi = {{10.1007/978-3-540-88194-0_9}}, year = {{2008}}, } @inproceedings{3210, author = {{Wehrheim, Heike}}, booktitle = {{Theoretical Aspects of Computing - {ICTAC} 2008, 5th International Colloquium, Istanbul, Turkey, September 1-3, 2008. Proceedings}}, editor = {{S. Fitzgerald, John and Elisabeth Haxthausen, Anne and Yenig{\"{u}}n, H{\"{u}}sn{\"{u}}}}, pages = {{380----394}}, title = {{{Bounded Model Checking for Partial Kripke Structures}}}, doi = {{10.1007/978-3-540-85762-4_26}}, year = {{2008}}, } @inproceedings{3001, author = {{Stern, Claudius and Adelt, Philipp and Krummel, Volker and Ackermann, Marcel Rudolf}}, booktitle = {{Fourth International Conference on Networking and Services (icns 2008)}}, isbn = {{9780769530949}}, publisher = {{IEEE}}, title = {{{Reliable Evidence of Data Integrity from an Untrusted Storage Service}}}, doi = {{10.1109/icns.2008.28}}, year = {{2008}}, } @inproceedings{3143, author = {{Gajek, Sebastian and Jager, Tibor and Manulis, Mark and Schwenk, Jörg}}, booktitle = {{Computer Security - ESORICS 2008, 13th European Symposium on Research in Computer Security, Málaga, Spain, October 6-8, 2008. Proceedings}}, pages = {{115----129}}, title = {{{A Browser-Based Kerberos Authentication Scheme}}}, doi = {{10.1007/978-3-540-88313-5_8}}, year = {{2008}}, } @inproceedings{3144, author = {{Altmann, Kristina and Jager, Tibor and Rupp, Andy}}, booktitle = {{Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations}}, pages = {{437----448}}, title = {{{On Black-Box Ring Extraction and Integer Factorization}}}, doi = {{10.1007/978-3-540-70583-3_36}}, year = {{2008}}, } @inproceedings{3145, author = {{Jager, Tibor and Schwenk, Jörg}}, booktitle = {{Provable Security, Second International Conference, ProvSec 2008, Shanghai, China, October 30 - November 1, 2008. Proceedings}}, pages = {{200----209}}, title = {{{On the Equivalence of Generic Group Models}}}, doi = {{10.1007/978-3-540-88733-1_14}}, year = {{2008}}, } @inproceedings{3146, author = {{Jager, Tibor and Jäkel, Heiko and Schwenk, Jörg}}, booktitle = {{Sicherheit 2008: Sicherheit, Schutz und Zuverlässigkeit. Konferenzband der 4. Jahrestagung des Fachbereichs Sicherheit der Gesellschaft für Informatik e.V. (GI), 2.-4. April 2008 im Saarbrücker Schloss.}}, pages = {{127----136}}, title = {{{Nutzung von selbstsignierten Client-Zertifikaten zur Authentifikation bei SSL/TLS}}}, year = {{2008}}, } @inproceedings{20938, author = {{Tichy, Matthias and Henkler, Stefan and Meyer, Matthias and von Detten, Markus}}, booktitle = {{Companion Proceedings of the 30th International Conference on Software Engineering (ICSE), Leipzig, Germany}}, title = {{{Safety of Component-Based Systems: Analysis and Improvement using Fujaba4Eclipse}}}, year = {{2008}}, }