ИКС | n/a |
Страниц в Google | 730 |
Страниц в Яндексе | 0 |
Dmoz | Да |
Яндекс Каталог | n/a |
Alexa Traffic Rank | 366 |
Alexa Country | 382 |
История изменения показателей | Авторизация |
Идет сбор информации... Обновить
Archive of Formal Proofs
n/a
n/a
UTF-8
148.86 КБ
2 500
39 063 симв.
33 989 симв.
Идет сбор информации... Обновить
Идет сбор информации... Обновить
Идет сбор информации... Обновить
Внешние ссылки главной страницы ( 116 ) | |
isabelle.in.tum.de/ | Isabelle |
dblp.uni-trier.de/db/journals/afp/ | dblp |
devel.isa-afp.org | development version |
cl-informatik.uibk.ac.at/users/bottesch/ | Ralph Bottesch |
cl-informatik.uibk.ac.at/users/mhaslbeck/ | Max W. Haslbeck |
cl-informatik.uibk.ac.at/~thiemann/ | René Thiemann |
www21.in.tum.de/~lammich | Peter Lammich |
in.tum.de/~wimmers | Simon Wimmer |
www21.in.tum.de/~hupel/ | Lars Hupel |
brucker.ch/ | Achim D. Brucker |
dcs.shef.ac.uk/cgi-bin/makeperson?M.Herzberg | Michael Herzberg |
lcs.ios.ac.cn/~bzhan/ | Bohua Zhan |
andreas-lochbihler.de | Andreas Lochbihler |
staffdcs.shef.ac.uk/people/G.Struth/ | Georg Struth |
christoph-benzmueller.de | Christoph Benzmüller |
student.dtu.dk/~s144442/ | Andreas Halkjær From |
home.in.tum.de/~immler/ | Fabian Immler |
www21.in.tum.de/~eberlm | Manuel Eberl |
home.in.tum.de/~mansour/ | Mohammad Abdulaziz |
risc.jku.at/m/alexander-maletzky/ | Alexander Maletzky |
cl.cam.ac.uk/~lp15/ | Lawrence C. Paulson |
cosc.canterbury.ac.nz/walter.guttmann/ | Walter Guttmann |
cl.cam.ac.uk/~ak2110/ | Angeliki Koutsoukou-Argyraki |
cl.cam.ac.uk/~wl302/ | Wenda Li |
lig-membres.imag.fr/mechenim/ | Mnacho Echenim |
cl-informatik.uibk.ac.at/users/cek/ | Cezary Kaliszyk |
sites.google.com/site/anthonybordg/ | Anthony Bordg |
www21.in.tum.de/~brunnerj/ | Julian Brunner |
in.tum.de/~nipkow | Tobias Nipkow |
in.tum.de/~hoelzl | Johannes Hölzl |
cs.cmu.edu/~scott/ | Dana Scott |
cl.cam.ac.uk/~caw77/ | Conrad Watt |
dss.in.tum.de/staff/brandt.html | Felix Brandt |
dss.in.tum.de/staff/christian-saile.html | Christian Saile |
dss.in.tum.de/staff/christian-stricker.html | Christian Stricker |
marmsoler.com | Diego Marmsoler |
in.tum.de/~haslbema | Maximilian P. L. Haslbeck |
home.in.tum.de/~haslbecm | Maximilian Haslbeck |
unirioja.es/cu/jodivaso/ | Jose Divasón |
sjcjoosten.nl/ | Sebastiaan Joosten |
peteg.org | Peter Gammie |
philpapers.org/profile/805 | Ben Blumson |
homes.soic.indiana.edu/jsiek/ | Jeremy Siek |
liftm.de | Julius Michaelis |
in.tum.de/~berghofe | Stefan Berghofer |
logic.las.tu-berlin.de/Members/Dittmann/ | Christoph Dittmann |
pp.ipd.kit.edu/person.php?id=88 | Denis Lohner |
people.compute.dtu.dk/aleje/ | Alexander Birch Jensen |
people.compute.dtu.dk/jovi/ | Jørgen Villadsen |
andrius.velykis.lt | Andrius Velykis |
net.in.tum.de/~diekmann | Cornelius Diekmann |
i-eos.org/fadoua | Fadoua Ghourabi |
membres-lig.imag.fr/peltier/ | Nicolas Peltier |
ualberta.ca/~jsylvest/ | Jeremy Sylvestre |
people.eng.unimelb.edu.au/tobym/ | Toby Murray |
cse.unsw.edu.au/~kleing/ | Gerwin Klein |
kcl.academia.edu/FahadAusaf | Fahad Ausaf |
inf.kcl.ac.uk/staff/urbanc/ | Christian Urban |
www21.in.tum.de/~kuncar/ | Ondřej Kunčar |
mtv.tu-berlin.de/nestmann/ | Uwe Nestmann |
renyi.hu/~nemeti/ | István Németi |
hoefner-online.de/ | Peter Höfner |
in.tum.de/~haslbema/ | Maximilian P.L. Haslbeck |
www21.in.tum.de/~noschinl/ | Lars Noschinski |
theory.stanford.edu/~rvg/ | Rob van Glabbeek |
unirioja.es/cu/jearansa | Jesús Aransay |
sci.kagoshima-u.ac.jp/~furusawa/ | Hitoshi Furusawa |
caminati.co.nr | Marco B. Caminati |
cs.bham.ac.uk/~mmk | Manfred Kerber |
cs.purdue.edu/homes/hosking/ | Tony Hosking |
cse.unsw.edu.au/~kaie/ | Kai Engelhardt |
tbrk.org | Timothy Bourke |
nm.wu.ac.at/nm/sadelsbe | Stephan Adelsberger |
logic.at/people/hetzl/ | Stefan Hetzl |
kestrel.edu/~coglio | Alessandro Coglio |
www7.in.tum.de/~esparza/ | Javier Esparza |
irit.fr/~Jan-Georg.Smaus | Jan-Georg Smaus |
lri.fr/~wenzel | Makarius Wenzel |
react.uni-saarland.de/people/rabe.html | Markus N. Rabe |
isabelle.in.tum.de/~haftmann | Florian Haftmann |
pes.tu-berlin.de/menue/ueber_uns/team/john_wickerson/ | John Wickerson |
matf.bg.ac.rs/~danijela | Danijela Petrovic |
staffdcs.shef.ac.uk/people/A.Armstrong/ | Alasdair Armstrong |
logic.at/staff/bruno/ | Bruno Woltzenlogel Paleo |
cl-informatik.uibk.ac.at/users/hzankl | Harald Zankl |
andrew.cmu.edu/user/avigad/ | Jeremy Avigad |
loria.fr/~merz | Stephan Merz |
itu.dk/people/jebe | Jesper Bengtson |
dmi.unict.it/~giamp/ | Giampaolo Bella |
lara.epfl.ch/~kuncak/ | Viktor Kuncak |
homepages.inf.ed.ac.uk/ggrov | Gudmund Grov |
www4.in.tum.de/~trachten | David Trachtenherz |
rok.strnisa.com/lj/ | Rok Strniša |
research.microsoft.com/people/mattpark/ | Matthew Parkinson |
users.abo.fi/Ralph-Johan.Back/ | Ralph-Johan Back |
in.tum.de/~krauss | Alexander Krauss |
pp.info.uni-karlsruhe.de/personhp/daniel_wasserrab.php | Daniel Wasserrab |
cs.st-andrews.ac.uk/~pc | Peter Chapman |
kasterma.net | Bart Kastermans |
tcs.informatik.uni-muenchen.de/~beringer | Lennart Beringer |
tcs.informatik.uni-muenchen.de/~mhofmann | Martin Hofmann |
pp.info.uni-karlsruhe.de/personhp/gregor_snelting.php | Gregor Snelting |
poincare.matf.bg.ac.rs/~filip/ | Filip Maric |
linta.de/~aehlig/ | Klaus Aehlig |
cs.uni-muenster.de/u/mmo/ | Markus Müller-Olm |
www4.in.tum.de/~boehmes/ | Sascha Böhme |
roelofoosterhuis.nl/ | Roelof Oosterhuis |
cs.cornell.edu/~jnfoster/ | J. Nathan Foster |
research.microsoft.com/en-us/people/dimitris/ | Dimitrios Vytiniotis |
cs.famaf.unc.edu.ar/~damian/ | Damián Barsotti |
www4.in.tum.de/~ballarin/ | Clemens Ballarin |
fceia.unr.edu.ar/~mauro/ | Mauro Jaskelioff |
users.rsise.anu.edu.au/~okeefe/ | Greg O'Keefe |
mit.edu/~kkz/ | Karen Zee |
www-lti.informatik.rwth-aachen.de/~richter/ | Stefan Richter |
score.is.tsukuba.ac.jp/~minamide/ | Yasuhiko Minamide |
Внутренние ссылки главной страницы ( 469 ) | |
index.html | Home |
about.html | About |
submitting.html | Submission |
updating.html | Updating Entries |
using.html | Using Entries |
search.html | Search |
statistics.html | Statistics |
topics.html | Index |
download.html | Download |
citing.html | [here] |
entries/Farkas.html | Farkas' Lemma and Motzkin's Transposition Theorem |
entries/IMP2.html | IMP2 – Simple Program Verification in Isabelle/HOL |
entries/Higher_Order_Terms.html | An Algebra for Higher-Order Terms |
entries/Store_Buffer_Reduction.html | A Reduction Theorem for Store Buffers |
entries/Core_DOM.html | A Formal Model of the Document Object Model |
entries/Concurrent_Revisions.html | Formalization of Concurrent Revisions |
entries/Auto2_Imperative_HOL.html | Verifying Imperative Programs using Auto2 |
entries/Constructive_Cryptography.html | Constructive Cryptography in HOL |
entries/Transformer_Semantics.html | Transformer Semantics |
entries/Quantales.html | Quantales |
entries/Order_Lattice_Props.html | Properties of Orderings and Lattices |
entries/Graph_Saturation.html | Graph Saturation |
entries/Functional_Ordered_Resolution_Prover.html | A Verified Functional Implementation of Bachmair and Ganzinger's Ordered Resolution Prover |
entries/Auto2_HOL.html | Auto2 Prover |
entries/Matroids.html | Matroids |
entries/Generic_Deriving.html | Deriving generic class instances for datatypes |
entries/GewirthPGCProof.html | Formalisation and Evaluation of Alan Gewirth's Proof for the Principle of Generic Consistency in Isabelle/HOL |
entries/Epistemic_Logic.html | Epistemic Logic |
entries/Smooth_Manifolds.html | Smooth Manifolds |
entries/Randomised_BSTs.html | Randomised Binary Search Trees |
entries/Lambda_Free_EPO.html | Formalization of the Embedding Path Order for Lambda-Free Higher-Order Terms |
entries/Factored_Transition_System_Bounding.html | Upper Bounding Diameters of State Spaces of Factored Transition Systems |
entries/Pi_Transcendental.html | The Transcendence of π |
entries/Symmetric_Polynomials.html | Symmetric Polynomials |
entries/Signature_Groebner.html | Signature-Based Gröbner Basis Algorithms |
entries/Prime_Number_Theorem.html | The Prime Number Theorem |
entries/Aggregation_Algebras.html | Aggregation Algebras |
entries/Octonions.html | Octonions |
entries/Quaternions.html | Quaternions |
entries/Budan_Fourier.html | The Budan-Fourier Theorem and Counting Real Roots with Multiplicity |
entries/Simplex.html | An Incremental Simplex Algorithm with Unsatisfiable Core Generation |
entries/Minsky_Machines.html | Minsky Machines |
entries/DiscretePricing.html | Pricing in discrete financial models |
entries/Neumann_Morgenstern_Utility.html | Von-Neumann-Morgenstern Utility Theorem |
entries/Pell.html | Pell's Equation |
entries/Projective_Geometry.html | Projective Geometry |
entries/Localization_Ring.html | The Localization of a Commutative Ring |
entries/Partial_Order_Reduction.html | Partial Order Reduction |
entries/Optimal_BST.html | Optimal Binary Search Trees |
entries/Hidden_Markov_Models.html | Hidden Markov Models |
entries/Probabilistic_Timed_Automata.html | Probabilistic Timed Automata |
entries/Irrationality_J_Hancl.html | Irrational Rapidly Convergent Series |
entries/AxiomaticCategoryTheory.html | Axiom Systems for Category Theory in Free Logic |
entries/Monad_Memo_DP.html | Monadification, Memoization and Dynamic Programming |
entries/OpSets.html | OpSets: Sequential Specifications for Replicated Datatypes |
entries/Modular_Assembly_Kit_Security.html | An Isabelle/HOL Formalization of the Modular Assembly Kit for Security Properties |
entries/WebAssembly.html | WebAssembly |
entries/VerifyThis2018.html | VerifyThis 2018 - Polished Isabelle Solutions |
entries/BNF_CC.html | Bounded Natural Functors with Covariance and Contravariance |
entries/Fishburn_Impossibility.html | The Incompatibility of Fishburn-Strategyproofness and Pareto-Efficiency |
entries/Weight_Balanced_Trees.html | Weight-Balanced Trees |
entries/CakeML.html | CakeML |
entries/Architectural_Design_Patterns.html | A Theory of Architectural Design Patterns |
entries/Hoare_Time.html | Hoare Logics for Time Bounds |
entries/Treaps.html | Treaps |
entries/LLL_Factorization.html | A verified factorization algorithm for integer polynomials with polynomial complexity |
entries/First_Order_Terms.html | First-Order Terms |
entries/Error_Function.html | The Error Function |
entries/LLL_Basis_Reduction.html | A verified LLL algorithm |
entries/Ordered_Resolution_Prover.html | Formalization of Bachmair and Ganzinger's Ordered Resolution Prover |
entries/Gromov_Hyperbolicity.html | Gromov Hyperbolicity |
entries/Green.html | An Isabelle/HOL formalisation of Green's Theorem |
entries/Taylor_Models.html | Taylor Models |
entries/Falling_Factorial_Sum.html | The Falling Factorial of a Sum |
entries/Median_Of_Medians_Selection.html | The Median-of-Medians Selection Algorithm |
entries/Mason_Stothers.html | The Mason–Stothers Theorem |
entries/Dirichlet_L.html | Dirichlet L-Functions and Dirichlet's Theorem |
entries/BNF_Operations.html | Operations on Bounded Natural Functors |
entries/Knuth_Morris_Pratt.html | The string search algorithm by Knuth, Morris and Pratt |
entries/Stochastic_Matrices.html | Stochastic Matrices and the Perron-Frobenius Theorem |
entries/IMAP-CRDT.html | The IMAP CmRDT |
entries/Hybrid_Multi_Lane_Spatial_Logic.html | Hybrid Multi-Lane Spatial Logic |
entries/Kuratowski_Closure_Complement.html | The Kuratowski Closure-Complement Theorem |
entries/Transition_Systems_and_Automata.html | Transition Systems and Automata |
entries/Buchi_Complementation.html | Büchi Complementation |
entries/Winding_Number_Eval.html | Evaluate Winding Numbers through Cauchy Indices |
entries/Count_Complex_Roots.html | Count the Number of Complex Roots |
entries/Diophantine_Eqns_Lin_Hom.html | Homogeneous Linear Diophantine Equations |
entries/Zeta_Function.html | The Hurwitz and Riemann ζ Functions |
entries/Linear_Recurrences.html | Linear Recurrences |
entries/Dirichlet_Series.html | Dirichlet Series |
entries/Lowe_Ontological_Argument.html | Computer-assisted Reconstruction and Assessment of E. J. Lowe's Modal Ontological Argument |
entries/PLM.html | Representation and Partial Automation of the Principia Logico-Metaphysica in Isabelle/HOL |
entries/AnselmGod.html | Anselm's God in Isabelle/HOL |
entries/First_Welfare_Theorem.html | Microeconomics and the First Welfare Theorem |
entries/Root_Balanced_Tree.html | Root-Balanced Tree |
entries/Orbit_Stabiliser.html | Orbit-Stabiliser Theorem with Application to Rotational Symmetries |
entries/LambdaMu.html | The LambdaMu-calculus |
entries/Stewart_Apollonius.html | Stewart's Theorem and Apollonius' Theorem |
entries/DynamicArchitectures.html | Dynamic Architectures |
entries/Decl_Sem_Fun_PL.html | Declarative Semantics for Functional Languages |
entries/HOLCF-Prelude.html | HOLCF-Prelude |
entries/Minkowskis_Theorem.html | Minkowski's Theorem |
entries/Name_Carrying_Type_Inference.html | Verified Metatheory and Type Inference for a Name-Carrying Simply-Typed Lambda Calculus |
entries/CRDT.html | A framework for establishing Strong Eventual Consistency for Conflict-free Replicated Datatypes |
entries/Stone_Kleene_Relation_Algebras.html | Stone-Kleene Relation Algebras |
entries/Propositional_Proof_Systems.html | Propositional Proof Systems |
entries/PSemigroupsConvolution.html | Partial Semigroups and Convolution Algebras |
entries/Buffons_Needle.html | Buffon's Needle Problem |
entries/Prpu_Maxflow.html | Formalizing Push-Relabel Algorithms |
entries/Flow_Networks.html | Flow Networks and the Min-Cut-Max-Flow Theorem |
entries/Optics.html | Optics |
entries/Security_Protocol_Refinement.html | Developing Security Protocols by Refinement |
entries/Dict_Construction.html | Dictionary Construction |
entries/Floyd_Warshall.html | The Floyd-Warshall Algorithm for Shortest Paths |
entries/Probabilistic_While.html | Probabilistic while loop |
entries/Monomorphic_Monad.html | Effect polymorphism in higher-order logic |
entries/Monad_Normalisation.html | Monad normalisation |
entries/Game_Based_Crypto.html | Game-based cryptography in HOL |
entries/CryptHOL.html | CryptHOL |
entries/MonoidalCategory.html | Monoidal Categories |
entries/Types_Tableaus_and_Goedels_God.html | Types, Tableaus and Gödel’s God in Isabelle/HOL |
entries/LocalLexing.html | Local Lexing |
entries/Constructor_Funs.html | Constructor Functions |
entries/Lazy_Case.html | Lazifying case constants |
entries/Subresultants.html | Subresultants |
entries/Random_BSTs.html | Expected Shape of Random Binary Search Trees |
entries/Quick_Sort_Cost.html | The number of comparisons in QuickSort |
entries/Comparison_Sort_Lower_Bound.html | Lower bound on comparison-based sorting algorithms |
entries/Euler_MacLaurin.html | The Euler–MacLaurin Formula |
entries/Elliptic_Curves_Group_Law.html | The Group Law for Elliptic Curves |
entries/Menger.html | Menger's Theorem |
entries/Differential_Dynamic_Logic.html | Differential Dynamic Logic |
entries/Abstract_Soundness.html | Abstract Soundness |
entries/Stone_Relation_Algebras.html | Stone Relation Algebras |
entries/Key_Agreement_Strong_Adversaries.html | Refining Authenticated Key Agreement with Strong Adversaries |
entries/Bernoulli.html | Bernoulli Numbers |
entries/Minimal_SSA.html | Minimal Static Single Assignment Form |
entries/Bertrands_Postulate.html | Bertrand's postulate |
entries/E_Transcendental.html | The Transcendence of e |
entries/UPF_Firewall.html | Formal Network Models and Their Application to Firewall Policies |
entries/Password_Authentication_Protocol.html | Verification of a Diffie-Hellman Password-based Authentication Protocol by Extending the Inductive Method |
entries/FOL_Harrison.html | First-Order Logic According to Harrison |
entries/Concurrent_Ref_Alg.html | Concurrent Refinement Algebra and Rely Quotients |
entries/Twelvefold_Way.html | The Twelvefold Way |
entries/Proof_Strategy_Language.html | Proof Strategy Language |
entries/Paraconsistency.html | Paraconsistency |
entries/Complx.html | COMPLX: A Verification Framework for Concurrent Imperative Programs |
entries/Abs_Int_ITP2012.html | Abstract Interpretation of Annotated Commands |
entries/Separata.html | Separata: Isabelle tactics for Separation Algebra |
entries/Nested_Multisets_Ordinals.html | Formalization of Nested Multisets, Hereditary Multisets, and Syntactic Ordinals |
entries/Lambda_Free_KBOs.html | Formalization of Knuth–Bendix Orders for Lambda-Free Higher-Order Terms |
entries/Deep_Learning.html | Expressiveness of Deep Learning |
entries/Modal_Logics_for_NTS.html | Modal Logics for Nominal Transition Systems |
entries/Stable_Matching.html | Stable Matching |
entries/LOFT.html | LOFT — Verified Migration of Linux Firewalls to SDN |
entries/Source_Coding_Theorem.html | Source Coding Theorem |
entries/SPARCv8.html | A formal model for the SPARCv8 ISA and a proof of non-interference for the LEON3 processor |
entries/Berlekamp_Zassenhaus.html | The Factorization Algorithm of Berlekamp and Zassenhaus |
entries/Chord_Segments.html | Intersecting Chords Theorem |
entries/Lp.html | Lp spaces |
entries/Fisher_Yates.html | Fisher–Yates shuffle |
entries/Allen_Calculus.html | Allen's Interval Calculus |
entries/Lambda_Free_RPOs.html | Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms |
entries/Iptables_Semantics.html | Iptables Semantics |
entries/SuperCalc.html | A Variant of the Superposition Calculus |
entries/Stone_Algebras.html | Stone Algebras |
entries/Stirling_Formula.html | Stirling's formula |
entries/Routing.html | Routing |
entries/Simple_Firewall.html | Simple Firewall |
entries/InfPathElimination.html | Infeasible Paths Elimination by Symbolic Execution Techniques: Proof of Correctness and Preservation of Paths |
entries/EdmondsKarp_Maxflow.html | Formalizing the Edmonds-Karp Algorithm |
entries/Refine_Imperative_HOL.html | The Imperative Refinement Framework |
entries/Ptolemys_Theorem.html | Ptolemy's Theorem |
entries/Surprise_Paradox.html | Surprise Paradox |
entries/Pairing_Heap.html | Pairing Heap |
entries/DFS_Framework.html | A Framework for Verifying Depth-First Search Algorithms |
entries/Buildings.html | Chamber Complexes, Coxeter Systems, and Buildings |
entries/Rewriting_Z.html | The Z Property |
entries/Resolution_FOL.html | The Resolution Calculus for First-Order Logic |
entries/IP_Addresses.html | IP Addresses |
entries/Dependent_SIFUM_Refinement.html | Compositional Security-Preserving Refinement for Concurrent Imperative Programs |
entries/Category3.html | Category Theory with Adjunctions and Limits |
entries/Card_Multisets.html | Cardinality of Multisets |
entries/Dependent_SIFUM_Type_Systems.html | A Dependent Security Type System for Concurrent Imperative Programs |
entries/Catalan_Numbers.html | Catalan Numbers |
entries/Algebraic_VCs.html | Program Construction and Verification Components Based on Kleene Algebra |
entries/Noninterference_Concurrent_Composition.html | Conservation of CSP Noninterference Security under Concurrent Composition |
entries/Word_Lib.html | Finite Machine Word Library |
entries/Tree_Decomposition.html | Tree Decomposition |
entries/Posix-Lexing.html | POSIX Lexing with Derivatives of Regular Expressions |
entries/Card_Equiv_Relations.html | Cardinality of Equivalence Relations |
entries/Perron_Frobenius.html | Perron-Frobenius Theorem for Spectral Radius Analysis |
entries/Incredible_Proof_Machine.html | The meta theory of the Incredible Proof Machine |
entries/FLP.html | A Constructive Proof for FLP |
entries/MFMC_Countable.html | A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks |
entries/Randomised_Social_Choice.html | Randomised Social Choice Theory |
entries/SDS_Impossibility.html | The Incompatibility of SD-Efficiency and SD-Strategy-Proofness |
entries/Bell_Numbers_Spivey.html | Spivey's Generalized Recurrence for Bell Numbers |
entries/Groebner_Bases.html | Gröbner Bases Theory |
entries/No_FTL_observers.html | No Faster-Than-Light Observers |
entries/ROBDD.html | Algorithms for Reduced Ordered Binary Decision Diagrams |
entries/CYK.html | A formalisation of the Cocke-Younger-Kasami algorithm |
entries/Noninterference_Sequential_Composition.html | Conservation of CSP Noninterference Security under Sequential Composition |
entries/KAD.html | Kleene Algebras with Domain |
entries/PropResPI.html | Propositional Resolution and Prime Implicates Generation |
entries/Timed_Automata.html | Timed Automata |
entries/Cartan_FP.html | The Cartan Fixed Point Theorems |
entries/LTL.html | Linear Temporal Logic |
entries/List_Update.html | Analysis of List Update Algorithms |
entries/Formal_SSA.html | Verified Construction of Static Single Assignment Form |
entries/Polynomial_Interpolation.html | Polynomial Interpolation |
entries/Polynomial_Factorization.html | Polynomial Factorization |
entries/Knot_Theory.html | Knot Theory |
entries/Matrix_Tensor.html | Tensor Product of Matrices |
entries/Card_Number_Partitions.html | Cardinality of Number Partitions |
entries/Triangle.html | Basic Geometric Properties of Triangles |
entries/Prime_Harmonic_Series.html | The Divergence of the Prime Harmonic Series |
entries/Liouville_Numbers.html | Liouville numbers |
entries/Descartes_Sign_Rule.html | Descartes' Rule of Signs |
entries/Stern_Brocot.html | The Stern-Brocot Tree |
entries/Applicative_Lifting.html | Applicative Lifting |
entries/Algebraic_Numbers.html | Algebraic Numbers in Isabelle/HOL |
entries/Card_Partitions.html | Cardinality of Set Partitions |
entries/Latin_Square.html | Latin Square |
entries/Ergodic_Theory.html | Ergodic Theory |
entries/Euler_Partition.html | Euler's Partition Theorem |
entries/TortoiseHare.html | The Tortoise and Hare Algorithm |
entries/Planarity_Certificates.html | Planarity Certificates |
entries/Parity_Game.html | Positional Determinacy of Parity Games |
entries/Isabelle_Meta_Model.html | A Meta-Model for the Isabelle API |
entries/LTL_to_DRA.html | Converting Linear Temporal Logic to Deterministic (Generalized) Rabin Automata |
entries/Jordan_Normal_Form.html | Matrices, Jordan Normal Forms, and Spectral Radius Theory |
entries/Decreasing-Diagrams-II.html | Decreasing Diagrams II |
entries/Noninterference_Inductive_Unwinding.html | The Inductive Unwinding Theorem for CSP Noninterference Security |
entries/Rep_Fin_Groups.html | Representations of Finite Groups |
entries/Encodability_Process_Calculi.html | Analysing and Comparing Encodability Criteria for Process Calculi |
entries/Case_Labeling.html | Generating Cases from Labeled Subgoals |
entries/Landau_Symbols.html | Landau Symbols |
entries/Akra_Bazzi.html | The Akra-Bazzi theorem and the Master theorem |
entries/Hermite.html | Hermite Normal Form |
entries/Derangements.html | Derangements Formula |
entries/Noninterference_Ipurge_Unwinding.html | The Ipurge Unwinding Theorem for CSP Noninterference Security |
entries/Noninterference_Generic_Unwinding.html | The Generic Unwinding Theorem for CSP Noninterference Security |
entries/Multirelations.html | Binary Multirelations |
entries/List_Interleaving.html | Reasoning about Lists via List Interleaving |
entries/Dynamic_Tables.html | Parameterized Dynamic Tables |
entries/Formula_Derivatives.html | Derivatives of Logical Formulas |
entries/Probabilistic_System_Zoo.html | A Zoo of Probabilistic Systems |
entries/Vickrey_Clarke_Groves.html | VCG - Combinatorial Vickrey-Clarke-Groves Auctions |
entries/Residuated_Lattices.html | Residuated Lattices |
entries/ConcurrentIMP.html | Concurrent IMP |
entries/ConcurrentGC.html | Relaxing Safely: Verified On-the-Fly Garbage Collection for x86-TSO |
entries/Trie.html | Trie |
entries/Consensus_Refined.html | Consensus Refined |
entries/Deriving.html | Deriving class instances for datatypes |
entries/Call_Arity.html | The Safety of Call Arity |
entries/QR_Decomposition.html | QR Decomposition |
entries/Echelon_Form.html | Echelon Form |
entries/Finite_Automata_HF.html | Finite Automata in Hereditarily Finite Set Theory |
entries/UpDown_Scheme.html | Verification of the UpDown Scheme |
entries/UPF.html | The Unified Policy Framework (UPF) |
entries/AODV.html | Loop freedom of the (untimed) AODV routing protocol |
entries/Lifting_Definition_Option.html | Lifting Definition Option |
entries/Stream_Fusion_Code.html | Stream Fusion in HOL with Code Generation |
entries/Density_Compiler.html | A Verified Compiler for Probability Density Functions |
entries/RefinementReactive.html | Formalization of Refinement Calculus for Reactive Systems |
entries/XML.html | XML |
entries/Certification_Monads.html | Certification Monads |
entries/Imperative_Insertion_Sort.html | Imperative Insertion Sort |
entries/Sturm_Tarski.html | The Sturm-Tarski Theorem |
entries/Cayley_Hamilton.html | The Cayley-Hamilton Theorem |
entries/Jordan_Hoelder.html | The Jordan-Hölder Theorem |
entries/Priority_Queue_Braun.html | Priority Queues Based on Braun Trees |
entries/Gauss_Jordan.html | Gauss-Jordan Algorithm and Its Applications |
entries/VectorSpace.html | Vector Spaces |
entries/Special_Function_Bounds.html | Real-Valued Special Functions: Upper and Lower Bounds |
entries/Skew_Heap.html | Skew Heap |
entries/Splay_Tree.html | Splay Tree |
entries/Show.html | Haskell's Show Class in Isabelle/HOL |
entries/CISC-Kernel.html | Formal Specification of a Generic Separation Kernel |
entries/pGCL.html | pGCL for Isabelle |
entries/Amortized_Complexity.html | Amortized Complexity Verified |
entries/Network_Security_Policy_Verification.html | Network Security Policy Verification |
entries/Pop_Refinement.html | Pop-Refinement |
entries/MSO_Regex_Equivalence.html | Decision Procedures for MSO on Words Based on Derivatives of Regular Expressions |
entries/Boolean_Expression_Checkers.html | Boolean Expression Checkers |
entries/Promela.html | Promela Formalization |
entries/LTL_to_GBA.html | Converting Linear-Time Temporal Logic to Generalized Büchi Automata |
entries/Gabow_SCC.html | Verified Efficient Implementation of Gabow's Strongly Connected Components Algorithm |
entries/CAVA_LTL_Modelchecker.html | A Fully Verified Executable LTL Model Checker |
entries/CAVA_Automata.html | The CAVA Automata Library |
entries/Roy_Floyd_Warshall.html | Transitive closure according to Roy-Floyd-Warshall |
entries/Noninterference_CSP.html | Noninterference Security in Communicating Sequential Processes |
entries/Regular_Algebras.html | Regular Algebras |
entries/ComponentDependencies.html | Formalisation and Analysis of Component Dependencies |
entries/WHATandWHERE_Security.html | A Formalization of Declassification with WHAT-and-WHERE-Security |
entries/Strong_Security.html | A Formalization of Strong Security |
entries/SIFUM_Type_Systems.html | A Formalization of Assumptions and Guarantees for Compositional Noninterference |
entries/Bounded_Deducibility_Security.html | Bounded-Deducibility Security |
entries/HyperCTL.html | A shallow embedding of HyperCTL* |
entries/Abstract_Completeness.html | Abstract Completeness |
entries/Discrete_Summation.html | Discrete Summation |
entries/GPU_Kernel_PL.html | Syntax and semantics of a GPU kernel programming language |
entries/Probabilistic_Noninterference.html | Probabilistic Noninterference |
entries/AWN.html | Mechanization of the Algebra for Wireless Networks (AWN) |
entries/Partial_Function_MR.html | Mutually Recursive Partial Functions |
entries/Random_Graph_Subgraph_Threshold.html | Properties of Random Graphs -- Subgraph Containment |
entries/Selection_Heap_Sort.html | Verification of Selection and Heap Sort Using Locales |
entries/Affine_Arithmetic.html | Affine Arithmetic |
entries/Real_Impl.html | Implementing field extensions of the form Q[sqrt(b)] |
entries/Regex_Equivalence.html | Unified Decision Procedures for Regular Expression Equivalence |
entries/Secondary_Sylow.html | Secondary Sylow Theorems |
entries/Relation_Algebra.html | Relation Algebra |
entries/KAT_and_DRA.html | Kleene Algebra with Tests and Demonic Refinement Algebras |
entries/Featherweight_OCL.html | Featherweight OCL: A Proposal for a Machine-Checked Formal Semantics for OCL 2.5 |
entries/Sturm_Sequences.html | Sturm's Theorem |
entries/CryptoBasedCompositionalProperties.html | Compositional Properties of Crypto-Based Components |
entries/Tail_Recursive_Functions.html | A General Method for the Proof of Theorems on Tail-recursive Functions |
entries/Incompleteness.html | Gödel's Incompleteness Theorems |
entries/HereditarilyFinite.html | The Hereditarily Finite Sets |
entries/Coinductive_Languages.html | A Codatatype of Formal Languages |
entries/FocusStreamsCaseStudies.html | Stream Processing Components: Isabelle/HOL Formalisation and Case Studies |
entries/GoedelGod.html | Gödel's God in Isabelle/HOL |
entries/Decreasing-Diagrams.html | Decreasing Diagrams |
entries/Automatic_Refinement.html | Automatic Data Refinement |
entries/Native_Word.html | Native Word |
entries/IEEE_Floating_Point.html | A Formal Model of IEEE Floating Point Arithmetic |
entries/Pratt_Certificate.html | Pratt's Primality Certificates |
entries/Lehmer.html | Lehmer's Theorem |
entries/Koenigsberg_Friendship.html | The Königsberg Bridge Problem and the Friendship Theorem |
entries/Sort_Encodings.html | Sound and Complete Sort Encodings for First-Order Logic |
entries/ShortestPath.html | An Axiomatic Characterization of the Single-Source Shortest Path Problem |
entries/Graph_Theory.html | Graph Theory |
entries/Containers.html | Light-weight Containers |
entries/Nominal2.html | Nominal 2 |
entries/Launchbury.html | The Correctness of Launchbury's Natural Semantics for Lazy Evaluation |
entries/Ribbon_Proofs.html | Ribbon Proofs |
entries/Rank_Nullity_Theorem.html | Rank-Nullity Theorem in Linear Algebra |
entries/Kleene_Algebra.html | Kleene Algebra |
entries/Sqrt_Babylonian.html | Computing N-th Roots using the Babylonian Method |
entries/Separation_Logic_Imperative_HOL.html | A Separation Logic Framework for Imperative HOL |
entries/Open_Induction.html | Open Induction |
entries/Tarskis_Geometry.html | The independence of Tarski's Euclidean axiom |
entries/Bondy.html | Bondy's Theorem |
entries/Possibilistic_Noninterference.html | Possibilistic Noninterference |
entries/Datatype_Order_Generator.html | Generating linear orders for datatypes |
entries/Impossible_Geometry.html | Proving the Impossibility of Trisecting an Angle and Doubling the Cube |
entries/Heard_Of.html | Verifying Fault-Tolerant Distributed Algorithms in the Heard-Of Model |
entries/PCF.html | Logical Relations for PCF |
entries/Tycon.html | Type Constructor Classes and Monad Transformers |
entries/Psi_Calculi.html | Psi-calculi in Isabelle |
entries/Pi_Calculus.html | The pi-calculus in nominal logic |
entries/CCS.html | CCS in nominal logic |
entries/Circus.html | Isabelle/Circus |
entries/Separation_Algebra.html | Separation Algebra |
entries/Stuttering_Equivalence.html | Stuttering Equivalence |
entries/Inductive_Confidentiality.html | Inductive Study of Confidentiality |
entries/Ordinary_Differential_Equations.html | Ordinary Differential Equations |
entries/Well_Quasi_Orders.html | Well-Quasi-Orders |
entries/Abortable_Linearizable_Modules.html | Abortable Linearizable Modules |
entries/Transitive-Closure-II.html | Executable Transitive Closures |
entries/Girth_Chromatic.html | A Probabilistic Proof of the Girth-Chromatic Number Theorem |
entries/Refine_Monadic.html | Refinement for Monadic Programs |
entries/Dijkstra_Shortest_Path.html | Dijkstra's Shortest Path Algorithm |
entries/Markov_Models.html | Markov Models |
entries/TLA.html | A Definitional Encoding of TLA* in Isabelle/HOL |
entries/Efficient-Mergesort.html | Efficient Mergesort |
entries/PseudoHoops.html | Pseudo Hoops |
entries/MonoBoolTranAlgebra.html | Algebra of Monotonic Boolean Transformers |
entries/LatticeProperties.html | Lattice Properties |
entries/Myhill-Nerode.html | The Myhill-Nerode Theorem Based on Regular Expressions |
entries/Gauss-Jordan-Elim-Fun.html | Gauss-Jordan Elimination for Matrices Represented as Functions |
entries/Max-Card-Matching.html | Maximum Cardinality Matching |
entries/KBPs.html | Knowledge-based programs |
entries/General-Triangle.html | The General Triangle Is Unique |
entries/Transitive-Closure.html | Executable Transitive Closures of Finite Relations |
entries/Nat-Interval-Logic.html | Interval Temporal Logic on Natural Numbers |
entries/List-Infinite.html | Infinite Lists |
entries/AutoFocus-Stream.html | AutoFocus Stream Processing for Single-Clocking and Multi-Clocking Semantics |
entries/LightweightJava.html | Lightweight Java |
entries/RIPEMD-160-SPARK.html | RIPEMD-160 |
entries/Lower_Semicontinuous.html | Lower Semicontinuous Functions |
entries/Marriage.html | Hall's Marriage Theorem |
entries/Shivers-CFA.html | Shivers' Control Flow Analysis |
entries/Finger-Trees.html | Finger Trees |
entries/Binomial-Queues.html | Functional Binomial Queues |
entries/Binomial-Heaps.html | Binomial Heaps and Skew Binomial Heaps |
entries/Lam-ml-Normalization.html | Strong Normalization of Moggis's Computational Metalanguage |
entries/Polynomials.html | Executable Multivariate Polynomials |
entries/Statecharts.html | Formalizing Statecharts using Hierarchical Automata |
entries/Free-Groups.html | Free Groups |
entries/Category2.html | Category Theory |
entries/Matrix.html | Executable Matrix Operations on Matrices of Arbitrary Dimensions |
entries/Abstract-Rewriting.html | Abstract Rewriting |
entries/GraphMarkingIBP.html | Verification of the Deutsch-Schorr-Waite Graph Marking Algorithm using Data Refinement |
entries/DataRefinementIBP.html | Semantics and Data Refinement of Invariant Based Programs |
entries/Robbins-Conjecture.html | A Complete Proof of the Robbins Conjecture |
entries/Regular-Sets.html | Regular Sets and Expressions |
entries/Locally-Nameless-Sigma.html | Locally Nameless Sigma Calculus |
entries/Free-Boolean-Algebra.html | Free Boolean Algebra |
entries/InformationFlowSlicing_Inter.html | Inter-Procedural Information Flow Noninterference via Slicing |
entries/InformationFlowSlicing.html | Information Flow Noninterference via Slicing |
entries/List-Index.html | List Index |
entries/Coinductive.html | Coinductive |
entries/DPT-SAT-Solver.html | A Fast SAT Solver for Isabelle in Standard ML |
entries/Presburger-Automata.html | Formalizing the Logic-Automaton Connection |
entries/Tree-Automata.html | Tree Automata |
entries/Collections.html | Collections Framework |
entries/Perfect-Number-Thm.html | Perfect Number Theorem |
entries/HRB-Slicing.html | Backing up Slicing: Verifying the Interprocedural Two-Phase Horwitz-Reps-Binkley Slicer |
entries/WorkerWrapper.html | The Worker/Wrapper Transformation |
entries/Ordinals_and_Cardinals.html | Ordinals and Cardinals |
entries/SequentInvertibility.html | Invertibility in Sequent Calculi |
entries/CofGroups.html | An Example of a Cofinitary Group in Isabelle/HOL |
entries/FinFun.html | Code Generation for Functions as Data |
entries/Stream-Fusion.html | Stream Fusion |
entries/BytecodeLogicJmlTypes.html | A Bytecode Logic for JML and Types |
entries/SIFPL.html | Secure information flow and program logics |
entries/SenSocialChoice.html | Some classical results in Social Choice Theory |
entries/FunWithTilings.html | Fun With Tilings |
entries/Huffman.html | The Textbook Proof of Huffman's Algorithm |
entries/Slicing.html | Towards Certified Slicing |
entries/VolpanoSmith.html | A Correctness Proof for the Volpano/Smith Security Typing System |
entries/ArrowImpossibilityGS.html | Arrow and Gibbard-Satterthwaite |
entries/FunWithFunctions.html | Fun With Functions |
entries/SATSolverVerification.html | Formal Verification of Modern SAT Solvers |
entries/Recursion-Theory-I.html | Recursion Theory I |
entries/Simpl.html | A Sequential Imperative Programming Language Syntax, Semantics, Hoare Logics and Verification Environment |
entries/BDD.html | BDD Normalisation |
entries/NormByEval.html | Normalization by Evaluation |
entries/LinearQuantifierElim.html | Quantifier Elimination for Linear Arithmetic |
entries/Program-Conflict-Analysis.html | Formalization of Conflict Analysis of Programs with Procedures, Thread Creation, and Monitors |
entries/JinjaThreads.html | Jinja with Threads |
entries/MuchAdoAboutTwo.html | Much Ado About Two |
entries/SumSquares.html | Sums of Two and Four Squares |
entries/Fermat3_4.html | Fermat's Last Theorem for Exponents 3 and 4 and the Parametrisation of Pythagorean Triples |
entries/Valuation.html | Fundamental Properties of Valuation Theory and Hensel's Lemma |
entries/POPLmark-deBruijn.html | POPLmark Challenge Via de Bruijn Indices |
entries/FOL-Fitting.html | First-Order Logic According to Fitting |
entries/HotelKeyCards.html | Hotel Key Card System |
entries/Abstract-Hoare-Logics.html | Abstract Hoare Logics |
entries/Flyspeck-Tame.html | Flyspeck I: Tame Graphs |
entries/CoreC++.html | CoreC++ |
entries/FeatherweightJava.html | A Theory of Featherweight Java in Isabelle/HOL |
entries/ClockSynchInst.html | Instances of Schneider's generalized protocol of clock synchronization |
entries/Cauchy.html | Cauchy's Mean Theorem and the Cauchy-Schwarz Inequality |
entries/Ordinal.html | Countable Ordinals |
entries/FFT.html | Fast Fourier Transform |
entries/GenClock.html | Formalization of a Generalized Protocol for Clock Synchronization |
entries/DiskPaxos.html | Proving the Correctness of Disk Paxos |
entries/JiveDataStoreModel.html | Jive Data and Store Model |
entries/Jinja.html | Jinja is not Java |
entries/RSAPSS.html | SHA1, RSA, PSS and more |
entries/Category.html | Category Theory to Yoneda's Lemma |
entries/FileRefinement.html | File Refinement |
entries/Integration.html | Integration theory and random variables |
entries/Verified-Prover.html | A Mechanically Verified, Efficient, Sound and Complete Theorem Prover For First Order Logic |
entries/Ramsey-Infinite.html | Ramsey's theorem, infinitary version |
entries/Completeness.html | Completeness theorem |
entries/Compiling-Exceptions-Correctly.html | Compiling Exceptions Correctly |
entries/Depth-First-Search.html | Depth First Search |
entries/Group-Ring-Module.html | Groups, Rings and Modules |
entries/Topology.html | Topology |
entries/Lazy-Lists-II.html | Lazy Lists II |
entries/BinarySearchTree.html | Binary Search Trees |
entries/Functional-Automata.html | Functional Automata |
entries/MiniML.html | Mini ML |
entries/AVL-Trees.html | AVL Trees |
США - Чула-Виста - 216.105.38.10
American Internet Services, LLC.
Internet Express
HTTP/1.1 200 OK
Date: Tue, 05 Feb 2019 18:27:28 GMT
Server: Apache/2.4.29 (Ubuntu)
Last-Modified: Tue, 22 Jan 2019 16:55:38 GMT
ETag: "25373-5800ed8cccc79"
Accept-Ranges: bytes
Content-Length: 152435
Vary: Accept-Encoding
Content-Security-Policy: default-src 'self'; script-src 'self' 'unsafe-inline'; style-src 'self' 'unsafe-inline'; img-src *
Strict-Transport-Security: max-age=31536000; includeSubdomains
X-Xss-Protection: 1; mode=block
Content-Type: text/html
Кнопка для анализа сайта в один клик, для установки перетащите ссылку на "Панель закладок"