Pages that link to "Item:Q1331625"
From MaRDI portal
The following pages link to Isabelle. A generic theorem prover (Q1331625):
Displayed 45 items.
- Balancing the load. Leveraging a semantics stack for systems verification (Q835780) (← links)
- Ordinal arithmetic: Algorithms and mechanization (Q851144) (← links)
- TPS: A hybrid automatic-interactive system for developing proofs (Q865629) (← links)
- A proof-centric approach to mathematical assistants (Q865648) (← links)
- Computer supported mathematics with \(\Omega\)MEGA (Q865650) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- The seven virtues of simple type theory (Q946569) (← links)
- Efficiently checking propositional refutations in HOL theorem provers (Q1006729) (← links)
- Data compression for proof replay (Q1040776) (← links)
- Performance analysis and functional verification of the stop-and-wait protocol in HOL (Q1040781) (← links)
- Graphical reasoning in compact closed categories for quantum computation (Q1044227) (← links)
- Higher-order rewrite systems and their confluence (Q1127334) (← links)
- Towards the Mathematics Software Bus (Q1389634) (← links)
- A first order logic of effects (Q1390955) (← links)
- Reuse of proofs in software verification (Q1419888) (← links)
- The calculus of constructions as a framework for proof search with set variable instantiation (Q1575927) (← links)
- Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
- Program development schemata as derived rules (Q1583853) (← links)
- Evaluating general purpose automated theorem proving systems (Q1606324) (← links)
- CASL: the Common Algebraic Specification Language. (Q1853453) (← links)
- Structuring metatheory on inductive definitions (Q1854368) (← links)
- Nominal logic, a first order theory of names and binding (Q1887151) (← 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)
- Translating a Dependently-Typed Logic to First-Order Logic (Q3184740) (← 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)
- 1998 European Summer Meeting of the Association for Symbolic Logic (Q4254644) (← links)
- Verified lightweight bytecode verification (Q4329632) (← links)
- Hoare logic for Java in Isabelle/HOL (Q4329634) (← links)
- Mechanizing Nonstandard Real Analysis (Q4504968) (← links)
- Ergo 6: A Generic Proof Engine that Uses Prolog Proof Technology (Q4827602) (← links)
- The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle⁄zf (Q4827615) (← links)
- High-Level Theories (Q5505502) (← links)
- Combining Isabelle and QEPCAD-B in the Prover’s Palette (Q5505513) (← links)
- A higher-order interpretation of deductive tableau (Q5938542) (← links)