Travelled to:1 × China
1 × Czech Republic
1 × Estonia
1 × Germany
1 × Hungary
1 × India
1 × Italy
1 × Spain
1 × The Netherlands
4 × USA
Collaborated with:J.Vitek V.Vafeiadis R.Morisset B.Chung P.Sewell G.Richards M.Merro S.Jagannathan P.Pawan C.Fournet N.Guts A.Hobor A.W.Appel Théophile Bastian S.Kell S.Sarkar S.Owens T.Ridge N.M.Lê A.Pop A.Cohen P.Li T.Balabonski S.Chakraborty C.Hammer J.Sevcík T.Wrigstad S.Lebresne J.Östlund Julia Belyakova Artem Pelenitsyn Jeff Bezanson G.Peskine R.Strnisa J.J.Leifer K.Wansbrough M.Allen-Williams P.Habouzit T.Braibant M.O.Myreen J.Alglave
Talks about:memori (4) type (4) optimis (3) compil (3) model (3) languag (2) concurr (2) verifi (2) subtyp (2) semant (2)
Person: Francesco Zappa Nardelli
DBLP: Nardelli:Francesco_Zappa
Contributed to:
2015
2015
2013
2013
20132011
201120102009
2008
20072005
2003
20172018201820192019Wrote 19 papers:
- ECOOP-2015-RichardsNV #typescript
- Concrete Types for TypeScript (GR, FZN, JV), pp. 76–100.
- POPL-2015-VafeiadisBCMN #compilation #memory management #optimisation #what
- Common Compiler Optimisations are Invalid in the C11 Memory Model and what we can do about it (VV, TB, SC, RM, FZN), pp. 209–220.
- OOPSLA-2013-RichardsHNJV #data access #flexibility #javascript
- Flexible access control for javascript (GR, CH, FZN, SJ, JV), pp. 305–322.
- PLDI-2013-MorissetPN #compilation #formal method #memory management #optimisation #testing
- Compiler testing via a theory of sound optimisations in the C11/C++11 memory model (RM, PP, FZN), pp. 187–196.
- PPoPP-2013-LePCN #memory management #modelling #performance
- Correct and efficient work-stealing for weak memory models (NML, AP, AC, FZN), pp. 69–80.
- POPL-2011-SevcikVNJS #compilation #concurrent
- Relaxed-memory concurrency and verified compilation (JS, VV, FZN, SJ, PS), pp. 43–54.
- SAS-2011-VafeiadisN #optimisation #verification
- Verifying Fence Elimination Optimisations (VV, FZN), pp. 146–162.
- POPL-2010-WrigstadNLOV #scripting language
- Integrating typed and untyped code in a scripting language (TW, FZN, SL, JÖ, JV), pp. 377–388.
- POPL-2009-SarkarSNORBMA #multi #semantics
- The semantics of x86-CC multiprocessor machine code (SS, PS, FZN, SO, TR, TB, MOM, JA), pp. 379–391.
- ESOP-2008-FournetGN #implementation
- A Formal Implementation of Value Commitment (CF, NG, FZN), pp. 383–397.
- ESOP-2008-HoborAN #concurrent #logic #semantics
- Oracle Semantics for Concurrent Separation Logic (AH, AWA, FZN), pp. 353–367.
- ICFP-2007-SewellNOPRSS #effectiveness #named #semantics #tool support
- Ott: effective tool support for the working semanticist (PS, FZN, SO, GP, TR, SS, RS), pp. 1–12.
- ICFP-2005-SewellLWNAHV #design #distributed #named #programming language
- Acute: high-level programming language design for distributed computation (PS, JJL, KW, FZN, MAW, PH, VV), pp. 15–26.
- ICALP-2003-MerroN #bisimulation #mobile #proving
- Bisimulation Proof Methods for Mobile Ambients (MM, FZN), pp. 584–598.
- CC-2017-MorissetN
- Partially redundant fence elimination for x86, ARM, and power processors (RM, FZN), pp. 1–10.
- ECOOP-2018-ChungLNV #named #type system
- KafKa: Gradual Typing for Objects (BC, PL, FZN, JV), p. 24.
- OOPSLA-2018-NardelliBPCBV #re-engineering #type system
- Julia subtyping: a rational reconstruction (FZN, JB, AP, BC, JB, JV), p. 27.
- ECOOP-2019-ChungNV #algorithm #performance #tuple #type system
- Julia's Efficient Algorithm for Subtyping Unions and Covariant Tuples (Pearl) (BC, FZN, JV), p. 15.
- OOPSLA-2019-BastianKN #performance #reliability #stack
- Reliable and fast DWARF-based stack unwinding (TB, SK, FZN), p. 24.