Verifying Higher-Order Functional Programs with Pattern-Matching Algebraic Data Types
Type-based model checking algorithms for higher-order recursion schemes have recently emerged as a promising approach to the verification of functional programs.We introduce pattern-matching recursion schemes (PMRS) as an accurate model of computation for functional programs that manipulate algebrai...
Egile Nagusiak: | Ong, C, Ramsay, S, ACM |
---|---|
Formatua: | Conference item |
Argitaratua: |
2011
|
Antzeko izenburuak
-
Verifying Higher−Order Functional Programs with Pattern Matching Algebraic Data Types
nork: Ong, C, et al.
Argitaratua: (2011) -
Verifying higher-order functional programs with pattern-matching algebraic data types
nork: Ong, C, et al.
Argitaratua: (2010) -
Verifying higher-order concurrency with data automata
nork: Dixon, A, et al.
Argitaratua: (2021) -
Model checking liveness properties of higher-order functional programs
nork: Lester, MM, et al.
Argitaratua: (2011) -
A Verified Algebra for Linked Data
nork: Ross Horne, et al.
Argitaratua: (2011-07-01)