Roland Meyer

According to our database1, Roland Meyer
  • authored at least 55 papers between 2005 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Message from the Guest Editors.
ACM Trans. Embedded Comput. Syst., 2017

Liveness Verification and Synthesis: New Algorithms for Recursive Programs.
CoRR, 2017

Portability Analysis for Axiomatic Memory Models. PORTHOS: One Tool for all Models.
CoRR, 2017

Locality and Singularity for Store-Atomic Memory Models.
CoRR, 2017

On the Upward/Downward Closures of Petri Nets.
CoRR, 2017

2016
Munchausen Iteration.
CoRR, 2016

Antichains for Inclusion Games.
CoRR, 2016

On the Complexity of Bounded Context Switching.
CoRR, 2016

Pointer Race Freedom.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

First-order logic with reachability for infinite-state systems.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Summaries for Context-Free Games.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015
Memory-Model-Aware Testing: A Unified Complexity Analysis.
ACM Trans. Embedded Comput. Syst., 2015

Pointer Race Freedom.
CoRR, 2015

Lazy TSO Reachability.
CoRR, 2015

Antichains for the Verification of Recursive Programs.
Proceedings of the Networked Systems - Third International Conference, 2015

What's Decidable about Availability Languages?.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Lazy TSO Reachability.
Proceedings of the Fundamental Approaches to Software Engineering, 2015

From Program Verification to Time and Space: The Scientific Life of Ernst-Rüdiger Olderog.
Proceedings of the Correct System Design, 2015

2014
Robustness against Power is PSPACE-complete.
CoRR, 2014

Robustness against Relaxed Memory Models.
Proceedings of the Software Engineering 2014, Fachtagung des GI-Fachbereichs Softwaretechnik, 25. Februar, 2014

Robustness against Power is PSpace-complete.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Bounds on Mobility.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Memory Model-Aware Testing - A Unified Complexity Analysis.
Proceedings of the 14th International Conference on Application of Concurrency to System Design, 2014

2013
A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets.
Logical Methods in Computer Science, 2013

A Theory of Partitioned Global Address Spaces.
CoRR, 2013

Static Provenance Verification for Message Passing Programs.
Proceedings of the Static Analysis - 20th International Symposium, 2013

Provenance Verification.
Proceedings of the Reachability Problems - 7th International Workshop, 2013

A Theory of Partitioned Global Address Spaces.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Checking and Enforcing Robustness against TSO.
Proceedings of the Programming Languages and Systems, 2013

A Theory of Name Boundedness.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012
Petri Net Reachability Graphs: Decidability Status of First Order Properties
Logical Methods in Computer Science, 2012

Robustness Checking against TSO: Attacks and Defence
CoRR, 2012

Language-Theoretic Abstraction Refinement.
Proceedings of the Fundamental Approaches to Software Engineering, 2012

A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

An Algorithmic Framework for Coverability in Well-Structured Systems.
Proceedings of the 12th International Conference on Application of Concurrency to System Design, 2012

2011
Modification of the Tool-Workpiece Contact Conditions to Influence the Tool Wear and Workpiece Loading During Hard Turning.
IJAT, 2011

Deciding Robustness against Total Store Ordering.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Petri Net Reachability Graphs: Decidability Status of FO Properties.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010
The Downward-Closure of Petri Net Languages.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Kleene, Rabin, and Scott Are Available.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Petruchio: From Dynamic Networks to Nets.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2009
Structural stationarity in the π-calculus.
PhD thesis, 2009

A Practical Approach to Verification of Mobile Systems Using Net Unfoldings.
Fundam. Inform., 2009

A theory of structural stationarity in the pi -Calculus.
Acta Inf., 2009

Strukturelle Stationarität.
Proceedings of the Ausgezeichnete Informatikdissertationen 2009, 2009

On the Relationship between π-Calculus and Finite Place/Transition Petri Nets.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

Checking pi-Calculus Structural Congruence is Graph Isomorphism Complete.
Proceedings of the Ninth International Conference on Application of Concurrency to System Design, 2009

2008
Reduction of wear induced surface zone effects during hard turning by means of new tool geometries.
Production Engineering, 2008

Model checking Duration Calculus: a practical approach.
Formal Asp. Comput., 2008

On Boundedness in Depth in the pi-Calculus.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

A Practical Approach to Verification of Mobile Systems Using Net Unfoldings.
Proceedings of the Applications and Theory of Petri Nets, 29th International Conference, 2008

2006
Trustworthy software systems: a discussion of basic concepts and terminology.
ACM SIGSOFT Software Engineering Notes, 2006

Model Checking Duration Calculus: A Practical Approach.
Proceedings of the Theoretical Aspects of Computing, 2006

Model Checking Data-Dependent Real-Time Properties of the European Train Control System.
Proceedings of the Formal Methods in Computer-Aided Design, 6th International Conference, 2006

2005
Compositional Semantics for UML 2.0 Sequence Diagrams Using Petri Nets.
Proceedings of the SDL 2005: Model Driven, 2005


  Loading...