11 citations · 32 across the 14 of their papers we have counts for
15 papers
PrideMM: A Solver for Relaxed Memory Models
Simon Cooksey, Sarah Harris, Mark Batty +2
Relaxed memory models are notoriously delicate. To ease their study, several ad hoc simulators have been developed for axiomatic memory models. We show how axiomatic memory models…
Selective Monitoring
Radu Grigore, Stefan Kiefer
We study selective monitors for labelled Markov chains. Monitors observe the outputs that are generated by a Markov chain during its run, with the goal of identifying runs as corre…
On the Quest for an Acyclic Graph
Mikolas Janota, Radu Grigore, Vasco Manquinho
The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given a propositional formula ϕ over edges of a fixed-size graph, the objective is to…
Java Generics are Turing Complete
Radu Grigore
This paper describes a reduction from the halting problem of Turing machines to subtype checking in Java. It follows that subtype checking in Java is undecidable, which answers a q…
Abstraction Refinement Guided by a Learnt Probabilistic Model
Radu Grigore, Hongseok Yang
The core challenge in designing an effective static program analysis is to find a good program abstraction -- one that retains only details relevant to a given query. In this paper…
Tree Buffers
Radu Grigore, Stefan Kiefer
In runtime verification, the central problem is to decide if a given program execution violates a given property. In online runtime verification, a monitor observes a program's exe…