Glynn Winskel

According to our database1, Glynn Winskel authored at least 130 papers between 1979 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Game semantics for quantum programming.
PACMPL, 2019

Thin Games with Symmetry and Concurrent Hyland-Ong Games.
Logical Methods in Computer Science, 2019

Concurrent Quantum Strategies.
Proceedings of the Reversible Computation - 11th International Conference, 2019

2018
Continuous Probability Distributions in Concurrent Games.
Electr. Notes Theor. Comput. Sci., 2018

The concurrent game semantics of Probabilistic PCF.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Non-angelic Concurrent Game Semantics.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

The True Concurrency of Herbrand's Theorem.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017
Games and Strategies as Event Structures.
Logical Methods in Computer Science, 2017

Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or.
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

Distributed Strategies Made Easy.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Strategies with Parallel Causes.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016
Distributed Games and Strategies.
CoRR, 2016

Strategies with Parallel Causes.
CoRR, 2016

Concurrent Games.
CoRR, 2016

2015
The Parallel Intensionally Fully Abstract Games Model of PCF.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

On Probabilistic Distributed Strategies.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

2014
On the determinacy of concurrent games on event structures with infinite winning sets.
J. Comput. Syst. Sci., 2014

Strategies as Concurrent Processes.
Electr. Notes Theor. Comput. Sci., 2014

Concurrent Hyland-Ong games.
CoRR, 2014

Symmetry in concurrent games.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Probabilistic and Quantum Event Structures.
Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

2013
Constraining rule-based dynamics with types.
Mathematical Structures in Computer Science, 2013

Distributed Probabilistic and Quantum Strategies.
Electr. Notes Theor. Comput. Sci., 2013

On Concurrent Games with Payoff.
Electr. Notes Theor. Comput. Sci., 2013

Strategies as Profunctors.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

Borel Determinacy of Concurrent Games.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

Imperfect Information in Logic and Concurrent Games.
Proceedings of the Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, 2013

2012
Deterministic concurrent strategies.
Formal Asp. Comput., 2012

Containment in Rule-Based Models.
Electr. Notes Theor. Comput. Sci., 2012

The Winning Ways of Concurrent Games.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Bicategories of Concurrent Games - (Invited Paper).
Proceedings of the Foundations of Software Science and Computational Structures, 2012

Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect Information.
Proceedings of the Logic and Program Semantics, 2012

2011
Events, Causality and Symmetry.
Comput. J., 2011

Concurrent Strategies.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010
On the Expressivity of Symmetry in Event Structures.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009
Prime algebraicity.
Theor. Comput. Sci., 2009

Nominal Domain Theory for Concurrency.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008
Independence and Concurrent Separation Logic.
Logical Methods in Computer Science, 2008

Independence and Concurrent Separation Logic
CoRR, 2008

The unfolding of general Petri nets.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra.
Proceedings of the Concurrency, 2008

Events, Causality and Symmetry.
Proceedings of the Visions of Computer Science, 2008

2007
Event Structures with Symmetry.
Electr. Notes Theor. Comput. Sci., 2007

Event Structure Spans for Nondeterministic Dataflow.
Electr. Notes Theor. Comput. Sci., 2007

Preface.
Electr. Notes Theor. Comput. Sci., 2007

Symmetry and Concurrency.
Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006
Probabilistic event structures and domains.
Theor. Comput. Sci., 2006

Distributing probability over non-determinism.
Mathematical Structures in Computer Science, 2006

Independence and Concurrent Separation Logic.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

2005
Profunctors, open maps and bisimulation.
Mathematical Structures in Computer Science, 2005

Petri Nets With Persistence.
Electr. Notes Theor. Comput. Sci., 2005

Limit Preservation from Naturality.
Electr. Notes Theor. Comput. Sci., 2005

Name Generation and Linearity.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Relations in Concurrency.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

2004
Domain theory for concurrency.
Theor. Comput. Sci., 2004

A relational model of non-deterministic dataflow.
Mathematical Structures in Computer Science, 2004

New-HOPLA: A Higher-order Process Language with Name Generation.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Probabilistic Event Structures and Domains.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
Presheaf models for CCS-like languages.
Theor. Comput. Sci., 2003

Full Abstraction for HOPLA.
Proceedings of the CONCUR 2003, 2003

2002
Guest Editorial.
Inf. Comput., 2002

Linearity in Process Languages.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

Composing Strand Spaces.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

Calculus for categories.
Proceedings of the Fixed Points in Computer Science, 2002

HOPLA-A Higher-Order Process Language.
Proceedings of the CONCUR 2002, 2002

2001
A Higher-Order Calculus for Categories.
Proceedings of the Theorem Proving in Higher Order Logics, 14th International Conference, 2001

Petri nets in cryptographic protocols.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Events in security protocols.
Proceedings of the CCS 2001, 2001

2000
Preface.
Ann. Pure Appl. Logic, 2000

