Martin Berger

Orcid: 0000-0003-3239-5812

Affiliations:
  • University of Sussex, Department of Informatics, Brighton, United Kingdom


According to our database1, Martin Berger authored at least 28 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
LTL learning on GPUs.
CoRR, 2024

2023
Search-Based Regular Expression Inference on a GPU.
Proc. ACM Program. Lang., 2023

The Regular Expression Inference Challenge.
CoRR, 2023

2022
A program logic for fresh name generation.
Sci. Comput. Program., 2022

Systematic Analysis of Programming Languages and Their Execution Environments for Spectre Attacks.
Proceedings of the 8th International Conference on Information Systems Security and Privacy, 2022

ALARM: Active LeArning of Rowhammer Mitigations.
Proceedings of the 11th International Workshop on Hardware and Architectural Support for Security and Privacy, 2022

2020
Cathoristic Logic.
Proceedings of the From Lambda Calculus to Cybersecurity Through Program Analysis, 2020

2019
Asynchronous sessions with implicit functions and messages.
Sci. Comput. Program., 2019

2017
Modelling Homogeneous Generative Meta-Programming.
Proceedings of the 31st European Conference on Object-Oriented Programming, 2017

2015
Program Logics for Homogeneous Generative Run-Time Meta-Programming.
Log. Methods Comput. Sci., 2015

2014
An observationally complete program logic for imperative higher-order functions.
Theor. Comput. Sci., 2014

Process Types as a Descriptive Tool for Interaction - Control and the Pi-Calculus.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

2012
Specification and verification of meta-programs.
Proceedings of the ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation, 2012

2010
Program Logics for Homogeneous Meta-programming.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009
Program Logics for Sequential Higher-Order Control.
Proceedings of the Fundamentals of Software Engineering, 2009

2008
Logical Reasoning for Higher-Order Functions with Local State.
Log. Methods Comput. Sci., 2008

Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Linearity and bisimulation.
J. Log. Algebraic Methods Program., 2007

A logical analysis of aliasing in imperative higher-order functions.
J. Funct. Program., 2007

Timed, Distributed, Probabilistic, Typed Processes.
Proceedings of the Programming Languages and Systems, 5th Asian Symposium, 2007

2006
Descriptive and Relative Completeness of Logics for Higher-Order Functions.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Genericity and the pi-calculus.
Acta Informatica, 2005

An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

2004
Strong normalisation in the pi -calculus.
Inf. Comput., 2004

Basic Theory of Reduction Congruence forTwo Timed Asynchronous pi-Calculi.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
Towards abstractions for distributed systems.
PhD thesis, 2003

2001
Sequentiality and the pi-Calculus.
Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

2000
The Two-Phase Commitment Protocol in an Extended pi-Calculus.
Proceedings of the 7th International Workshop on Expressiveness in Concurrency, 2000


  Loading...