PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Hoffmann, Berthold"

Author of the publication

copydeleteadd this publication to your clipboard
Preface.

, , and . Int. J. Software and Informatics, 9 (2): 113-115 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Bastian Hoffmann University of Stuttgart

Univ. -Prof. Dr. phil. Thorben Hoffmann University of Stuttgart

Andreas Hoffmann University of Stuttgart

Dennis Hoffmann University of Stuttgart

Kathrin Hoffmann University of Stuttgart

 

Other publications of authors with the same name

Adaptive star grammars and their languages., , , and . Theor. Comput. Sci., 411 (34-36): 3090-3109 (2010)Transformation of Shaped Nested Graphs and Diagrams., and . Electr. Notes Theor. Comput. Sci., 59 (4): 305-319 (2001)Generating Instance Graphs from Class Diagrams with Adaptive Star Grammars., and . ECEASST, (2011)A case study to evaluate the suitability of graph transformation tools for program refactoring., , , and . STTT, 12 (3-4): 183-199 (2010)Approximating Parikh Images for Generating Deterministic Graph Parsers., , and . STAF Workshops, volume 9946 of Lecture Notes in Computer Science, page 112-128. Springer, (2016)Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars., , and . ICGT, volume 10373 of Lecture Notes in Computer Science, page 106-122. Springer, (2017)Predictive Top-Down Parsing for Hyperedge Replacement Grammars., , and . ICGT, volume 9151 of Lecture Notes in Computer Science, page 19-34. Springer, (2015)Abstraction and Control for Shapely Nested Graph Transformation.. ICGT, volume 2505 of Lecture Notes in Computer Science, page 177-191. Springer, (2002)Generalized Predictive Shift-Reduce Parsing for Hyperedge Replacement Graph Grammars., and . LATA, volume 11417 of Lecture Notes in Computer Science, page 233-245. Springer, (2019)Cloning and Expanding Graph Transformation Rules for Refactoring., , and . Electron. Notes Theor. Comput. Sci., (2006)