| 2005 |
|---|
| 22 | EE | Julian C. Bradfield,
Stephan Kreutzer:
The Complexity of Independence-Friendly Fixpoint Logic.
CSL 2005: 355-368 |
| 21 | EE | Julian C. Bradfield,
Jacques Duparc,
Sandra Quickert:
Transfinite Extension of the Mu-Calculus.
CSL 2005: 384-396 |
| 20 | EE | Julian C. Bradfield,
Faron Moller:
Preface.
Electr. Notes Theor. Comput. Sci. 138(3): 1 (2005) |
| 2003 |
|---|
| 19 | EE | Julian C. Bradfield:
Parity of Imperfection of Fixing Independence.
CSL 2003: 72-85 |
| 18 | EE | Julian C. Bradfield:
Fixpoints, games and the difference hierarchy.
ITA 37(1): 1-15 (2003) |
| 2002 |
|---|
| 17 | | Julian C. Bradfield:
Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings
Springer 2002 |
| 16 | EE | Julian C. Bradfield:
Introduction to Modal and Temporal Mu-Calculi (Abstract).
CONCUR 2002: 98 |
| 15 | EE | Julian C. Bradfield,
Juliana Küster Filipe,
Perdita Stevens:
Enriching OCL Using Observational Mu-Calculus.
FASE 2002: 203-217 |
| 14 | | Julian C. Bradfield,
Sibylle B. Fröschle:
Independence-Friendly Modal Logic and True Concurrency.
Nord. J. Comput. 9(1): 102-117 (2002) |
| 2001 |
|---|
| 13 | EE | Julian C. Bradfield,
Sibylle B. Fröschle:
On Logical and Concurrent Equivalences.
Electr. Notes Theor. Comput. Sci. 52(1): (2001) |
| 2000 |
|---|
| 12 | EE | Julian C. Bradfield:
Independence: Logics and Concurrency.
CSL 2000: 247-261 |
| 1999 |
|---|
| 11 | | Julian C. Bradfield:
Fixpoint Alternation and the Game Quantifier.
CSL 1999: 350-361 |
| 10 | | Julian C. Bradfield:
Fixpoint alternation: Arithmetic, transition systems, and the binary tree.
ITA 33(4/5): 341-356 (1999) |
| 1998 |
|---|
| 9 | | Julian C. Bradfield:
Simplifying the Modal Mu-Calculus Alternation Hierarchy.
STACS 1998: 39-49 |
| 8 | EE | Julian C. Bradfield:
The Modal µ-Calculus Alternation Hierarchy is Strict.
Theor. Comput. Sci. 195(2): 133-153 (1998) |
| 1996 |
|---|
| 7 | | Julian C. Bradfield:
The Modal mu-calculus Alternation Hierarchy is Strict.
CONCUR 1996: 233-246 |
| 6 | | Julian C. Bradfield,
Javier Esparza,
Angelika Mader:
An Effective Tableau System for the Linear Time µ-Calculus.
ICALP 1996: 98-109 |
| 5 | | Julian C. Bradfield:
On the Expressivity of the Modal Mu-Calculus.
STACS 1996: 479-490 |
| 1992 |
|---|
| 4 | | Julian C. Bradfield:
A Proof Assistant for Symbolic Model-Checking.
CAV 1992: 316-329 |
| 3 | | Julian C. Bradfield,
Colin Stirling:
Local Model Checking for Infinite State Spaces.
Theor. Comput. Sci. 96(1): 157-174 (1992) |
| 1990 |
|---|
| 2 | | Julian C. Bradfield:
Proving temporal properties of Petri Nets.
Applications and Theory of Petri Nets 1990: 29-47 |
| 1 | | Julian C. Bradfield,
Colin Stirling:
Verifying Temporal Properties of Processes.
CONCUR 1990: 115-125 |
