Pages that link to "Item:Q1331625"
From MaRDI portal
The following pages link to Isabelle. A generic theorem prover (Q1331625):
Displaying 50 items.
- Nominal logic, a first order theory of names and binding (Q1887151) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- A process calculus BigrTiMo of mobile systems and its formal semantics (Q2026376) (← links)
- A generic and executable formalization of signature-based Gröbner basis algorithms (Q2028994) (← links)
- Verification of dynamic bisimulation theorems in Coq (Q2035655) (← links)
- Isabelle's metalogic: formalization and proof checker (Q2055847) (← links)
- Experiences from exporting major proof assistant libraries (Q2069875) (← links)
- Logic-independent proof search in logical frameworks (short paper) (Q2096460) (← links)
- Theorem proving as constraint solving with coherent logic (Q2102932) (← links)
- A formalization and proof checker for Isabelle's metalogic (Q2108191) (← links)
- The undecidability of proof search when equality is a logical connective (Q2134939) (← links)
- Symbolic automatic relations and their applications to SMT and CHC solving (Q2145347) (← links)
- From LCF to Isabelle/HOL (Q2280211) (← links)
- Limited second-order functionality in a first-order setting (Q2303245) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- Formalization of geometric algebra in HOL Light (Q2323452) (← links)
- Morphism axioms (Q2402279) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- Verifying a scheduling protocol of safety-critical systems (Q2424721) (← links)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- An approach to automatic deductive synthesis of functional programs (Q2457802) (← links)
- On the mechanization of the proof of Hessenberg's theorem in coherent logic (Q2471743) (← links)
- Rewriting conversions implemented with continuations (Q2655323) (← links)
- Admissibility of structural rules for contraction-free systems of intuitionistic logic (Q2710593) (← links)
- Compensation methods to support cooperative applications: A case study in automated verification of schema requirements for an advanced transaction model (Q2744791) (← links)
- Automating Soundness Proofs (Q2810691) (← links)
- Towards an Awareness-Based Semantics for Security Protocol Analysis (Q2841215) (← links)
- A Representation of Fω in LF (Q2841235) (← links)
- Ours Is to Reason Why (Q2842639) (← links)
- A Meta Linear Logical Framework (Q2871843) (← links)
- Narrowing and Rewriting Logic: from Foundations to Applications (Q2873786) (← links)
- A Proof Theoretic Interpretation of Model Theoretic Hiding (Q2890327) (← links)
- Towards Logical Frameworks in the Heterogeneous Tool Set Hets (Q2890328) (← links)
- Proofs and Reconstructions (Q2964467) (← links)
- Formalization of Entropy Measures in HOL (Q3088009) (← links)
- Composable Discovery Engines for Interactive Theorem Proving (Q3088022) (← links)
- Exploring the Foundations of Discrete Analytical Geometry in Isabelle/HOL (Q3102733) (← links)
- Extracting a DPLL Algorithm (Q3178287) (← links)
- Translating a Dependently-Typed Logic to First-Order Logic (Q3184740) (← links)
- Machine-Checked Proof-Theory for Propositional Modal Logics (Q3305555) (← links)
- Formal Logic Definitions for Interchange Languages (Q3453113) (← links)
- Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers (Q3454091) (← links)
- A Declarative Language for the Coq Proof Assistant (Q3499750) (← links)
- Modelling Attacker’s Knowledge for Cascade Cryptographic Protocols (Q3535379) (← links)
- Automating Algebraic Specifications of Non-freely Generated Data Types (Q3540070) (← links)
- The Isabelle Framework (Q3543647) (← links)
- LCF-Style Propositional Simplification with BDDs and SAT Solvers (Q3543649) (← links)
- Lightweight Separation (Q3543659) (← links)
- Real Number Calculations and Theorem Proving (Q3543660) (← links)
- The dodecahedral conjecture (Q3584349) (← links)