The following pages link to TALx86 (Q46220):
Displayed 42 items.
- Item:Q46220 (redirect page) (← links)
- A verifiable low-level concurrent programming model based on colored Petri nets (Q350966) (← links)
- Certifying assembly programs with trails (Q352100) (← links)
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- Function extraction (Q436372) (← links)
- Application of static analyses for state-space reduction to the microcontroller binary code (Q617924) (← links)
- \textsc{Mnemonics}: type-safe bytecode generation at run time (Q656864) (← links)
- Certifying low-level programs with hardware interrupts and preemptive threads (Q835764) (← links)
- Polymorphic typed defunctionalization and concretization (Q853737) (← links)
- Formal compiler construction in a logical framework (Q853741) (← links)
- Towards imperative modules: reasoning about invariants and sharing of mutable state (Q854171) (← links)
- Security types preserving compilation (Q865705) (← links)
- A new type system for JVM lock primitives (Q949169) (← links)
- Abstraction-carrying code: a model for mobile code safety (Q949170) (← links)
- A type system for the push-enter model (Q1014422) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- A formal model of real-time program compilation (Q1603710) (← links)
- Fully abstract trace semantics for protected module architectures (Q1749116) (← links)
- Type-based hot swapping of running modules (Q1772100) (← links)
- Automated techniques for provably safe mobile code. (Q1853627) (← links)
- Verified bytecode verification and type-certifying compilation (Q1881665) (← links)
- A first-order one-pass CPS transformation (Q1884883) (← links)
- A list-machine benchmark for mechanized metatheory (Q1945921) (← links)
- On the relative expressiveness of higher-order session processes (Q2272988) (← links)
- Formal enforcement of security policies on concurrent systems (Q2275899) (← links)
- Observational program calculi and the correctness of translations (Q2339472) (← links)
- Time analysis of actor programs (Q2423757) (← links)
- A reduction semantics for direct-style asynchronous observables (Q2423763) (← links)
- Types for the ambient calculus (Q2497144) (← links)
- safeDpi: a language for controlling mobile code (Q2581010) (← links)
- A formally verified compiler back-end (Q2655327) (← links)
- (Q2783224) (← links)
- Stack-based typed assembly language (Q2784166) (← links)
- On the Relative Expressiveness of Higher-Order Session Processes (Q2802492) (← links)
- A Representation of Fω in LF (Q2841235) (← links)
- (Q2843920) (← links)
- Type-Safe Code Transformations in Haskell (Q2866331) (← links)
- Lightweight Static Capabilities (Q2866337) (← links)
- Verification of Common Interprocedural Compiler Optimizations Using Visibly Pushdown Kleene Algebra (Q3067464) (← links)
- Stack-based typed assembly language (Q4460723) (← links)
- (Q4532093) (← links)
- ANF preserves dependent types up to extensional equality (Q5051989) (← links)