You are here: Home / Publications

List of Publications

Below is a complete listing of all publications of Prof. Lüttgen.

Important Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders, such as publishers. All persons copying this information are expected to adhere to the terms and constraints invoked by each copyright holder. In most cases, these works may not be reposted without explicit permission of the copyright holder.

Books

  1. Lüttgen, G. Pre-emptive modeling of concurrent and distributed systems. Shaker Verlag, 1998. ISBN 3-8265-3932-X. (Dissertation.) Abstract / Article / BibTeX.

Chapters in Books

  1. Cleaveland, R., Lüttgen, G. and Natarajan, V. Priority in process algebra. In J.A. Bergstra, A. Ponse, and S.A. Smolka, eds., Handbook of Process Algebra, ch. 12, pp. 711-765. Elsevier Science Publishers, 2001. ISBN 0-444-82830-3. Abstract / Article / BibTeX.
  2. Lüttgen, G. Modellieren nebenläufiger und verteilter Systeme mit Präemption. Ausgezeichnete Informatikdissertationen 1998 (Distinguished Dissertations in Computer Science 1998), pp. 102-111. B.G. Teubner, 1999. ISBN 3-519-02648-1. Abstract / Article / BibTeX.

Articles in Journals

  1. Vogler, W. and Lüttgen, G. A linear-time branching-time perspective on Interface Automata. Acta Informatica, 57(3):513-550, 2020. Abstract / Article / BibTeX / DOI.
  2. Fendrich, S. and Lüttgen, G. A generalised theory of Interface Automata, component compatibility and error. Acta Informatica, 56(4):287-319, 2019. Abstract / Article / BibTeX / DOI.
  3. Bujtor, F., Fendrich, S., Lüttgen, G. and Vogler, W. Nondeterministic Modal Interfaces. Theoretical Computer Science, 642:24-53, 2016. Abstract / Article / BibTeX / DOI.
  4. Lüttgen, G., Vogler, W. and Fendrich, S. Richer interface automata with optimistic and pessimistic compatibility. Acta Informatica, 52(4-5): 305-336, 2015. Abstract / Article / BibTeX / DOI.
  5. Mühlberg, J. T. and Lüttgen, G. Symbolic object code analysis. Software Tools for Technology Transfer, 16(1):81-102, 2014. Abstract / Article / BibTeX / DOI.
  6. Lüttgen, G. and Vogler, W. Modal Interface Automata. Logical Methods in Computer Science, 9(3:4), 2013. Abstract / Article / BibTeX / DOI.
  7. Mühlberg, J. T. and Lüttgen, G. Verifying compiled file system code. Formal Aspects of Computing, 24(3):375-391, 2012. Special issue on the Brazilian Symposium on Formal Methods (SBMF 2009). Abstract / Article / BibTeX / DOI.
  8. Lüttgen, G. and Vogler, W. Safe reasoning with Logic LTS. Theoretical Computer Science, 412(28):3337-3357, 2011. Bergstra Festschrift. Abstract / Article / BibTeX / DOI.
  9. Lüttgen, G. and Vogler, W. Ready simulation for concurrency: It's logical! Information and Computation, 208:845-867, 2010. Abstract / Article / BibTeX / DOI.
  10. Mendler, M. and Lüttgen, G. Is observational congruence on mu-expressions axiomatisable in equational Horn logic? Information and Computation, 208:634-651, 2010. Special Issue on Concurrency Theory (CONCUR 2007). Abstract / Article / BibTeX / DOI.
  11. Ezekiel, J., Lüttgen, G., and Siminiceanu, R. To parallelise or to optimise? Journal of Logic and Computation, 21(1):85-120, 2011. Special Issue on Parallel and Distributed Methods of verifiCation (PDMC). Abstract / Article / BibTeX / DOI.
  12. Yu, A. J., Ciardo, G. and Lüttgen, G. Decision-diagram-based techniques for bounded reachability checking of asynchronous systems. Software Tools for Technology Transfer, 11(2):117-131, 2009. Abstract / Article / BibTeX / DOI.
  13. Hierons, R. M., Bogdanov, K., Bowen, J. P., Cleaveland, R., Derrick, J., Dick, J., Gheorghe, M., Harman, M., Kapoor, K., Krause, P., Lüttgen, G., Simons, A. J. H. Simons, Vilkomir, S., Woodward, M. R. and Zedan, H. Using formal specifications to support testing. ACM Computing Surveys, 41(2):1--76, 2009. Abstract / BibTeX / DOI.
  14. White, D. and Lüttgen, G. Embedded systems programming: Accessing databases from Esterel. EURASIP Journal of Embedded Systems, Vol. 2008, Article ID 961036, 17pp., 2008. Abstract / Article / BibTeX / DOI.
  15. Cleaveland, R., Lüttgen, G. and Natarajan, V. Priority and abstraction in process algebra. Information and Computation 205(9):1426-1458, 2007. Abstract / Article / BibTeX / DOI.
  16. Ciardo, G., Lüttgen, G. and Miner, A. S. Exploiting interleaving semantics in symbolic state-space generation. Formal Methods in System Design 31(1):63-100, 2007. Abstract / Article / BibTeX / DOI.
  17. Lüttgen, G. and Vogler, W. Conjunction on processes: Full-abstraction via ready-tree semantics. Theoretical Computer Science, 373(1-2):19-40, 2007. Abstract / Article / BibTeX / DOI.
  18. Lüttgen, G. and Vogler, W. Bisimulation on speed: A unified approach. Theoretical Computer Science, 360(1-3):209-227, 2006. Abstract / Article / BibTeX / DOI.
  19. Lüttgen, G. and Vogler, W. Bisimulation on speed: Lower time bounds. RAIRO - Theoretical Informatics and Applications, 39:587-618, 2005. Special Issue on Foundations of Software Science and Computation Structures (FOSSACS 2004). Abstract / Article / BibTeX.
  20. Lüttgen, G. and Vogler, W. Bisimulation on speed: Worst-case efficiency. Information and Computation, 191(2):105-144, 2004. Abstract / Article / BibTeX / DOI.
  21. Lüttgen, G. and Mendler, M. The intuitionism behind Statecharts steps. ACM Transactions on Computational Logic, 3(1):1-41, 2002. Abstract / Article / BibTeX / DOI.
  22. Bhat, G., Cleaveland, R. and Lüttgen, G. A practical approach to implementing real-time semantics. Annals of Software Engineering, 7:127-155, 1999. Special issue on Real-time Software Engineering. Abstract / Article / BibTeX.
  23. Cleaveland, R., Lüttgen, G. and Natarajan, V. A process algebra with distributed priorities. Theoretical Computer Science, 195(2):227-258, 1998. Special issue on Concurrency Theory (CONCUR '96). Abstract / Article / BibTeX / DOI.
  24. Cleaveland, R., Lüttgen, G., Natarajan, V. and Sims, S. Modeling and verifying distributed systems using priorities: A case study. Software - Concepts and Tools, 17(2):50-62, 1996. Abstract / Article / BibTeX.
  25. Graf, S., Steffen, B. and Lüttgen, G. Compositional minimisation of finite state systems using interface specifications. Formal Aspects of Computing, 8(5):607-616, 1996. Abstract / Article / Long Version / BibTeX.

Papers Published in Refereed Proceedings

  1. Boockmann, J. H. and Lüttgen, G. Learning data structure shapes from memory graphs. In 23rd Intl. Conf. on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-23), vol. 73 of EPiC Series in Computing, pp. 151-168, 2020. EasyChair. Abstract / Article / BibTeX / DOI.
  2. Lüttgen, G. A note on refinement in hierarchical transition systems. In 23rd Intl. Conf. on Formal Methods for Industrial Critical Systems (FMICS 2018), vol. 11119 of Lecture Notes in Computer Science, pp. 211-222, Maynooth, Ireland, September 2018. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  3. Sailer, A., Deubzer, M., Lüttgen, G. and Mottok, J. Comparing trace recordings of automotive real-time software. In 25th Intl. Conf. on Real-Time Networks and Systems (RTNS 2017), pp. 118-127, Grenoble, France, October 2017. ACM. Abstract / Article / BibTeX / DOI.
  4. Rupprecht, T., Chen, X., White, D. H., Boockmann, J. H., Lüttgen, G. and Bos, H. DSIbin: Identifying dynamic data structures in C/C++ binaries. In 32nd IEEE/ACM Intl. Conf. on Automated Software Engineering (ASE 2017), pp. 331-341, Urbana-Champaign, Illinois, USA, October/November 2017. IEEE/ACM. Abstract / Article / BibTeX / DOI.
  5. Rupprecht, T., Chen, X., White, D. H., Mühlberg, J. T., Bos, H. and Lüttgen, G. POSTER: Identifying dynamic data structures in malware. In ACM SIGSAC Conf. on Computer and Communications Security (CCS 2016), pp. 1772-1774, Vienna, Austria, October 2016. ACM. Abstract / Article / BibTeX / DOI.
  6. Sailer, A., Deubzer, M., Lüttgen, G. and Mottok, J. CoreTAna: A trace analyzer for reverse engineering real-time software. In 23rd Intl. Conf. on Software Analysis, Evolution, and Reengineering (SANER 2016), pp. 657-660, Osaka, Japan, March 2016. IEEE Computer Society. Abstract / Article / BibTeX / DOI.
  7. White, D. H., Rupprecht, T. and Lüttgen, G. DSI: An evidence-based approach to identify dynamic data structures in C programs. In A. Roychoudhury, ed., 2016 Intl. Symp. on Software Testing and Analysis (ISSTA 2016), pp. 259-269, Saarbrücken, Germany, July 2016. ACM. Abstract / Article / BibTeX / DOI.
  8. Fendrich, S. and Lüttgen, G. A generalised theory of Interface Automata, component compatibility and error. In E. Abraham and M. Huisman, eds., 12th Intl. Conf. on Integrated Formal Methods (IFM 2016), vol. 9681 of Lecture Notes in Computer Science, pp. 160-175, Reykjavik, Iceland, June 2016. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  9. Mühlberg, J. T., White, D. H., Dodds, M., Lüttgen, G. and Piessens, F. Learning assertions to verify linked-list programs. In R. Calinsecu and B. Rumpe, eds., 13th Intl. Conf. on Software Engineering and Formal Methods (SEFM 2015), vol. 9276 of Lecture Notes in Computer Science, pp. 37-52, York, UK, September 2015. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  10. Bujtor, F., Fendrich, S., Lüttgen, G. and Vogler, W. Nondeterministic Modal Interfaces. In G. F. Italiano, T. Margaria-Steffen, J. Pokorny, J.-J. Quisquater and R. Wattenhofer, eds., 41st Intl. Conf. on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015), vol. 8939 of Lecture Notes in Computer Science, pp. 152-163, Pec pod Snezkou, Czech Republic, January 2015. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  11. Lüttgen, G. and Vogler, W. Richer Interface Automata with optimistic and pessimistic compatibility. In H. Treharne and S. Schneider, eds., 13th Intl. Workshop on Automated Verification of Critical Systems (AVoCS 2013), vol. 66 of Electronic Communications of the EASST, Guildford, England, September 2013. European Association of Software Science and Technology. Abstract / Article / BibTeX / Open Access.
  12. White, D. H. and Lüttgen, G. Identifying dynamic data structures by learning evolving patterns in memory. In N. Piterman and S. A. Smolka, eds., 19th Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2013), vol. 7795 of Lecture Notes in Computer Science, pp. 354-369, Rome, Italy, March 2013. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  13. Lüttgen, G. and Vogler, W. Modal Interface Automata. In J.C.M. Baeten, T. Ball and F.S. de Boer, eds., 7th IFIP Intl. Conf. on Theoretical Computer Science (TCS 2012), vol. 7604 of Lecture Notes in Computer Science, pp. 265-279, Amsterdam, The Netherlands, September 2012, Springer-Verlag. Abstract / Article / BibTeX / DOI.
  14. Ditter, A., Ceska, M. and Lüttgen, G. On Parallel software verification using Boolean equation systems. In A. Donaldson and D. Parker, eds., 19th Intl. SPIN Workshop on Model Checking Software (SPIN 2012), vol. 7385 of Lecture Notes in Computer Science, pp. 80-97, Oxford, England, July 2012, Springer-Verlag. Abstract / Article / BibTeX / DOI.
  15. Siirtola, A., Puhakka, A. und Lüttgen, G. Introducing fairness into compositional verification via unidirectional counters. In 12th Intl. Conf. on Application of Concurrency to System Design (ACSD 2012), pp. 32-41, Hamburg, Germany, June 2012, IEEE Computer Society. Abstract / Article / BibTeX / DOI.
  16. Mühlberg, J. T. and Lüttgen, G. Symbolic object code analysis. In J. van de Pol and M. Weber, eds., 17th Intl. SPIN Workshop - Model Checking Software (SPIN 2010), vol. 6349 of Lecture Notes in Computer Science, pp. 4-21, Enschede, The Netherlands, September 2010, Springer-Verlag. Abstract / Article / BibTeX / DOI.
  17. De Roever, W.-P., Lüttgen, G. and Mendler, M. What is in a step: New Perspectives on a classical question. In Z. Manna and D. Peled, eds., Pnueli Festschrift, vol. 6200 of Lecture Notes in Computer Science, pp. 370-399, July 2010, Springer-Verlag. Abstract / Article / BibTeX / DOI.
  18. Mühlberg, J. T. and Lüttgen, G. Verifying compiled file system code. In M. Vinicius, M. Oliveira and J. Woodcock, eds., 12th Brazilian Symposium on Formal Methods (SBMF 2009), vol. 5902 of Lecture Notes in Computer Science, pp. 306-320, Gramado, Brazil, August 2009, Springer-Verlag. Abstract / Article / BibTeX / DOI.
  19. Fecher, H., de Frutos-Escrig, D., Lüttgen, G. and Schmidt, H. On the expressiveness of refinement settings. In F. Arbab and M. Sirjani, eds., 3rd Intl. Conf. on Fundamentals of Software Engineering (FSEN 2009), vol. 5961 of Lecture Notes in Computer Science, pp. 276-291, Kish Island, Iran, April 2009. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  20. Lüttgen, G. and Vogler, W. Safe reasoning with Logic LTS. In M. Nielsen, A. Kucera, P. Bro Miltersen, C. Palamidessi, P. Tuma and F. Valencia, eds., 35th Conf. on Current Trends in Theory and Practice of Computer Science (SOFSEM 2009), vol. 5404 of Lecture Notes in Computer Science, pp. 376-387, Spindleruv Mlyn, Czech Republic, January 2009. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  21. Galloway, A., Lüttgen, G., Mühlberg, J. T. and Siminiceanu, R. I. Model-checking the Linux Virtual File System. In N. Jones and M. Müller-Olm, eds., 10th Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI 2009), vol. 5403 of Lecture Notes in Computer Science, pp. 74-88, Savannah, Georgia, USA, January 2009. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  22. Mendler, M. and Lüttgen, G. Is observational congruence axiomatisable in equational Horn logic? In L. Caires and V.T. Vasconcelos, eds., 18th Intl. Conf. on Concurrency Theory (CONCUR 2007), vol. 4703 of Lecture Notes in Computer Science, pp. 197-211, Lisbon, Portugal, September 2007. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  23. Lüttgen, G. and Vogler, W. Ready simulation for concurrency: It's logical! In C. Cachin, T. Jurdzinski and A. Tarlecki, eds., 34th Intl. Colloquium on Automata, Languages and Programming (ICALP 2007), vol. 4596 of Lecture Notes in Computer Science, pp. 752-763, Wroclaw, Poland, July 2007. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  24. Ezekiel, J. and Lüttgen, G. Measuring and evaluating parallel state-space exploration algorithms. In I. Cerna and B. Haverkort, eds., 6th Intl. Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2007), vol. 198(1) of Electronic Notes in Theoretical Computer Science, pp. 47-61, Berlin, Germany, July 2007. Elsevier Science. In press. Abstract / Article / BibTeX / DOI.
  25. Ezekiel, J., Lüttgen, G. and Ciardo, G. Parallelising symbolic state-space generators. In W. Damm and H. Hermanns, eds., 19th Intl. Conf. on Computer Aided Verification (CAV 2007), vol. 4590 of Lecture Notes in Computer Science, pp. 268-280, Berlin, Germany, July 2007. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  26. Ciardo, G., Lüttgen, G. and Yu, A. J. Improving static variable orders via invariants. In J. Kleijn and A. Yakovlev, eds., 28th Intl. Conf. on Application and Theory of Petri Nets and Other Models of Concurrency (ICATPN 2007), vol. 4546 of Lecture Notes in Computer Science, pp. 83-103, Siedlce, Poland, June 2007. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  27. Yu, A. J., Ciardo, G. and Lüttgen, G. Bounded reachability checking of asynchronous systems using decision diagrams. In O. Grumberg and M. Huth, eds., 13th Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2007), vol. 4424 of Lecture Notes in Computer Science, pp. 648-663, Braga, Portugal, March 2007. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  28. Ezekiel, J., Lüttgen, G. and Siminiceanu, R. Can Saturation be parallelised? On the parallelisation of a symbolic state-space generator. In L. Brim, B. Haverkort, M. Leucker and J. van de Pol, eds., 5th Intl. Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2006), vol. 4346 of Lecture Notes in Computer Science, pp. 331-346, Bonn, Germany, August 2006. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  29. Mühlberg, J. T. and Lüttgen, G. BLASTing Linux code. In L. Brim, B. Haverkort, M. Leucker and J. van de Pol, eds., 11th Intl. Workshop on Formal Methods for Industrial Critical Systems (FMICS 2006), vol. 4346 of Lecture Notes in Computer Science, pp. 211-226, Bonn, Germany, August 2006. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  30. Lüttgen, G. and Vogler, W. Conjunction on processes: Full-abstraction via ready-tree semantics. In L. Aceto and A. Ingólfsdóttir, eds., 9th Intl. Conf. on Foundations of Software Science and Computation Structures (FOSSACS 2006), vol. 3921 of Lecture Notes in Computer Science, pp. 261-276, Vienna, Austria, April 2006. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  31. Lüttgen, G. and Vogler, W. Bisimulation on speed: A unified approach. In V. Sassone, ed., 8th Intl. Conf. on Foundations of Software Science and Computation Structures (FOSSACS 2005), vol. 3441 of Lecture Notes in Computer Science, pp. 79-94, Edinburgh, Scotland, April 2005. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  32. Lüttgen, G. and Vogler, W. Bisimulation on speed: Lower time bounds. In I. Walukiewicz, ed., 7th Intl. Conf. on Foundations of Software Science and Computation Structures (FOSSACS 2004), vol. 2987 of Lecture Notes in Computer Science, pp. 333-347, Barcelona, Spain, April 2004. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  33. Norton, B., Lüttgen, G. and Mendler, M. A Compositional semantic theory for synchronous component-based design. In R. Amadio and D. Lugiez, eds., 14th Intl. Conf. on Concurrency Theory (CONCUR 2003), vol. 2761 of Lecture Notes in Computer Science, pp. 461-476, Marseille, France, September 2003. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  34. Aguado, J., Lüttgen, G. and Mendler, M. A-maze-ing Esterel. In A. Girault, F. Maraninchi and E. Rutten, eds., Intl. Workshop on Synchronous Languages, Applications, and Programming (SLAP 2003), vol. 88 of Electronic Notes in Theoretical Computer Science, Porto, Portugal, July 2003. Elsevier Science. Abstract / Article / BibTeX.
  35. Lüttgen, G. and Mendler, M. Axiomatizing an algebra of step reactions for synchronous languages. In L. Brim, P. Jancar, M. Kretinsky and A. Kucera, eds., 13th Intl. Conf. on Concurrency Theory (CONCUR 2002), vol. 2421 of Lecture Notes in Computer Science, pp. 386-401, Brno, Czech Republic, August 2002. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  36. Cleaveland, R. and Lüttgen, G. A logical process calculus. In U. Nestmann and P. Panangaden, eds., 9th Intl. Workshop on Expressiveness in Concurrency (EXPRESS 2002), vol. 68, no. 2 of Electronic Notes in Theoretical Computer Science, Brno, Czech Republic, August 2002. Elsevier Science. Abstract / Article / BibTeX.
  37. Lüttgen, G. and Mendler, M. Towards a model-theory for Esterel. In F. Maraninchi, A. Girault and E. Rutten, eds., Intl. Workshop on Synchronous Languages, Applications, and Programming (SLAP 2002), vol. 65, no. 5 of Electronic Notes in Theoretical Computer Science, Grenoble, France, April 2002. Elsevier Science. Abstract / Article / BibTeX.
  38. Lüttgen, G. and Mendler, M. Statecharts: From visual syntax to model-theoretic semantics. In K. Bauknecht, W. Brauer and Th. Mück, eds., GI Workshop on Integrating Diagrammatic and Formal Specification Techniques, pp. 615-621, Vienna, Austria, September 2001. Austrian Computer Society. Abstract / Article / BibTeX.
  39. Lüttgen, G. and Vogler, W. A faster-than relation for asynchronous processes. In K. G. Larsen and M. Nielsen, eds., 12th Intl. Conf. on Concurrency Theory (CONCUR 2001), vol. 2154 of Lecture Notes in Computer Science, pp. 262-276, Aalborg, Denmark, August 2001. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  40. Ciardo, G., Lüttgen, G. and Siminiceanu, R. Saturation: An efficient iteration strategy for symbolic state-space generation. In T. Margaria and W. Yi, eds., 7th Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2001), vol. 2031 of Lecture Notes in Computer Science, pp. 328-342, Genova, Italy, April 2001. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  41. Cleaveland, R. and Lüttgen, G. A semantic theory for heterogeneous system design. In S. Kapoor and S. Prasad, eds., 20th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2000), vol. 1974 of Lecture Notes in Computer Science, pp. 312-324, New Delhi, India, December 2000. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  42. Lüttgen, G., von der Beeck, M. and Cleaveland, R. A compositional approach to Statecharts semantics. In ACM/SIGSOFT 8th Intl. Symposium on Foundations of Software Engineering (FSE 2000), vol. 25, no. 6 of ACM Software Engineering Notes, pp. 120-129, San Diego, California, November 2000. ACM Press. Abstract / Article / BibTeX/ DOI.
  43. Lüttgen, G. and Mendler, M. Fully-abstract Statecharts semantics via intuitionistic Kripke models. In U. Montanari, J. Rolim and E. Welzl, eds., 27th Intl. Colloquium on Automata, Languages and Programming (ICALP 2000), vol. 1853 of Lecture Notes in Computer Science, pp. 163-174, Geneva, Switzerland, July 2000. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  44. Ciardo, G., Lüttgen, G. and Siminiceanu, R. Efficient symbolic state-space construction for asynchronous systems. In M. Nielsen and D. Simpson, eds., 21st Intl. Conf. on Application and Theory of Petri Nets (ICATPN 2000), vol. 1839 of Lecture Notes in Computer Science, pp. 103-122, Aarhus, Denmark, June 2000. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  45. Lüttgen, G. and Carreño, V. Analyzing mode confusion via model checking. In D. Dams, R. Gerth, S. Leue and M. Massink, eds., Intl. Workshop on Theoretical and Practical Aspects of SPIN Model Checking (SPIN '99), vol. 1680 of Lecture Notes in Computer Science, pp. 120-135, Toulouse, France, September 1999. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  46. Lüttgen, G., von der Beeck, M. and Cleaveland, R. Statecharts via process algebra. In J. C. M. Baeten and S. Mauw, eds., 10th Intl. Conf. on Concurrency Theory (CONCUR '99), vol. 1664 of Lecture Notes in Computer Science, pp. 399-414, Eindhoven, The Netherlands, August 1999. Springer-Verlag. Abstract / Article / BibTeX / DOI.
  47. Bhat, G., Cleaveland, R. and Lüttgen, G. Dynamic priorities for modeling real-time. In T. Mizuno, N. Shiratori, T. Higashino and A. Togashi, eds., Intl. Conf. on Formal Description Techniques and Protocol Specification, Testing and Verification (FORTE X/PSTV XVII), pp. 321-336, Osaka, Japan, November 1997. Chapman & Hall. Abstract / Article / BibTeX.
  48. Cleaveland, R., Lüttgen, G. and Mendler, M. An algebraic theory of multiple clocks. In A. Mazurkiewicz and J. Winkowski, eds., 8th Intl. Conf. on Concurrency Theory (CONCUR '97), vol. 1243 of Lecture Notes in Computer Science, pp. 166-180, Warsaw, Poland, July 1997. Springer-Verlag. Abstract / Article / BibTeX.
  49. Cleaveland, R., Lüttgen, G. and Natarajan, V. A process algebra with distributed priorities. In U. Montanari and V. Sassone, eds., 7th Intl. Conf. on Concurrency Theory (CONCUR '96), vol. 1119 of Lecture Notes in Computer Science, pp. 34-49, Pisa, Italy, August 1996. Springer-Verlag. Abstract / Article / BibTeX.
  50. Geser, A., Lüttgen, G., Knoop, J., Rüthing, O. and Steffen, B. Non-monotone fixpoint iterations to resolve second order effects. In T. Gyimóthy, ed., 6th Intl. Symp. on Compiler Construction (CC '96), vol. 1060 of Lecture Notes in Computer Science, pp. 106-120, Linköping, Sweden, April 1996. Springer-Verlag. Abstract / Article / BibTeX.
  51. Cleaveland, R., Lüttgen, G., Natarajan, V. and Sims, S. Priorities for modeling and verifying distributed systems. In T. Margaria and B. Steffen, eds., 2nd Intl. Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '96), vol. 1055 of Lecture Notes in Computer Science, pp. 278-297, Passau, Germany, March 1996. Springer-Verlag. Abstract / Article / BibTeX.

Editorial Duties

  1. Lüttgen, G. and Corradini, F., eds. Comprehending Asynchrony in Specification and Analysis (Festschrift Walter Vogler). Special issue of Acta Informatica, 52(2-3):107-108, April 2015. Preface / BibTeX / DOI.
  2. Lüttgen, G. and Merz, S., eds. Automated Verification of Critical Systems (AVOCS'12). Special issue of Science of Computer Programming, 96(3):277-278, December 2014. Preface / BibTeX / DOI.
  3. Lüttgen, G. and Merz, S., eds. 12th Intl. Workshop on Automated Verification of Critical Systems (AVoCS 2012). Electronic Communications of the EASST, vol. 53, December 2012. Preface / BibTeX / Open Access.
  4. Černá, I. and Lüttgen, G., eds. 7th Intl. Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2008). Electronic Notes in Theoretical Computer Science, vol. 120, issue 2, pp. 1-2, December 2008. Preface / BibTeX / DOI.
  5. Lüttgen, G., Martinez-Madrid, N. and Mendler, M., eds. 2nd Intl. Workshop on Semantic Foundations of Engineering Design Languages (SFEDL 2004). Electronic Notes in Theoretical Computer Science, vol. 115, January 2005. Editorial / BibTeX / DOI.
  6. Broy, M., Lüttgen, G. and Mendler, M., eds. Semantic Foundations of Engineering Design Languages (Part II). Special issue of Formal Aspects of Computing 16(3):165-312, August 2004. Editorial / BibTeX / DOI.
  7. Broy, M., Lüttgen, G. and Mendler, M., eds. Semantic Foundations of Engineering Design Languages (Part I). Special issue of Formal Aspects of Computing 15(4):297-422, December 2003. Editorial / BibTeX / DOI
  8. Lüttgen, G., Maraninchi, F. and Mendler, M., eds. 1st Intl. Workshop on Semantic Foundations of Engineering Design Languages (SFEDL 2002). VERIMAG Workshop Proceedings Series, Grenoble, France, April 2002. Editorial / BibTeX.

Technical Reports & Contractor Reports

  1. Yip, E., Lalo, E., Lüttgen, G., Deubzer, M. and Sailer, A. Optimized buffering of time-triggered automotive software. Technical Report No. 103/2018, Faculty of Information Systems and Applied Computer Sciences, University of Bamberg, Germany, September 2018. Abstract / Article / BibTeX.
  2. Fendrich, S. and Lüttgen, G. A generalised theory of Interface Automata, component compatibility and error. Technical Report No. 98/2016, Faculty of Information Systems and Applied Computer Sciences, University of Bamberg, Germany, March 2016. Abstract / Article / BibTeX.
  3. Bujtor, F., Fendrich, S., Lüttgen, G. and Vogler, W. Nondeterministic Modal Interfaces. Technical Report No. 2014-06, Computer Science Institute, University of Augsburg, Germany, October 2014. Abstract / Article / BibTeX.
  4. Mühlberg, J. T. and Lüttgen, G. Symbolic Object Code Analysis. Technical Report No. 85/2010, Faculty of Information Systems and Applied Computer Sciences, University of Bamberg, Germany, February 2010. Abstract / Article / BibTeX.
  5. Lüttgen, G. and Vogler, W. Safe reasoning with Logic LTS. Technical Report No. 2008-18, Computer Science Institute, University of Augsburg, Germany, November 2008. Abstract / Article / BibTeX.
  6. Galloway, A., Mühlberg, J. T., Siminiceanu, R. and Lüttgen, G. Model-checking part of a Linux file system. Technical Report YCS-2007-423, Department of Computer Science, University of York, England, November 2007. Abstract / Article / BibTeX.
  7. Ezekiel, J., Lüttgen, G. and Siminiceanu, R. I. An anticipated firing Saturation algorithm for shared-memory architectures. Technical Report YCS-2007-422, Department of Computer Science, University of York, England, November 2007. Abstract / Article / BibTeX.
  8. Mühlberg, J. T. and Lüttgen, G. BLASTing Linux code. Technical Report YCS-2007-417, Department of Computer Science, University of York, England, June 2007. Abstract / Article / BibTeX.
  9. Mendler, M. and Lüttgen, G. Is observational congruence on mu-expressions axiomatisable in equational Horn logic? Technical Report No. 72/2007, Faculty of Information Systems and Applied Computer Sciences, University of Bamberg, Germany, June 2007. Abstract / Article / BibTeX.
  10. Lüttgen, G. and Vogler, W. Ready simulation for concurrency: It's logical! Technical Report No. 2007-04, Computer Science Institute, University of Augsburg, Germany, April 2007. Abstract / Article / BibTeX.
  11. Ezekiel, J., Lüttgen, G. and Siminiceanu, R. A parallel saturation algorithm on shared memory architectures. Technical Report 2007-01, National Institute of Aerospace, Virginia, January 2007. Abstract / Article / BibTeX.
  12. Cataño, N. and Lüttgen, G. Enforcing correct programming of libraries: A case study on hash tables. Technical Report YCS-2006-406, Department of Computer Science, University of York, England, July 2006. Abstract / Article / BibTeX.
  13. Lüttgen, G. Formal verification & its role in testing. Technical Report YCS-2006-400, Department of Computer Science, University of York, England, May 2006. Abstract / Article / BibTeX.
  14. Atiya, D., Cataño, N. and Lüttgen, G. Towards a benchmark for model checkers of asynchronous concurrent systems. Technical Report YCS-2006-399, Department of Computer Science, University of York, England, April 2006. Abstract / Article / BibTeX.
  15. Lüttgen, G. and Vogler, W. Conjunction on processes: Full-abstraction via ready-tree semantics. Technical Report YCS-2005-396, Department of Computer Science, University of York, England, December 2005. Abstract / Article / BibTeX.
  16. White, D. and Lüttgen, G. Accessing databases from Esterel. Technical Report YCS-2004-384, Department of Computer Science, University of York, England, December 2004. Abstract / Article / BibTeX.
  17. Lüttgen, G. and Vogler, W. Bisimulation on speed: A unified approach. Technical Report No. 2004-15, Computer Science Institute, University of Augsburg, Germany, December 2004. Abstract / Article / BibTeX.
  18. Lüttgen, G. and Vogler, W. Bisimulation on speed: Lower time bounds. Technical Report No. 2004-1, Computer Science Institute, University of Augsburg, Germany, January 2004. Abstract / Article / BibTeX.
  19. Cleaveland, R. and Lüttgen, G. A logical process calculus. ICASE Report No. 2002-26 (NASA/CR-2002-211759), Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA, USA, August 2002. Abstract / Article / BibTeX.
  20. Ciardo, G., Lüttgen, G. and Siminiceanu, R. . ICASE Report No. 2001-5 (NASA/CR-2001-210663), Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA, USA, February 2001. Abstract / Article / BibTeX.
  21. Lüttgen, G. and Vogler, W. A faster-than relation for asynchronous processes. ICASE Report No. 2001-2 (NASA/CR-2001-210651), Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA, USA, January 2001. Abstract / Article / BibTeX.
  22. Lüttgen, G. and Mendler, M. The intuitionism behind Statecharts steps. ICASE Report No. 2000-28 (NASA/CR-2000-210302), Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA, USA, July 2000. Abstract / Article / BibTeX.
  23. Lüttgen, G. and Mendler, M. What is in a step: A fully-abstract semantics for Statecharts macro steps via intuitionistic Kripke models. Research Memoranda CS-00-04, University of Sheffield, England, June 2000. Abstract / Article / BibTeX.
  24. Cleaveland, R. and Lüttgen, G. Model checking is refinement: Relating Büchi testing and linear-time temporal logic. ICASE Report No. 2000-14 (NASA/CR-2000-210090), Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA, USA, March 2000. Abstract / Article / BibTeX.
  25. Lüttgen, G., von der Beeck, M. and Cleaveland, R. A compositional approach to Statecharts semantics. ICASE Report No. 2000-12 (NASA/CR-2000-210086), Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA, USA, March 2000. Abstract / Article / BibTeX.
  26. Lüttgen, G., Muñoz, C., Butler, R., Di Vito, B. and Miner, P. Towards a customizable PVS. ICASE Report No. 2000-4 (NASA/CR-2000-209851), Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA, USA, January 2000. Abstract / Article / BibTeX.
  27. Ciardo, G., Lüttgen, G. and Siminiceanu, R. Efficient symbolic state-space construction for asynchronous systems. ICASE Report No. 99-50 (NASA/CR-1999-209827), Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA, USA, December 1999. Abstract / Article / BibTeX.
  28. Lüttgen, G., von der Beeck, M. and Cleaveland, R. Statecharts via process algebra. ICASE Report No. 99-42 (NASA/CR-1999-209713), Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA, USA, October 1999. Abstract / Article / BibTeX.
  29. Cleaveland, R., Lüttgen, G. and Natarajan, V. Analyzing mode confusion via model checking. ICASE Report No. 99-18 (NASA/CR-1999-209332), Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA, USA, May 1999. Abstract / Article / BibTeX.
  30. Lüttgen, G., Bhat, G. and Cleaveland, R. A practical approach to implementing real-time semantics. ICASE Report No. 99-4 (NASA/CR-1999-208980), Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA, USA, January 1999. Abstract / Article / BibTeX.
  31. Cleaveland, R., Lüttgen, G. and Natarajan, V. Priority in process algebras. ICASE Report No. 99-3 (NASA/CR-1999-208979), Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA, USA, January 1999. Abstract / Article / BibTeX.
  32. Cleaveland, R. and Lüttgen, G. An algebraic theory of distributed real-time. Technical Report TR-96-04, North Carolina State University, Raleigh, USA, March 1996. Abstract / Article / BibTeX.
  33. Cleaveland, R., Lüttgen, G. and Natarajan, V. A process algebra with distributed priorities. Technical Report TR-96-02, North Carolina State University, Raleigh, USA, March 1996. Abstract / Article / BibTeX.
  34. Geser, A., Knoop, J., Lüttgen, G., Rüthing, O. and Steffen, B. Non-monotone fixpoint iterations to resolve second order effects. Technical Report TR-96-01, North Carolina State University, Raleigh, USA, March 1996. Abstract / Article / BibTeX.
  35. Graf, S., Steffen, B. and Lüttgen, G. Compositional minimization of finite state systems using interface specifications. Technical Report MIP-9505, University of Passau, Germany, January 1995. Abstract / Article / BibTeX.
  36. Geser, A., Knoop, J., Lüttgen, G., Steffen, B. and Rüthing, O. Chaotic fixed point iterations. Technical Report MIP-9403, University of Passau, Germany, October 1994. Abstract / Article / BibTeX.

Book Reviews

  1. Lüttgen, G.: Constraints Meet Concurrency. By Mauro, J. Published by Atlantis Press, 2014, ISBN 978-94-6239-066-9, 148 pages. AMS Mathematical Reviews, 2017. Review.
  2. Lüttgen, G.: Directed Algebraic Topology and Concurrency. By Fajstrup, L., Goubault, E., Haucourt, E., Mimram, S. and Raussen, M. Published by Springer, 2016, ISBN 978-3-319-15397-1, 167 pages. AMS Mathematical Reviews, 2016. Review.
  3. Lüttgen, G.: Unfoldings: A partial-order approach to model checking. By Esparza, J. and Heljanko, K. Published by Springer, 2008, ISBN 978-3-540-77425-9, 169 pages. AMS Mathematical Reviews, 2011. Review.
  4. Lüttgen, G.: Modeling and verification using UML Statecharts. By Drusinsky, D. Published by Newnes Publishers, 2006, ISBN 0-7506-7617-5, 306 pages. Software Testing, Verification and Reliability 18(3):189-190, 2008. Review / BibTeX / DOI.

All Other Works

  1. Rupprecht, T., Boockmann, J. H., White, D. H. and Lüttgen, G. DSI: Automated detection of dynamic data structures in C programs and binary code. In W. Amme and T. S. Heinze, eds., 19th Colloquium on Programming Languages and Foundations of Programming (KPS 2017), vol. Math/Inf/02/2017 of Jenaer Schriften zur Mathematik und Informatik, pp. 134-147, Weimar, Germany, September 2017. Friedrich-Schiller-Universität Jena. Abstract / Article / BibTeX / URL.
  2. White, D. H., Rupprecht, T. and Lüttgen, G. dsOli2: Discovery and comprehension of interconnected lists in C programs. In J. Knoop, ed., 18th Colloquium on Programming Languages and Foundations of Programming (KPS 2015), Pörtschach, Austria, October 2015. Technical University Vienna. Abstract / Article / BibTeX / URL.
  3. Gareis, J., White, D., Lüttgen, G. and Ciardo, G. Improving variable ordering for Saturation by learning from small problem instances. Unpublished addendum to the final report of the grant Improving symbolic software verification via machine learning (BaCaTeC - Bavaria California Technology Center, grant no.: 5 [2012-2]), University of Bamberg, Germany, December 2014. Abstract / Article / BibTeX.
  4. Lüttgen, G. and Mendler, M. When 1 clock is not enough. In L. Aceto and A. D. Gordon, eds., Intl. Workshop on Algebraic Process Calculi: The First Twenty Five Years and Beyond (PA 2005), vol. NS-05-3 of BRICS Notes Series, pp. 155-158, Bertinoro, Italy, August 2005. BRICS - Basic Research in Computer Science, Denmark. Abstract / Article / BibTeX.
  5. White, D. and Lüttgen, G. Accessing databases from Esterel. In S. A. Edwards, N. Halbwachs, R. v. Hanxleden and T. Stauner, eds., Intl. Workshop on Synchronous Programming (SYNCHRON 2004), Schloss Dagstuhl Proceedings Series, Dagstuhl, Germany, July 2005. Abstract / Article / BibTeX.
  6. Lüttgen, G. Formal Methods for the quality assurance of digital systems. Research Quarterly, 7(4), Institute for Computer Applications in Science and Engineering, Universities Space Research Association, December 1998. Abstract / Article / BibTeX.
  7. Lüttgen, G. Kompositionelle Minimierung endlicher verteilter Systeme. Diplomarbeit (MSc thesis). Rheinisch-Westfälische Technische Hochschule (RWTH) Aachen, Germany, March 1994. Abstract / Article / BibTeX.

^ Top