Abstraction and model checking of core Erlang programs in Maude
From MaRDI portal
Recommendations
- Equational abstractions for model checking Erlang programs
- Verification of Erlang programs using abstract interpretation and model checking
- Towards Erlang verification by term rewriting
- Model checking Erlang programs -- abstracting recursive function calls
- scientific article; zbMATH DE number 2090137
Cites work
Cited in
(17)- A proof assistant based formalisation of a subset of sequential core Erlang
- Strategies, model checking and branching-time properties in Maude
- Program equivalence in an untyped, call-by-value functional language with uncurried functions
- scientific article; zbMATH DE number 1691455 (Why is no real title available?)
- Verification of Erlang programs using abstract interpretation and model checking
- Model checking Erlang programs -- abstracting recursive function calls
- Equational abstractions for model checking Erlang programs
- Towards Erlang verification by term rewriting
- Towards symbolic execution in Erlang
- scientific article; zbMATH DE number 1942462 (Why is no real title available?)
- scientific article; zbMATH DE number 2090137 (Why is no real title available?)
- Model checking strategy-controlled rewriting systems
- Equational abstractions for reducing the state space of rewrite theories
- Computer Aided Systems Theory – EUROCAST 2005
- Verification of Erlang processes by dependency pairs
- Playing with bisimulation in Erlang
- A formalisation of Core Erlang, a concurrent actor language
This page was built for publication: Abstraction and model checking of core Erlang programs in Maude
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873779)