default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulian C. Bradfield
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i1]Nargess Ghahremani, Julian C. Bradfield:
On probabilistic stable event structures. CoRR abs/2012.10188 (2020)
2010 – 2019
- 2018
- [p3]Julian C. Bradfield, Igor Walukiewicz:
The mu-calculus and Model Checking. Handbook of Model Checking 2018: 871-919 - 2016
- [j8]Julian C. Bradfield, Julian Gutierrez, Michael J. Wooldridge:
Partial-order Boolean games: informational independence in a logic-based model of strategic interaction. Synth. 193(3): 781-811 (2016) - 2013
- [c20]Julian C. Bradfield:
Team building in dependence. CSL 2013: 116-128 - [c19]Julian C. Bradfield, Perdita Stevens:
Enforcing QVT-R with mu-Calculus and Games. FASE 2013: 282-296 - 2012
- [c18]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 - 2011
- [j7]Julian Gutierrez, Julian C. Bradfield:
Model-checking games for fixpoint logics with partial order models. Inf. Comput. 209(5): 766-781 (2011) - 2010
- [j6]Simon Kramer
, Julian C. Bradfield:
A general definition of malware. J. Comput. Virol. 6(2): 105-114 (2010)
2000 – 2009
- 2009
- [c17]Julian Gutierrez, Julian C. Bradfield:
Model-Checking Games for Fixpoint Logics with Partial Order Models. CONCUR 2009: 354-368 - 2007
- [p2]Julian C. Bradfield, Colin Stirling:
Modal mu-calculi. Handbook of Modal Logic 2007: 721-756 - 2005
- [c16]Julian C. Bradfield, Stephan Kreutzer:
The Complexity of Independence-Friendly Fixpoint Logic. CSL 2005: 355-368 - [c15]Julian C. Bradfield, Jacques Duparc, Sandra Quickert:
Transfinite Extension of the Mu-Calculus. CSL 2005: 384-396 - [e2]Julian C. Bradfield, Faron Moller:
Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, INFINITY 2004, London, UK, September 4, 2004. Electronic Notes in Theoretical Computer Science 138(3), Elsevier 2005 [contents] - 2004
- [c14]Julian C. Bradfield, Faron Moller:
Preface. INFINITY 2004: 1 - 2003
- [j5]Julian C. Bradfield:
Fixpoints, games and the difference hierarchy. RAIRO Theor. Informatics Appl. 37(1): 1-15 (2003) - [c13]Julian C. Bradfield:
Parity of Imperfection of Fixing Independence. CSL 2003: 72-85 - 2002
- [j4]Julian C. Bradfield, Sibylle B. Fröschle:
Independence-Friendly Modal Logic and True Concurrency. Nord. J. Comput. 9(1): 102-117 (2002) - [c12]Julian C. Bradfield:
Introduction to Modal and Temporal Mu-Calculi (Abstract). CONCUR 2002: 98 - [c11]Julian C. Bradfield, Juliana Küster Filipe, Perdita Stevens:
Enriching OCL Using Observational Mu-Calculus. FASE 2002: 203-217 - [e1]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. Lecture Notes in Computer Science 2471, Springer 2002, ISBN 3-540-44240-5 [contents] - 2001
- [c10]Julian C. Bradfield, Sibylle B. Fröschle:
On Logical and Concurrent Equivalences. EXPRESS 2001: 32-45 - [p1]Julian C. Bradfield, Colin Stirling:
Modal Logics and mu-Calculi: An Introduction. Handbook of Process Algebra 2001: 293-330 - 2000
- [c9]Julian C. Bradfield:
Independence: Logics and Concurrency. CSL 2000: 247-261
1990 – 1999
- 1999
- [j3]Julian C. Bradfield:
Fixpoint alternation: Arithmetic, transition systems, and the binary tree. RAIRO Theor. Informatics Appl. 33(4/5): 341-356 (1999) - [c8]Julian C. Bradfield:
Fixpoint Alternation and the Game Quantifier. CSL 1999: 350-361 - 1998
- [j2]Julian C. Bradfield:
The Modal µ-Calculus Alternation Hierarchy is Strict. Theor. Comput. Sci. 195(2): 133-153 (1998) - [c7]Julian C. Bradfield:
Simplifying the Modal Mu-Calculus Alternation Hierarchy. STACS 1998: 39-49 - 1996
- [c6]Julian C. Bradfield:
The Modal mu-calculus Alternation Hierarchy is Strict. CONCUR 1996: 233-246 - [c5]Julian C. Bradfield, Javier Esparza, Angelika Mader:
An Effective Tableau System for the Linear Time µ-Calculus. ICALP 1996: 98-109 - [c4]Julian C. Bradfield:
On the Expressivity of the Modal Mu-Calculus. STACS 1996: 479-490 - 1992
- [j1]Julian C. Bradfield, Colin Stirling:
Local Model Checking for Infinite State Spaces. Theor. Comput. Sci. 96(1): 157-174 (1992) - [c3]Julian C. Bradfield:
A Proof Assistant for Symbolic Model-Checking. CAV 1992: 316-329 - 1991
- [b1]Julian C. Bradfield:
Verifying temporal properties of systems with applications to petri nets. University of Edinburgh, UK, 1991 - 1990
- [c2]Julian C. Bradfield:
Proving temporal properties of Petri Nets. Applications and Theory of Petri Nets 1990: 29-47 - [c1]Julian C. Bradfield, Colin Stirling:
Verifying Temporal Properties of Processes. CONCUR 1990: 115-125
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
