Symbolic finite state transducers: Algorithms and applications
Finite automata and finite transducers are used in a wide range of applications in software
engineering, from regular expressions to specification languages. We extend these classic …
engineering, from regular expressions to specification languages. We extend these classic …
Predicate abstraction and CEGAR for higher-order model checking
Higher-order model checking (more precisely, the model checking of higher-order recursion
schemes) has been extensively studied recently, which can automatically decide properties …
schemes) has been extensively studied recently, which can automatically decide properties …
A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes
The model checking of higher-order recursion schemes has important applications in the
verification of higher-order programs. Ong has previously shown that the modal mu-calculus …
verification of higher-order programs. Ong has previously shown that the modal mu-calculus …
Higher-order approximate relational refinement types for mechanism design and differential privacy
Mechanism design is the study of algorithm design where the inputs to the algorithm are
controlled by strategic agents, who must be incentivized to faithfully report them. Unlike …
controlled by strategic agents, who must be incentivized to faithfully report them. Unlike …
Recursion synthesis with unrealizability witnesses
We propose SE2GIS, a novel inductive recursion synthesis approach with the ability to both
synthesize code and declare a problem unsolvable. SE2GIS combines a symbolic variant of …
synthesize code and declare a problem unsolvable. SE2GIS combines a symbolic variant of …
Higher-order model checking: An overview
L Ong - 2015 30th Annual ACM/IEEE Symposium on Logic in …, 2015 - ieeexplore.ieee.org
Higher-order model checking is about the model checking of trees generated by recursion
schemes. The past fifteen years or so have seen considerable progress in both theory and …
schemes. The past fifteen years or so have seen considerable progress in both theory and …
Model checking higher-order programs
N Kobayashi - Journal of the ACM (JACM), 2013 - dl.acm.org
We propose a novel verification method for higher-order functional programs based on
higher-order model checking, or more precisely, model checking of higher-order recursion …
higher-order model checking, or more precisely, model checking of higher-order recursion …
Automatic verification of Erlang-style concurrency
This paper presents an approach to verify safety properties of Erlang-style, higher-order
concurrent programs automatically. Inspired by Core Erlang, we introduce λ Actor, a …
concurrent programs automatically. Inspired by Core Erlang, we introduce λ Actor, a …
Higher-Order Model Checking of Effect-Handling Programs with Answer-Type Modification
Model checking is one of the successful program verification methodologies. Since the
seminal work by Ong, the model checking of higher-order programs―called higher-order …
seminal work by Ong, the model checking of higher-order programs―called higher-order …
A type-directed abstraction refinement approach to higher-order model checking
The trivial-automaton model checking problem for higher-order recursion schemes has
become a widely studied object in connection with the automatic verification of higher-order …
become a widely studied object in connection with the automatic verification of higher-order …