Cyclist
From MaRDI portal
Software:30358
No author found.
Source code repository: https://github.com/ngorogiannis/cyclist
Related Items (26)
Program Verification with Separation Logic ⋮ Soundness and completeness proofs by coinductive methods ⋮ Transforming orthogonal inductive definition sets into confluent term rewrite systems ⋮ Uniform interpolation from cyclic proofs: the case of modal mu-calculus ⋮ Disproving Inductive Entailments in Separation Logic via Base Pair Approximation ⋮ Deciding Entailments in Inductive Separation Logic with Tree Automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ PSPACE-completeness of a thread criterion for circular proofs in linear logic with least and greatest fixed points ⋮ Automated mutual induction proof in separation logic ⋮ Compositional entailment checking for a fragment of separation logic ⋮ Sound and complete equational reasoning over comodels ⋮ Cyclic Arithmetic Is Equivalent to Peano Arithmetic ⋮ Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System ⋮ Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic ⋮ Program Equivalence is Coinductive ⋮ Partial evaluation of string obfuscations for Java malware detection ⋮ Unnamed Item ⋮ Automatically verifying temporal properties of pointer programs with cyclic proof ⋮ Combining induction and saturation-based theorem proving ⋮ Model checking for symbolic-heap separation logic with inductive predicates ⋮ Unnamed Item ⋮ Induction and Skolemization in saturation theorem proving ⋮ Circular proofs for the Gödel-Löb provability logic ⋮ Inductive theorem proving based on tree grammars ⋮ Cyclic proofs, hypersequents, and transitive closure logic
This page was built for software: Cyclist
