Steven Ramsay

Orcid: 0000-0002-0825-8386

Affiliations:
  • University of Bristol, UK


According to our database1, Steven Ramsay authored at least 23 papers between 2011 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Ill-Typed Programs Don't Evaluate.
Proc. ACM Program. Lang., January, 2024

2023
Higher-Order MSL Horn Constraints.
Proc. ACM Program. Lang., January, 2023

Effects and Effect Handlers for Programmable Inference.
CoRR, 2023

Effect Handlers for Programmable Inference.
Proceedings of the 16th ACM SIGPLAN International Haskell Symposium, 2023

2022
CycleQ: an efficient basis for cyclic equational reasoning.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

2021
Intensional datatype refinement: with application to scalable verification of pattern-match safety.
Proc. ACM Program. Lang., 2021

Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020
Verifying Liveness Properties of ML Programs.
CoRR, 2020

Intensional Datatype Refinement.
CoRR, 2020

2019
DEQ: Equivalence Checker for Deterministic Register Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2019

2018
Higher-order constrained horn clauses for verification.
Proc. ACM Program. Lang., 2018

Defunctionalization of Higher-Order Constrained Horn Clauses.
CoRR, 2018

Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Reachability in pushdown register automata.
J. Comput. Syst. Sci., 2017

Higher-Order Constrained Horn Clauses and Refinement Types.
CoRR, 2017

2015
Bisimilarity in Fresh-Register Automata.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Game Semantic Analysis of Equivalence in IMJ.
Proceedings of the Automated Technology for Verification and Analysis, 2015

A Contextual Equivalence Checker for IMJ ∗.
Proceedings of the Automated Technology for Verification and Analysis, 2015

2014
Intersection types and higer-order model checking.
PhD thesis, 2014

Exact Intersection Type Abstractions for Safety Checking of Recursion Schemes.
Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, 2014

A type-directed abstraction refinement approach to higher-order model checking.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

2012
A traversal-based algorithm for higher-order model checking.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012

2011
Verifying higher-order functional programs with pattern-matching algebraic data types.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011


  Loading...