Julian C. Bradfield

Publication Activity (10 Years)

Years Active: 1990-2020
Publications (10 Years): 2

Top Venues

FASE

CoRR

Synth.

CSL

University of Edinburgh, UK (PHD)

Education History

University of Edinburgh, UK

PHD

Publications

Nargess Ghahremani, Julian C. Bradfield
On probabilistic stable event structures. CoRR (2020)
Julian C. Bradfield, Julian Gutierrez, Michael J. Wooldridge
Partial-order Boolean games: informational independence in a logic-based model of strategic interaction. Synth. 193 (3) (2016)
Julian C. Bradfield
Team building in dependence. CSL (2013)
Julian C. Bradfield, Perdita Stevens
Enforcing QVT-R with mu-Calculus and Games. FASE (2013)
Julian C. Bradfield, Perdita Stevens
Recursive Checkonly QVT-R Transformations with General when and where Clauses via the Modal Mu Calculus. FASE (2012)
Julian Gutierrez, Julian C. Bradfield
Model-checking games for fixpoint logics with partial order models. Inf. Comput. 209 (5) (2011)
Simon Kramer, Julian C. Bradfield
A general definition of malware. J. Comput. Virol. 6 (2) (2010)
Julian Gutierrez, Julian C. Bradfield
Model-Checking Games for Fixpoint Logics with Partial Order Models. CONCUR (2009)
Julian C. Bradfield, Jacques Duparc, Sandra Quickert
Transfinite Extension of the Mu-Calculus. CSL (2005)
Julian C. Bradfield, Stephan Kreutzer
The Complexity of Independence-Friendly Fixpoint Logic. CSL (2005)
Julian C. Bradfield, Faron Moller
Preface. INFINITY (2004)
Julian C. Bradfield
Parity of Imperfection of Fixing Independence. CSL (2003)
Julian C. Bradfield
Fixpoints, games and the difference hierarchy. RAIRO Theor. Informatics Appl. 37 (1) (2003)
Julian C. Bradfield
Introduction to Modal and Temporal Mu-Calculi (Abstract). CONCUR (2002)
Julian C. Bradfield, Sibylle B. Fröschle
Independence-Friendly Modal Logic and True Concurrency. Nord. J. Comput. 9 (1) (2002)
Julian C. Bradfield, Juliana Küster Filipe, Perdita Stevens
Enriching OCL Using Observational Mu-Calculus. FASE (2002)
Julian C. Bradfield, Sibylle B. Fröschle
On Logical and Concurrent Equivalences. EXPRESS (2001)
Julian C. Bradfield
Independence: Logics and Concurrency. CSL (2000)
Julian C. Bradfield
Fixpoint alternation: Arithmetic, transition systems, and the binary tree. RAIRO Theor. Informatics Appl. 33 (4/5) (1999)
Julian C. Bradfield
Fixpoint Alternation and the Game Quantifier. CSL (1999)
Julian C. Bradfield
The Modal µ-Calculus Alternation Hierarchy is Strict. Theor. Comput. Sci. 195 (2) (1998)
Julian C. Bradfield
Simplifying the Modal Mu-Calculus Alternation Hierarchy. STACS (1998)
Julian C. Bradfield
On the Expressivity of the Modal Mu-Calculus. STACS (1996)
Julian C. Bradfield
The Modal mu-calculus Alternation Hierarchy is Strict. CONCUR (1996)
Julian C. Bradfield, Javier Esparza, Angelika Mader
An Effective Tableau System for the Linear Time µ-Calculus. ICALP (1996)
Julian C. Bradfield
A Proof Assistant for Symbolic Model-Checking. CAV (1992)
Julian C. Bradfield, Colin Stirling
Local Model Checking for Infinite State Spaces. Theor. Comput. Sci. 96 (1) (1992)
Julian C. Bradfield
Proving temporal properties of Petri Nets. Applications and Theory of Petri Nets (1990)
Julian C. Bradfield, Colin Stirling
Verifying Temporal Properties of Processes. CONCUR (1990)

Julian C. Bradfield.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Julian C. Bradfield