Julian C. Bradfield - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2016

Partial-order Boolean games: informational independence in a logic-based model of strategic interactionJulian C. Bradfield, Julian Gutierrez, Michael Wooldridge. synthese, 193(3):781-811, 2016. [doi]

2013

Team building in dependenceJulian C. Bradfield. csl 2013: 116-128 [doi]

Enforcing QVT-R with mu-Calculus and GamesJulian C. Bradfield, Perdita Stevens. FASE 2013: 282-296 [doi]

2012

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

2011

Model-checking games for fixpoint logics with partial order modelsJulian Gutierrez, Julian C. Bradfield. iandc, 209(5):766-781, 2011. [doi]

2010

A general definition of malwareSimon Kramer, Julian C. Bradfield. virology, 6(2):105-114, 2010. [doi]

2009

Model-Checking Games for Fixpoint Logics with Partial Order ModelsJulian Gutierrez, Julian C. Bradfield. concur 2009: 354-368 [doi]

2007

Modal mu-calculiJulian C. Bradfield, Colin Stirling. In Patrick Blackburn, J. F. A. K. van Benthem, Frank Wolter, editors, Handbook of Modal Logic. Volume 3 of Studies in logic and practical reasoning, pages 721-756, North-Holland, 2007. [doi]

2005

Transfinite Extension of the Mu-CalculusJulian C. Bradfield, Jacques Duparc, Sandra Quickert. csl 2005: 384-396 [doi]

PrefaceJulian C. Bradfield, Faron Moller. ENTCS, 138(3):1, 2005. [doi]

The Complexity of Independence-Friendly Fixpoint LogicJulian C. Bradfield, Stephan Kreutzer. csl 2005: 355-368 [doi]

2003

Parity of Imperfection of Fixing IndependenceJulian C. Bradfield. csl 2003: 72-85 [doi]

Fixpoints, games and the difference hierarchyJulian C. Bradfield. ita, 37(1):1-15, 2003. [doi]

2002

Introduction to Modal and Temporal Mu-Calculi (Abstract)Julian C. Bradfield. concur 2002: 98 [doi]

Independence-Friendly Modal Logic and True ConcurrencyJulian C. Bradfield, Sibylle B. Fröschle. njc, 9(1):102-117, 2002.

Enriching OCL Using Observational Mu-CalculusJulian C. Bradfield, Juliana Küster Filipe, Perdita Stevens. FASE 2002: 203-217 [doi]

2001

On Logical and Concurrent EquivalencesJulian C. Bradfield, Sibylle B. Fröschle. ENTCS, 52(1):32-45, 2001. [doi]

Modal Logics and mu-Calculi: An IntroductionJulian C. Bradfield, Colin Stirling. In Jan A. Bergstra, Alban Ponse, Scott A. Smolka, editors, Handbook of Process Algebra. pages 293-330, North-Holland / Elsevier, 2001. [doi]

2000

Independence: Logics and ConcurrencyJulian C. Bradfield. csl 2000: 247-261 [doi]

1999

Fixpoint Alternation and the Game QuantifierJulian C. Bradfield. csl 1999: 350-361

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

1998

The Modal µ-Calculus Alternation Hierarchy is StrictJulian C. Bradfield. TCS, 195(2):133-153, 1998. [doi]

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

1996

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

The Modal mu-calculus Alternation Hierarchy is StrictJulian C. Bradfield. concur 1996: 233-246

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

1992

A Proof Assistant for Symbolic Model-CheckingJulian C. Bradfield. cav 1993: 316-329

Local Model Checking for Infinite State SpacesJulian C. Bradfield, Colin Stirling. TCS, 96(1):157-174, 1992.

1991

Verifying temporal properties of systems with applications to petri netsJulian C. Bradfield. PhD thesis, University of Edinburgh, UK, 1991. [doi]

1990

Proving temporal properties of Petri NetsJulian C. Bradfield. apn 1991: 29-47

Verifying Temporal Properties of ProcessesJulian C. Bradfield, Colin Stirling. concur 1990: 115-125

Sign in or sign up to see more results.

runs on WebDSL