TALx86

From MaRDI portal
Revision as of 20:54, 5 March 2024 by Import240305080343 (talk | contribs) (Created automatically from import240305080343)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Software:46220



swMATH34511MaRDI QIDQ46220


No author found.





Related Items (41)

Verified bytecode verification and type-certifying compilationA first-order one-pass CPS transformationCertifying low-level programs with hardware interrupts and preemptive threadsANF preserves dependent types up to extensional equalityPolymorphic typed defunctionalization and concretizationFormal compiler construction in a logical frameworkTowards imperative modules: reasoning about invariants and sharing of mutable stateA verifiable low-level concurrent programming model based on colored Petri netsCertifying assembly programs with trailsSecurity types preserving compilationA formally verified compiler back-endAn observationally complete program logic for imperative higher-order functionsApplication of static analyses for state-space reduction to the microcontroller binary codeTime analysis of actor programsA reduction semantics for direct-style asynchronous observablesA list-machine benchmark for mechanized metatheoryFunction extraction\textsc{Mnemonics}: type-safe bytecode generation at run timeJaguar: enabling efficient communication and I/O in JavaA new type system for JVM lock primitivesAbstraction-carrying code: a model for mobile code safetyFully abstract trace semantics for protected module architecturesUnnamed ItemUnnamed ItemStack-based typed assembly languageType-based hot swapping of running modulesTypes for the ambient calculusOn the relative expressiveness of higher-order session processesStack-based typed assembly languageFormal enforcement of security policies on concurrent systemsVerification of Common Interprocedural Compiler Optimizations Using Visibly Pushdown Kleene AlgebraOn the Relative Expressiveness of Higher-Order Session ProcessesA type system for the push-enter modelA note on complexity measures for inductive classes in constructive type theoryA Representation of Fω in LFObservational program calculi and the correctness of translationsAutomated techniques for provably safe mobile code.safeDpi: a language for controlling mobile codeType-Safe Code Transformations in HaskellLightweight Static CapabilitiesA formal model of real-time program compilation


This page was built for software: TALx86