Julian C. Bradfield

According to our database1, Julian C. Bradfield authored at least 31 papers between 1990 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
The mu-calculus and Model Checking.
Proceedings of the Handbook of Model Checking., 2018

2016
Partial-order Boolean games: informational independence in a logic-based model of strategic interaction.
Synth., 2016

2013
Enforcing QVT-R with mu-Calculus and Games.
Proceedings of the Fundamental Approaches to Software Engineering, 2013

Team building in dependence.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012
Recursive Checkonly QVT-R Transformations with General when and where Clauses via the Modal Mu Calculus.
Proceedings of the Fundamental Approaches to Software Engineering, 2012

2011
Model-checking games for fixpoint logics with partial order models.
Inf. Comput., 2011

2010
A general definition of malware.
J. Comput. Virol., 2010

2007
Modal mu-calculi.
Proceedings of the Handbook of Modal Logic., 2007

2005
The Complexity of Independence-Friendly Fixpoint Logic.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

Transfinite Extension of the Mu-Calculus.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2004
Preface.
Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, 2004

2003
Fixpoints, games and the difference hierarchy.
RAIRO Theor. Informatics Appl., 2003

Parity of Imperfection of Fixing Independence.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002
Independence-Friendly Modal Logic and True Concurrency.
Nord. J. Comput., 2002

Enriching OCL Using Observational Mu-Calculus.
Proceedings of the Fundamental Approaches to Software Engineering, 2002

Introduction to Modal and Temporal Mu-Calculi (Abstract).
Proceedings of the CONCUR 2002, 2002

2001
On Logical and Concurrent Equivalences.
Proceedings of the 8th International Workshop on Expressiveness in Concurrency, 2001

Modal Logics and mu-Calculi: An Introduction.
Proceedings of the Handbook of Process Algebra, 2001

2000
Independence: Logics and Concurrency.
Proceedings of the Computer Science Logic, 2000

1999
Fixpoint alternation: Arithmetic, transition systems, and the binary tree.
RAIRO Theor. Informatics Appl., 1999

Fixpoint Alternation and the Game Quantifier.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1998
The Modal µ-Calculus Alternation Hierarchy is Strict.
Theor. Comput. Sci., 1998

Simplifying the Modal Mu-Calculus Alternation Hierarchy.
Proceedings of the STACS 98, 1998

1996
On the Expressivity of the Modal Mu-Calculus.
Proceedings of the STACS 96, 1996

An Effective Tableau System for the Linear Time µ-Calculus.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

The Modal mu-calculus Alternation Hierarchy is Strict.
Proceedings of the CONCUR '96, 1996

1992
Local Model Checking for Infinite State Spaces.
Theor. Comput. Sci., 1992

A Proof Assistant for Symbolic Model-Checking.
Proceedings of the Computer Aided Verification, Fourth International Workshop, 1992

1991
Verifying temporal properties of systems with applications to petri nets.
PhD thesis, 1991

1990
Verifying Temporal Properties of Processes.
Proceedings of the CONCUR '90, 1990

Proving temporal properties of Petri Nets.
Proceedings of the Advances in Petri Nets 1991, 1990


  Loading...