Clemens Grabmayer

51 papers A* 3A 2B 5C 1Journal 26Unranked 13
YearRankTypeTitle / Venue / Authors
2025 — conf
Bisimilarity and Simulatability of Processes Parameterized by Join Interactions.
ICE
Clemens Grabmayer, Maurizio Murgia
2023 J jnl
A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity.
Log. Methods Comput. Sci.
Clemens Grabmayer
2023 — conf
From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes.
DCM
Clemens Grabmayer
2023 — ed.
Proceedings Twelfth International Workshop on Computing with Terms and Graphs, TERMGRAPH@FSCD 2022, Technion, Haifa, Israel, 1st August 2022.
TERMGRAPH@FSCD
Clemens Grabmayer
2023 J jnl
The Image of the Process Interpretation of Regular Expressions is Not Closed under Bisimulation Collapse.
CoRR
Clemens Grabmayer
2022 J jnl
A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity.
CoRR
Clemens Grabmayer
2022 J jnl
Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete (Crystallization: Near-Collapsing Process Graph Interpretations of Regular Expressions).
CoRR
Clemens Grabmayer
2021 B conf
A Coinductive Version of Milner's Proof System for Regular Expressions Modulo Bisimilarity.
CALCO
Clemens Grabmayer
2021 J jnl
A Coinductive Version of Milner's Proof System for Regular Expressions Modulo Bisimilarity.
CoRR
Clemens Grabmayer
2020 A* conf
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity.
LICS
Clemens Grabmayer, Wan J. Fokkink
2020 J jnl
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity.
CoRR
Clemens Grabmayer, Wan J. Fokkink
2020 J jnl
Structure-Constrained Process Graphs for the Process Semantics of Regular Expressions.
CoRR
Clemens Grabmayer
2020 — conf
Structure-Constrained Process Graphs for the Process Semantics of Regular Expressions.
TERMGRAPH@FSCD
Clemens Grabmayer
2018 — conf
Modeling Terms by Graphs with Structure Constraints (Two Illustrations).
TERMGRAPH@FSCD
Clemens Grabmayer
2016 J jnl
Linear Depth Increase of Lambda Terms in Leftmost-Outermost Beta-Reduction Rewrite Sequences.
CoRR
Clemens Grabmayer
2015 A* conf
Regularity Preserving but Not Reflecting Encodings.
LICS
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
2015 J jnl
Regularity Preserving but not Reflecting Encodings.
CoRR
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
2015 J jnl
The Degree of Squares is an Atom (Extended Version).
CoRR
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Hans Zantema
2015 — conf
The Degree of Squares is an Atom.
WORDS
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Hans Zantema
2014 J jnl
Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples.
Log. Methods Comput. Sci.
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom
2014 J jnl
Maximal Sharing in the Lambda Calculus with letrec.
CoRR
Clemens Grabmayer, Jan Rochel
2014 A conf
Maximal sharing in the Lambda calculus with letrec.
ICFP
Clemens Grabmayer, Jan Rochel
2014 — conf
Nested Term Graphs.
TERMGRAPH
Clemens Grabmayer, Vincent van Oostrom
2013 — conf
Expressibility in the Lambda Calculus with Mu.
RTA
Clemens Grabmayer, Jan Rochel
2013 J jnl
Expressibility in the Lambda Calculus with mu
CoRR
Clemens Grabmayer, Jan Rochel
2013 C conf
Mix-Automatic Sequences.
LATA
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
2013 — conf
Term Graph Representations for Cyclic Lambda-Terms
TERMGRAPH
Clemens Grabmayer, Jan Rochel
2013 J jnl
Term Graph Representations for Cyclic Lambda-Terms.
CoRR
Clemens Grabmayer, Jan Rochel
2012 J jnl
Automatic Sequences and Zip-Specifications
CoRR
Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss
2012 A* conf
Automatic Sequences and Zip-Specifications.
LICS
Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss
2012 J jnl
Expressibility in the Lambda Calculus with Letrec
CoRR
Clemens Grabmayer, Jan Rochel
2012 J jnl
Expressive power of digraph solvability.
Ann. Pure Appl. Log.
Marc Bezem, Clemens Grabmayer, Michal Walicki
2011 J jnl
On equal μ-terms.
Theor. Comput. Sci.
Jörg Endrullis, Clemens Grabmayer, Jan Willem Klop, Vincent van Oostrom
2011 J jnl
On the Termination of Russell's Description Elimination Algorithm.
Rev. Symb. Log.
Clemens Grabmayer, Joop Leo, Vincent van Oostrom, Albert Visser
2011 — conf
Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress)
TERMGRAPH
Jan Rochel, Clemens Grabmayer
2010 J jnl
Productivity of stream definitions.
Theor. Comput. Sci.
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop
2010 — conf
Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting.
RTA
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom
2009 J jnl
Complexity of Fractran and Productivity
CoRR
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
2009 A conf
Complexity of Fractran and Productivity.
CADE
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
2009 J jnl
From Abstract Rewriting Systems to Abstract Proof Systems
CoRR
Clemens Grabmayer
2009 J jnl
Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting
CoRR
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop
2008 J jnl
Data-Oblivious Stream Productivity
CoRR
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
2008 B conf
Data-Oblivious Stream Productivity.
LPAR
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
2008 — conf
Proving Infinitary Normalization.
TYPES
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Roel C. de Vrijer
2007 J jnl
A characterization of regular expressions under bisimulation.
J. ACM
Jos C. M. Baeten, Flavio Corradini, Clemens Grabmayer
2007 J jnl
A duality between proof systems for cyclic term graphs.
Math. Struct. Comput. Sci.
Clemens Grabmayer
2007 B conf
Productivity of Stream Definitions.
FCT
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop
2006 B conf
Some Remarks on Definability of Process Graphs.
CONCUR
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
2005 — conf
Reflections on a Geometry of Processes.
APC 25
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
2005 B conf
Using Proofs by Coinduction to Find "Traditional" Proofs.
CALCO
Clemens Grabmayer
2002 — conf
A Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs.
TERMGRAPH
Clemens Grabmayer