Bistructures, bidomains, and linear logic.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999
Weak Bisimulation and Open Maps.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

Event Structures as Presheaves -Two Representation Theorems.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
A Theory of Recursive Domains with Applications to Concurrency.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

A Relational Model of Non-deterministic Dataflow.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

A Categorical Axiomatics for Bisimulation.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

A Linear Metalanguage for Concurrency.
Proceedings of the Algebraic Methodology and Software Technology, 1998

1997
An Operational Understanding of Bisimulation from Open Maps.
Electr. Notes Theor. Comput. Sci., 1997

Completeness Results for Linear Logic on Petri Nets.
Ann. Pure Appl. Logic, 1997

Presheaf Models for the pi-Calculus.
Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

1996
Models for Concurrency: Towards a Classification.
Theor. Comput. Sci., 1996

Petri Nets and Bisimulation.
Theor. Comput. Sci., 1996

Bisimulation from Open Maps.
Inf. Comput., 1996

Presheaves as transition systems.
Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

Presheaf Models for Concurrency.
Proceedings of the Computer Science Logic, 10th International Workshop, 1996

A Presheaf Semantics of Value-Passing Processes.
Proceedings of the CONCUR '96, 1996

1995
CCS with Priority Choice
Inf. Comput., January, 1995

Trace Structures and other Models for Concurrency.
Proceedings of the Book of Traces, 1995

1994
Stable Bistructure Models of PCF.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

A Compositional Proof System for the Modal mu-Calculus
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

Bistructures, Bidomains and Linear Logic.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
Relationships Between Models of Concurrency.
Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

Linear Logic on Petri Nets.
Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

Deterministic Behavioural Models for Concurrency.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Completeness Results for Linear Logic on Petri Nets.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Bisimulation and open maps
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

A Classification of Models for Concurrency.
Proceedings of the CONCUR '93, 1993

The formal semantics of programming languages - an introduction.
Foundation of computing series, MIT Press, ISBN: 978-0-262-23169-5, 1993

1992
Compositional Checking of Satsfaction.
Formal Methods in System Design, 1992

1991
Using Information Systems to Solve Recursive Domain Equations
Inf. Comput., April, 1991

A Note on Model Checking the Modal nu-Calculus.
Theor. Comput. Sci., 1991

CCS with Priority Choice
Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Petri Nets and Transition Systems (Abstract for an invited talk).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

Compositional Checking of Satisfaction.
Proceedings of the Computer Aided Verification, 3rd International Workshop, 1991

1990
A Compositional Proof System on a Category of Labelled Transition Systems
Inf. Comput., 1990

On the Compositional Checking of Validity (Extended Abstract).
Proceedings of the CONCUR '90, 1990

Petri Nets as Models of Linear Logic.
Proceedings of the CAAP '90, 1990

1989
Domain Theoretic Models of Polymorphism
Inf. Comput., May, 1989

A Note on Model Checking the Modal nu-Calculus.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988
An introduction to event structures.
Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

A Category of Labelled Petri Nets and Compositional Proof System (Extended Abstract)
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987
Petri Nets, Algebras, Morphisms, and Compositionality
Inf. Comput., March, 1987

DI-Domains as a Model of Polymorphism.
Proceedings of the Mathematical Foundations of Programming Language Semantics, 1987

Relating Two Models of Hardware.
Proceedings of the Category Theory and Computer Science, 1987

1986
Event Structures.
Proceedings of the Petri Nets: Central Models and Their Properties, 1986

1985
On Powerdomains and Modality.
Theor. Comput. Sci., 1985

A Complete System for SCCS with Modal Assertions.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1985

Category Theory and Models for Parallel Computation.
Proceedings of the Category Theory and Computer Programming, 1985

Petri nets, morphisms and compositionality.
Proceedings of the Advances in Petri Nets 1985, 1985

1984
Synchronization Trees.
Theor. Comput. Sci., 1984

A New Definition of Morphism on Petri Nets.
Proceedings of the STACS 84, 1984

Using Information Systems to Solve Recursive Domain Equations Effectively.
Proceedings of the Semantics of Data Types, International Symposium, 1984

Categories of Models for Concurrency.
Proceedings of the Seminar on Concurrency, 1984

On the Composition and Decomposition of Assertions.
Proceedings of the Seminar on Concurrency, 1984

1983
Synchronisation Trees.
Proceedings of the Automata, 1983

A Note on Powerdomains and Modalitiy.
Proceedings of the Fundamentals of Computation Theory, 1983

1982
Event Structure Semantics for CCS and Related Languages.
Proceedings of the Automata, 1982

1981
Petri Nets, Event Structures and Domains, Part I.
Theor. Comput. Sci., 1981

An Exercise in Processes with Infinite Pasts.
Proceedings of the Application and Theory of Petri Nets, 1981

1979
Petri Nets, Event Structures and Domains.
Proceedings of the Semantics of Concurrent Computation, 1979


  Loading...