default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBerthold Hoffmann
Person information
- affiliation: University of Bremen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i3]Frank Drewes, Berthold Hoffmann, Mark Minas:
Finite Automata for Efficient Graph Recognition. CoRR abs/2404.15052 (2024)- 2022
- [c37]Frank Drewes
, Berthold Hoffmann, Mark Minas:
Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power. ICGT 2022: 3-19 - 2021
- [c36]Frank Drewes, Berthold Hoffmann, Mark Minas:
Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars. ICGT 2021: 164-184 - [e3]Berthold Hoffmann, Mark Minas:
Proceedings Twelfth International Workshop on Graph Computational Models, GCM@STAF 2021, Online, 22nd June 2021. EPTCS 350, 2021 [contents] - 2020
- [c35]Frank Drewes, Berthold Hoffmann, Mark Minas:
Graph Parsing as Graph Transformation - Correctness of Predictive Top-Down Parsers. ICGT 2020: 221-238 - [e2]Berthold Hoffmann, Mark Minas:
Proceedings of the Eleventh International Workshop on Graph Computation Models, GCM@STAF 2020, Online-Workshop, 24th June 2020. EPTCS 330, 2020 [contents]
2010 – 2019
- 2019
- [j15]Frank Drewes, Berthold Hoffmann, Mark Minas:
Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement. J. Log. Algebraic Methods Program. 104: 303-341 (2019) - [c34]Frank Drewes, Berthold Hoffmann, Mark Minas:
Extending Predictive Shift-Reduce Parsing to Contextual Hyperedge Replacement Grammars. ICGT 2019: 55-72 - [c33]Berthold Hoffmann, Mark Minas:
Generalized Predictive Shift-Reduce Parsing for Hyperedge Replacement Graph Grammars. LATA 2019: 233-245 - 2018
- [i2]Frank Drewes, Berthold Hoffmann, Mark Minas:
Formalization and Correctness of Predictive Shift-Reduce Parsers for Graph Grammars based on Hyperedge Replacement. CoRR abs/1812.11927 (2018) - 2017
- [c32]Frank Drewes, Berthold Hoffmann, Mark Minas:
Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars. ICGT 2017: 106-122 - [c31]Berthold Hoffmann, Mark Minas:
Generating Efficient Predictive Shift-Reduce Parsers for Hyperedge Replacement Grammars. STAF Workshops 2017: 76-91 - 2016
- [c30]Frank Drewes, Berthold Hoffmann, Mark Minas:
Approximating Parikh Images for Generating Deterministic Graph Parsers. STAF Workshops 2016: 112-128 - 2015
- [j14]Frank Drewes, Berthold Hoffmann:
Contextual hyperedge replacement. Acta Informatica 52(6): 497-524 (2015) - [j13]Berthold Hoffmann, Dieter Hutter, Hui Shi:
Preface. Int. J. Softw. Informatics 9(2): 113-115 (2015) - [c29]Frank Drewes, Berthold Hoffmann, Mark Minas:
Predictive Top-Down Parsing for Hyperedge Replacement Grammars. ICGT 2015: 19-34 - [c28]Marcus Ermler, Berthold Hoffmann, Christian John, Christopher Nottrodt, Carsten Pfeffer:
Entwurf und Implementierung einer Programmiersprache im studentischen Projekt Monty's Coconut. Software Engineering (Workshops) 2015: 164-170 - 2014
- [j12]Berthold Hoffmann:
More on Graph Rewriting With Contextual Refinement. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 71 (2014) - 2013
- [j11]Berthold Hoffmann:
Graph Rewriting with Contextual Refinement. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 61 (2013) - 2011
- [j10]Berthold Hoffmann, Mark Minas:
Generating Instance Graphs from Class Diagrams with Adaptive Star Grammars. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 39 (2011) - [c27]Frank Drewes, Berthold Hoffmann, Mark Minas:
Contextual Hyperedge Replacement. AGTIVE 2011: 182-197 - 2010
- [j9]Frank Drewes, Annegret Habel, Berthold Hoffmann, Detlef Plump:
Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 26 (2010) - [j8]Berthold Hoffmann:
Conditional Adaptive Star Grammars. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 26 (2010) - [j7]Berthold Hoffmann, Mark Minas:
Defining Models - Meta Models versus Graph Grammars. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 29 (2010) - [j6]Francisco Javier Pérez, Yania Crespo, Berthold Hoffmann, Tom Mens:
A case study to evaluate the suitability of graph transformation tools for program refactoring. Int. J. Softw. Tools Technol. Transf. 12(3-4): 183-199 (2010) - [j5]Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas:
Adaptive star grammars and their languages. Theor. Comput. Sci. 411(34-36): 3090-3109 (2010)
2000 – 2009
- 2008
- [c26]Frank Drewes, Berthold Hoffmann, Mark Minas:
Adaptive Star Grammars for Graph Models. ICGT 2008: 442-457 - 2007
- [c25]Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas, Niels Van Eetvelde:
Shaped Generic Graph Transformation. AGTIVE 2007: 201-216 - 2006
- [c24]Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas, Niels Van Eetvelde:
Adaptive Star Grammars. ICGT 2006: 77-91 - [c23]Mark Minas, Berthold Hoffmann:
An Example of Cloning Graph Transformation Rules for Programming. GT-VMT@ETAPS 2006: 241-250 - 2005
- [c22]Berthold Hoffmann:
Graph Transformation with Variables. Formal Methods in Software and Systems Modeling 2005: 101-115 - [c21]Berthold Hoffmann, Dirk Janssens, Niels Van Eetvelde:
Cloning and Expanding Graph Transformation Rules for Refactoring. GRaMoT@GPCE 2005: 53-67 - 2004
- [c20]Annegret Habel, Berthold Hoffmann:
Parallel Independence in Hierarchical Graph Transformation. ICGT 2004: 178-193 - [c19]Frank Drewes, Berthold Hoffmann, Raimund Klein, Mark Minas:
Rule-Based Programming with Diaplan. GraBaTs 2004: 15-26 - 2003
- [j4]Berthold Hoffmann:
Abstraction and Control for Shapely Nested Graph Transformation. Fundam. Informaticae 58(1): 39-65 (2003) - 2002
- [j3]Frank Drewes, Berthold Hoffmann, Detlef Plump:
Hierarchical Graph Transformation. J. Comput. Syst. Sci. 64(2): 249-283 (2002) - [c18]Berthold Hoffmann:
Abstraction and Control for Shapely Nested Graph Transformation. ICGT 2002: 177-191 - 2001
- [c17]Berthold Hoffmann:
Shapely Hierarchical Graph Transformation. HCC 2001: 30-37 - [c16]Mark Minas, Berthold Hoffmann:
Specifying and Implementing Visual Process Modeling Languages with DiaGen. UNIGRA 2001: 67-79 - [c15]Giorgio Busatto, Berthold Hoffmann:
Comparing Notions of Hierarchical Graph Transformation. GT-VMT@ICALP 2001: 310-317 - [c14]Berthold Hoffmann, Mark Minas:
Transformation of Shaped Nested Graphs and Diagrams. RULE@PLI 2001: 305-319 - 2000
- [c13]Frank Drewes, Berthold Hoffmann, Detlef Plump:
Hierarchical Graph Transformation. FoSSaCS 2000: 98-113 - [c12]Berthold Hoffmann, Mark Minas:
A Generic Model for Diagram Syntax and Semantics. ICALP Satellite Workshops 2000: 443-450 - [c11]Berthold Hoffmann, Mark Minas:
Towards Generic Rule-Based Visual Programming. VL 2000: 65-66 - [i1]Berthold Hoffmann, Mark Minas:
Towards rule-based visual programming of generic visual systems. CoRR cs.PL/0010016 (2000)
1990 – 1999
- 1999
- [j2]Marc Andries, Gregor Engels, Annegret Habel, Berthold Hoffmann, Hans-Jörg Kreowski, Sabine Kuske, Detlef Plump, Andy Schürr, Gabriele Taentzer:
Graph Transformation for Specification and Programming. Sci. Comput. Program. 34(1): 1-54 (1999) - [c10]Berthold Hoffmann:
From Graph Transformation to Rule-Based Programming with Diagrams. AGTIVE 1999: 165-180 - 1998
- [c9]Reiko Heckel, Berthold Hoffmann, Peter Knirsch, Sabine Kuske:
Simple Modules for GRACE. TAGT 1998: 383-395 - 1993
- [e1]Berthold Hoffmann, Bernd Krieg-Brückner:
Program Development by Specification and Transformation, The PROSPECTRA Methodology, Language Family, and System. Lecture Notes in Computer Science 680, Springer 1993, ISBN 3-540-56733-X [contents] - 1992
- [c8]Berthold Hoffmann:
Term Rewriting with Sharing and Memoïzation. ALP 1992: 128-142 - 1991
- [j1]Berthold Hoffmann, Detlef Plump:
Implementing term rewriting by jungle evaluation. RAIRO Theor. Informatics Appl. 25: 445-472 (1991) - [c7]Berthold Hoffmann, Bernd Krieg-Brückner:
The PROSPECTRA System. VDM Europe (1) 1991: 668-669 - [c6]Berthold Hoffmann, Bernd Krieg-Brückner:
The PROSPECTRA System. STACS 1991: 539-540
1980 – 1989
- 1988
- [c5]Berthold Hoffmann, Detlef Plump:
Jungle Evaluation for Efficient Term Rewriting. ALP 1988: 191-203 - 1983
- [b1]Berthold Hoffmann:
Compiler generation: from language definitions to abstract compilers. Technical University of Berlin, Germany, 1983, pp. 1-248 - 1982
- [c4]Berthold Hoffmann:
Modelling compiler generation by graph grammars. Graph-Grammars and Their Application to Computer Science 1982: 159-171 - 1981
- [c3]Hartmut Ehrig, Berthold Hoffmann, Ilse Schmiedecke:
A Graph-Theoretical Model for Multi-Pass Parsing. WG 1981: 19-32 - 1980
- [c2]Berthold Hoffmann, Ilse-Renate Schmiedecke:
A Mathematical Approach to Multi-Pass Parsing. MFCS 1980: 275-290
1970 – 1979
- 1979
- [c1]Helmut Franzen, Berthold Hoffmann:
Automatic Determination of Data Flow in Extended Affix Grammars. GI Jahrestagung 1979: 176-193
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-27 20:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
