Julian C. Bradfield

35 papers A* 2A 2B 14Journal 9Unranked 3
YearRankTypeTitle / Venue / Authors
2020 J jnl
On probabilistic stable event structures.
CoRR
Nargess Ghahremani, Julian C. Bradfield
2018 — ch.
The mu-calculus and Model Checking.
Handbook of Model Checking
Julian C. Bradfield, Igor Walukiewicz
2016 J jnl
Partial-order Boolean games: informational independence in a logic-based model of strategic interaction.
Synth.
Julian C. Bradfield, Julian Gutierrez, Michael J. Wooldridge
2013 B conf
Enforcing QVT-R with mu-Calculus and Games.
FASE
Julian C. Bradfield, Perdita Stevens
2013 B conf
Team building in dependence.
CSL
Julian C. Bradfield
2012 B conf
Recursive Checkonly QVT-R Transformations with General when and where Clauses via the Modal Mu Calculus.
FASE
Julian C. Bradfield, Perdita Stevens
2011 J jnl
Model-checking games for fixpoint logics with partial order models.
Inf. Comput.
Julian Gutierrez, Julian C. Bradfield
2010 J jnl
A general definition of malware.
J. Comput. Virol.
Simon Kramer, Julian C. Bradfield
2009 B conf
Model-Checking Games for Fixpoint Logics with Partial Order Models.
CONCUR
Julian Gutierrez, Julian C. Bradfield
2007 — ch.
Modal mu-calculi.
Handbook of Modal Logic
Julian C. Bradfield, Colin Stirling
2005 — ed.
Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, INFINITY 2004, London, UK, September 4, 2004
INFINITY
Julian C. Bradfield, Faron Moller
2005 B conf
The Complexity of Independence-Friendly Fixpoint Logic.
CSL
Julian C. Bradfield, Stephan Kreutzer
2005 B conf
Transfinite Extension of the Mu-Calculus.
CSL
Julian C. Bradfield, Jacques Duparc, Sandra Quickert
2004 — conf
Preface.
INFINITY
Julian C. Bradfield, Faron Moller
2003 J jnl
Fixpoints, games and the difference hierarchy.
RAIRO Theor. Informatics Appl.
Julian C. Bradfield
2003 B conf
Parity of Imperfection of Fixing Independence.
CSL
Julian C. Bradfield
2002 B ed.
Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings
CSL
Julian C. Bradfield
2002 B conf
Enriching OCL Using Observational Mu-Calculus.
FASE
Julian C. Bradfield, Juliana Küster Filipe, Perdita Stevens
2002 J jnl
Independence-Friendly Modal Logic and True Concurrency.
Nord. J. Comput.
Julian C. Bradfield, Sibylle B. Fröschle
2002 B conf
Introduction to Modal and Temporal Mu-Calculi (Abstract).
CONCUR
Julian C. Bradfield
2001 — ch.
Modal Logics and mu-Calculi: An Introduction.
Handbook of Process Algebra
Julian C. Bradfield, Colin Stirling
2001 — conf
On Logical and Concurrent Equivalences.
EXPRESS
Julian C. Bradfield, Sibylle B. Fröschle
2000 B conf
Independence: Logics and Concurrency.
CSL
Julian C. Bradfield
1999 B conf
Fixpoint Alternation and the Game Quantifier.
CSL
Julian C. Bradfield
1999 J jnl
Fixpoint alternation: Arithmetic, transition systems, and the binary tree.
RAIRO Theor. Informatics Appl.
Julian C. Bradfield
1998 A conf
Simplifying the Modal Mu-Calculus Alternation Hierarchy.
STACS
Julian C. Bradfield
1998 J jnl
The Modal µ-Calculus Alternation Hierarchy is Strict.
Theor. Comput. Sci.
Julian C. Bradfield
1996 A* conf
An Effective Tableau System for the Linear Time µ-Calculus.
ICALP
Julian C. Bradfield, Javier Esparza, Angelika Mader
1996 A conf
On the Expressivity of the Modal Mu-Calculus.
STACS
Julian C. Bradfield
1996 B conf
The Modal mu-calculus Alternation Hierarchy is Strict.
CONCUR
Julian C. Bradfield
1992 A* conf
A Proof Assistant for Symbolic Model-Checking.
CAV
Julian C. Bradfield
1992 J jnl
Local Model Checking for Infinite State Spaces.
Theor. Comput. Sci.
Julian C. Bradfield, Colin Stirling
1991 — —
Verifying temporal properties of systems with applications to petri nets.
Julian C. Bradfield
1990 — conf
Proving temporal properties of Petri Nets.
Applications and Theory of Petri Nets
Julian C. Bradfield
1990 B conf
Verifying Temporal Properties of Processes.
CONCUR
Julian C. Bradfield, Colin Stirling