Search the dblp DataBase
Julian C. Bradfield: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Julian C. Bradfield
Proving temporal properties of Petri Nets. [Citation Graph (0, 0)][DBLP]
Applications and Theory of Petri Nets, 1990, pp:29-47 [Conf] - Julian C. Bradfield
A Proof Assistant for Symbolic Model-Checking. [Citation Graph (0, 0)][DBLP]
CAV, 1992, pp:316-329 [Conf] - Julian C. Bradfield
Introduction to Modal and Temporal Mu-Calculi (Abstract). [Citation Graph (0, 0)][DBLP]
CONCUR, 2002, pp:98- [Conf] - Julian C. Bradfield
The Modal mu-calculus Alternation Hierarchy is Strict. [Citation Graph (0, 0)][DBLP]
CONCUR, 1996, pp:233-246 [Conf] - Julian C. Bradfield, Colin Stirling
Verifying Temporal Properties of Processes. [Citation Graph (0, 0)][DBLP]
CONCUR, 1990, pp:115-125 [Conf] - Julian C. Bradfield
Independence: Logics and Concurrency. [Citation Graph (0, 0)][DBLP]
CSL, 2000, pp:247-261 [Conf] - Julian C. Bradfield
Parity of Imperfection of Fixing Independence. [Citation Graph (0, 0)][DBLP]
CSL, 2003, pp:72-85 [Conf] - Julian C. Bradfield
Fixpoint Alternation and the Game Quantifier. [Citation Graph (0, 0)][DBLP]
CSL, 1999, pp:350-361 [Conf] - Julian C. Bradfield, Jacques Duparc, Sandra Quickert
Transfinite Extension of the Mu-Calculus. [Citation Graph (0, 0)][DBLP]
CSL, 2005, pp:384-396 [Conf] - Julian C. Bradfield, Stephan Kreutzer
The Complexity of Independence-Friendly Fixpoint Logic. [Citation Graph (0, 0)][DBLP]
CSL, 2005, pp:355-368 [Conf] - Julian C. Bradfield, Juliana Küster Filipe, Perdita Stevens
Enriching OCL Using Observational Mu-Calculus. [Citation Graph (0, 0)][DBLP]
FASE, 2002, pp:203-217 [Conf] - Julian C. Bradfield, Javier Esparza, Angelika Mader
An Effective Tableau System for the Linear Time µ-Calculus. [Citation Graph (0, 0)][DBLP]
ICALP, 1996, pp:98-109 [Conf] - Julian C. Bradfield
Simplifying the Modal Mu-Calculus Alternation Hierarchy. [Citation Graph (0, 0)][DBLP]
STACS, 1998, pp:39-49 [Conf] - Julian C. Bradfield
On the Expressivity of the Modal Mu-Calculus. [Citation Graph (0, 0)][DBLP]
STACS, 1996, pp:479-490 [Conf] - Julian C. Bradfield, Sibylle B. Fröschle
On Logical and Concurrent Equivalences. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2001, v:52, n:1, pp:- [Journal] - Julian C. Bradfield, Faron Moller
Preface. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:1- [Journal] - Julian C. Bradfield
Fixpoints, games and the difference hierarchy. [Citation Graph (0, 0)][DBLP]
ITA, 2003, v:37, n:1, pp:1-15 [Journal] - Julian C. Bradfield
Fixpoint alternation: Arithmetic, transition systems, and the binary tree. [Citation Graph (0, 0)][DBLP]
ITA, 1999, v:33, n:4/5, pp:341-356 [Journal] - Julian C. Bradfield, Sibylle B. Fröschle
Independence-Friendly Modal Logic and True Concurrency. [Citation Graph (0, 0)][DBLP]
Nord. J. Comput., 2002, v:9, n:1, pp:102-117 [Journal] - Julian C. Bradfield
The Modal µ-Calculus Alternation Hierarchy is Strict. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1998, v:195, n:2, pp:133-153 [Journal] - Julian C. Bradfield, Colin Stirling
Local Model Checking for Infinite State Spaces. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1992, v:96, n:1, pp:157-174 [Journal]
Model-Checking Games for Fixpoint Logics with Partial Order Models. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002