Julian C. Bradfield

Julian C. Bradfield, Perdita Stevens: Enforcing QVT-R with mu-Calculus and Games. FASE 2013: 282-296

Julian C. Bradfield, Perdita Stevens: Recursive Checkonly QVT-R Transformations with General when and where Clauses via the Modal Mu Calculus. FASE 2012: 194-208

Julian Gutierrez, Julian C. Bradfield: Model-checking games for fixpoint logics with partial order models. Inf. Comput. 209(5): 766-781 (2011)

Simon Kramer, Julian C. Bradfield: A general definition of malware. Journal in Computer Virology 6(2): 105-114 (2010)

Julian Gutierrez, Julian C. Bradfield: Model-Checking Games for Fixpoint Logics with Partial Order Models. CONCUR 2009: 354-368

Julian C. Bradfield, Faron Moller: Preface. Electr. Notes Theor. Comput. Sci. 138(3): 1 (2005)

Julian C. Bradfield, Stephan Kreutzer: The Complexity of Independence-Friendly Fixpoint Logic. CSL 2005: 355-368

Julian C. Bradfield, Jacques Duparc, Sandra Quickert: Transfinite Extension of the Mu-Calculus. CSL 2005: 384-396

Julian C. Bradfield: Fixpoints, games and the difference hierarchy. ITA 37(1): 1-15 (2003)

Julian C. Bradfield: Parity of Imperfection of Fixing Independence. CSL 2003: 72-85

Julian C. Bradfield, Sibylle B. Fröschle: Independence-Friendly Modal Logic and True Concurrency. Nord. J. Comput. 9(1): 102-117 (2002)

Julian C. Bradfield: Introduction to Modal and Temporal Mu-Calculi (Abstract). CONCUR 2002: 98

Julian C. Bradfield, Juliana Küster Filipe, Perdita Stevens: Enriching OCL Using Observational Mu-Calculus. FASE 2002: 203-217

Julian C. Bradfield (Ed.): Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings. Lecture Notes in Computer Science 2471, Springer 2002, isbn 3-540-44240-5

Julian C. Bradfield, Sibylle B. Fröschle: On Logical and Concurrent Equivalences. Electr. Notes Theor. Comput. Sci. 52(1): 32-45 (2001)

Julian C. Bradfield: Independence: Logics and Concurrency. CSL 2000: 247-261

Julian C. Bradfield: Fixpoint alternation: Arithmetic, transition systems, and the binary tree. ITA 33(4/5): 341-356 (1999)

Julian C. Bradfield: Fixpoint Alternation and the Game Quantifier. CSL 1999: 350-361

Julian C. Bradfield: The Modal µ-Calculus Alternation Hierarchy is Strict. Theor. Comput. Sci. 195(2): 133-153 (1998)

Julian C. Bradfield: Simplifying the Modal Mu-Calculus Alternation Hierarchy. STACS 1998: 39-49

Julian C. Bradfield: The Modal mu-calculus Alternation Hierarchy is Strict. CONCUR 1996: 233-246

Julian C. Bradfield, Javier Esparza, Angelika Mader: An Effective Tableau System for the Linear Time µ-Calculus. ICALP 1996: 98-109

Julian C. Bradfield: On the Expressivity of the Modal Mu-Calculus. STACS 1996: 479-490

Julian C. Bradfield, Colin Stirling: Local Model Checking for Infinite State Spaces. Theor. Comput. Sci. 96(1): 157-174 (1992)

Julian C. Bradfield: A Proof Assistant for Symbolic Model-Checking. CAV 1992: 316-329

Julian C. Bradfield: Proving temporal properties of Petri Nets. Applications and Theory of Petri Nets 1990: 29-47

Julian C. Bradfield, Colin Stirling: Verifying Temporal Properties of Processes. CONCUR 1990: 115-125