Formalization of Properties of Functional Programs
From MaRDI portal
Cited in
(22)- A multiprocess network logic with temporal and spatial modalities
- Program invariants as fixedpoints
- The correctness of nondeterministic programs
- Automatic synthesis of logical models for order-sorted first-order theories
- Programs as partial graphs. I: Flow equivalence and correctness
- Formalization of correctness of recursive definitions
- Control extension in a recursive language
- Formalization of properties of nondeterministic recursive definitions
- On the completeness of the inductive assertion method
- Current methods for proving program correctness
- Mathematical theory of partial correctness
- Formal descriptions of code properties: decidability, complexity, implementation
- Resolution for some first-order modal systems
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II
- Alternative semantics for temporal logics
- Proving assertions about parallel programs
- Reasoning about programs
- Formalization of equivalence of recursively defined functions
- Properties Incompleteness Evaluation by Functional Verification
- Verifying programs by induction on their data structure: general format and applications
- The \(\mu\)-calculus as an assertion-language for fairness arguments
- Computation of equilibria in noncooperative games
This page was built for publication: Formalization of Properties of Functional Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5606281)
