Philippa Gardner

According to our database1, Philippa Gardner authored at least 77 papers between 1991 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
A Trusted Infrastructure for Symbolic Analysis of Event-Driven Web Applications (Artifact).
Dagstuhl Artifacts Ser., 2020

Gillian: Compositional Symbolic Execution for All.
CoRR, 2020

Gillian, part i: a multi-language platform for symbolic execution.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

Data Consistency in Transactional Storage Systems: A Centralised Semantics.
Proceedings of the 34th European Conference on Object-Oriented Programming, 2020

A Trusted Infrastructure for Symbolic Analysis of Event-Driven Web Applications.
Proceedings of the 34th European Conference on Object-Oriented Programming, 2020

2019
JaVerT 2.0: compositional symbolic execution for JavaScript.
Proc. ACM Program. Lang., 2019

Skeletal semantics and their interpretations.
Proc. ACM Program. Lang., 2019

Data Consistency in Transactional Storage Systems: a Centralised Approach.
CoRR, 2019

TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs.
CoRR, 2019

A Program Logic for First-Order Encapsulated WebAssembly.
Proceedings of the 33rd European Conference on Object-Oriented Programming, 2019

2018
JaVerT: JavaScript verification toolchain.
Proc. ACM Program. Lang., 2018

A perspective on specifying and verifying concurrent modules.
J. Log. Algebraic Methods Program., 2018

Symbolic Execution for JavaScript.
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

JaVerT: JavaScript Verification and Testing Framework: Invited Talk.
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

A Concurrent Specification of POSIX File Systems.
Proceedings of the 32nd European Conference on Object-Oriented Programming, 2018

2017
Abstract Specifications for Concurrent Maps.
Proceedings of the Programming Languages and Systems, 2017

Towards Logic-Based Verification of JavaScript Programs.
Proceedings of the Automated Deduction - CADE 26, 2017

2016
Modular Termination Verification for Non-blocking Concurrency.
Proceedings of the Programming Languages and Systems, 2016

DOM: Specification and Client Reasoning.
Proceedings of the Programming Languages and Systems - 14th Asian Symposium, 2016

Verifying Concurrent Graph Algorithms.
Proceedings of the Programming Languages and Systems - 14th Asian Symposium, 2016

2015
Steps in Modular Specifications for Concurrent Modules (Invited Tutorial Paper).
Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics, 2015

Compositional Verification Methods for Next-Generation Concurrency (Dagstuhl Seminar 15191).
Dagstuhl Reports, 2015

Reasoning about the POSIX file system: local update and global pathnames.
Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, 2015

CoLoSL: Concurrent Local Subjective Logic.
Proceedings of the Programming Languages and Systems, 2015

A Trusted Mechanised Specification of JavaScript: One Year On.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

Fault-Tolerant Resource Reasoning.
Proceedings of the Programming Languages and Systems - 13th Asian Symposium, 2015

2014
Abstract Local Reasoning for Concurrent Libraries: Mind the Gap.
Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, 2014

A trusted mechanised JavaScript specification.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Local Reasoning for the POSIX File System.
Proceedings of the Programming Languages and Systems, 2014

TaDA: A Logic for Time and Data Abstraction.
Proceedings of the ECOOP 2014 - Object-Oriented Programming - 28th European Conference, Uppsala, Sweden, July 28, 2014

2013
Views: compositional reasoning for concurrent programs.
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

2012
Processes in space.
Theor. Comput. Sci., 2012

Towards a program logic for JavaScript.
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

2011
A simple abstraction for complex concurrent indexes.
Proceedings of the 26th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2011

Abstract Local Reasoning for Program Modules.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010
Report on the EDBT/ICDT 2010 workshop on updates in XML.
SIGMOD Rec., 2010

Adjunct elimination in Context Logic for trees.
Inf. Comput., 2010

Abstraction and Refinement for Local Reasoning.
Proceedings of the Verified Software: Theories, 2010

Reasoning about client-side web programs: invited talk.
Proceedings of the 2010 EDBT/ICDT Workshops, Lausanne, Switzerland, March 22-26, 2010, 2010

Concurrent Abstract Predicates.
Proceedings of the ECOOP 2010, 2010

2009
A process model of Rho GTP-binding proteins.
Theor. Comput. Sci., 2009

A Process Model of Actin Polymerisation.
Electron. Notes Theor. Comput. Sci., 2009

Footprints in Local Reasoning
Log. Methods Comput. Sci., 2009

Small Specifications for Tree Update.
Proceedings of the Web Services and Formal Methods, 6th International Workshop, 2009

Automatic Parallelization with Separation Logic.
Proceedings of the Programming Languages and Systems, 2009

2008
Behavioural equivalences for dynamic Web data.
J. Log. Algebraic Methods Program., 2008

A Process Model of Rho GTP-binding Proteins in the Context of Phagocytosis.
Electron. Notes Theor. Comput. Sci., 2008

Local Hoare reasoning about DOM.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

DOM: Towards a Formal Specification.
Proceedings of the PLAN-X 2008, 2008

2007
Linear forwarders.
Inf. Comput., 2007

Expressiveness and complexity of graph logic.
Inf. Comput., 2007

Manipulating Trees with Hidden Labels.
Electron. Notes Theor. Comput. Sci., 2007

Local Reasoning about Data Update.
Electron. Notes Theor. Comput. Sci., 2007

An Introduction to Context Logic.
Proceedings of the Logic, 2007

Context logic as modal logic: completeness and parametric inexpressivity.
Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2007

2006
Editorial.
Theor. Comput. Sci., 2006

Local Reasoning About Tree Update.
Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programming Semantics, 2006

2005
Explicit fusions.
Theor. Comput. Sci., 2005

Modelling dynamic web data.
Theor. Comput. Sci., 2005

Context logic and tree update.
Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2005

From Separation Logic to First-Order Logic.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

2004
Adjunct Elimination Through Games in Static Ambient Logic.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

Strong Bisimulation for the Explicit Fusion Calculus.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

04241 Abstracts Collection - Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems.
Proceedings of the Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, 2004

2002
A Spatial Logic for Querying Graphs.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

The Fusion Machine.
Proceedings of the CONCUR 2002, 2002

2000
From Process Calculi to Process Frameworks.
Proceedings of the CONCUR 2000, 2000

1999
Closed Action Calculi.
Theor. Comput. Sci., 1999

1997
A Type-theoretic Description of Action Calculi.
Electron. Notes Theor. Comput. Sci., 1997

Types and Models for Higher-Order Action Calculi.
Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

From Action Calculi to Linear Logic.
Proceedings of the Computer Science Logic, 11th International Workshop, 1997

1995
Equivalences between Logics and Their Representing Type Theories.
Math. Struct. Comput. Sci., 1995

A name-free account of action calculi.
Proceedings of the Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, 1995

1994
Discovering Needed Reductions Using Type Theory.
Proceedings of the Theoretical Aspects of Computer Software, 1994

1993
A New Type Theory for Representing Logics.
Proceedings of the Logic Programming and Automated Reasoning,4th International Conference, 1993

1992
Representing logics in type theory.
PhD thesis, 1992

1991
Unfold/Fold Transformations of Logic Programs.
Proceedings of the Computational Logic - Essays in Honor of Alan Robinson, 1991


  Loading...