Hauptnavigation
- Navigation
-
- Aktuelles
-
Mitarbeiter
-
Martin Hofmann
- Lehre
- Veranstaltungen
- CV english
- Publications 2014 - 2000
- Passbild-MH
-
Publikationen-pdfs
- j35-VerifyingPointer.pdf
- j33-multivariateAmortizedResources.pdf
- j34-EditLanguagesInformationTrees.pdf
- j32-RealizabilityModelsImplicitComplexity.pdf
- j31-BoundedLinearLogic.pdf
- j30-SemanticProofPolytimeSoundness.pdf
- j29-PurePointerProgramsInteration.pdf
- j28-SecureInformationFlowProgramLogics.pdf
- j27-BytecodeLogicJMLTypes.pdf
- j25-ProgramLogisResources.pdf
- j24-Well-foundednessRealizibility.pdf
- j23-ConsistencyTheoryContext.pdf
- j22-Preface.pdf
- j19-ArithmeticNonSizeIncreasingPolynominalTimeComputation.pdf
- j18-RealizabilityModelsBLL-LikeLanguages.pdf
- c33-TowardsFormayyVerifiableWCSTAnalysis.pdf
- c34-MOBIUSMobilityUbiquitySecurity.pdf
- c35 ProofSystemLinearTimeCalculus
- c36 TypeBasedAmortisedHeap Space
- c37 BytecodeLogicJMLTypes
- c38 ReadingWirtingRelations
- c39 EliminationGhostVariables
- c40 RelationalSemanticsEffect BasedProgrammTransformation
- c42 SecureInformationFlowProgramLogic
- c43 NominalRenamingSets
- c41 CertificationUsingMobiusBaseLogic
- c44 SemanticProofPolytimeSoundness
- c45 PurePointerProgramsInteration
- c46 FiniteDimensionalVectorSpaces
- c47 BoundedLinaerLogicRebvisited
- c48 RelationalSemanticsEffect BasedProgram
- c49 PointerProgramsUndirectedReachability
- c50 CarbonCredits
- c52 VerifyingLocalGenericSolver
- c56 WhatIsPureFunctional
- c51 EfficientTypeCheckingAmortisedHeap SpaceAnalysis
- c55 VerifyingPointerAndStringAnalyses
- c54 StaticDeterminationQuantitativeReaources
- c57 AmortizedResourcesAnalysisPotential
- c58 AmortizedResourcesAnalysis
- c59 SymmetricLendes
- c60 MultivariateAmortizedResourceAnalysis
- c61 TypeBasedEnforcement
- c62 LearnWithSATMinimizeBuechi
- c63 EditLenses
- c64 LinearContstraintsInfiniteTrees
- c65 ResourceAwareML
- c66 Proof RelevantLogicalRelations
- c67 ComputingFixedNumersPointers
- c68 PurePointerProgramsTrees
- c69 OnMonadicParametricityof2OrderFunction
- c70 AutomaticTypeInferenceAmortisedHeapSpaceAnalysis
- c71 AmortisedResourceAnalysisTypedPolynomial
- c72 AbstractEffectsProof RelevantRelations
- c73 FormalSemanticsSynchonousTransfer
- c74 AbstractInterpretationBuechiAutomata
- c32 QuantitativeModelsImplicitComplexity
- c31 ProofTheoreticApproch
- c27 WhatDoProgrammLogics and TypeSystemsInCommon
- c28 MobileResourcesGuarantees
- c26 AutomaticCertificationHeap Consumption
- c25 ProgrammLogicResourcesVerification
- c24 CertificationMemoryUsage
- c23 StaticPredictionHeapSpaceUsage
- c22 AnotherTypeSystem
- c20 NormalizationEvaluationTypedLambda
- c21 StrengthNon Size IncreasingComputation
- c19 StrengthNon Size IncreasingComputation
- c18 FromBoundedArithmetic
- c17 TypeSystemForBoundedSpace
- c16 ImplementingProgrammLogicHigherO Order
- j12 SafeRecursionHigherTypes
- j10 ProgammingLanuageCapturingCompl.Classes
- j13 NewFeasibleArithmetic
- j14 CompletenessContinuationModels
- j15 TypeDestructors
- j16 Preface
- j17 LinearTypesNonSizeIncerasing
- Barbara Proebster
- Stephan Barth
- Jan Johannsen
- Sarah Vaupel
- Ehemalige
-
Martin Hofmann
- Lehre
- Forschung
- Lehrerausbildung
- Schüler an der Uni
c59-SymmetricLendes.pdf