Person: Manuel Fähndrich

DBLP: F=auml=hndrich:Manuel

Facilitated 1 volumes:

Ed

Contributed to:

2015

2014

2014

2013

2013

2012

2012

2012

2012

2012

2012

2011

2010

2010

2010

2009

2008

2008

2008

2010

2007

2006

2004

2003

2002

2001

2001

2001

2000

2000

2000

1999

1998

1998

1997

1997

1995

1995

2011

Wrote 39 papers:

ECOOP-2015-BurckhardtLPF #abstraction #protocol #robust #sequence

Global Sequence Protocol: A Robust Abstraction for Replicated Shared State (SB, DL, JP, MF), pp. 568–590.

PEPM-2014-Fahndrich #ide #lessons learnt #runtime

Lessons from a web-based IDE and runtime (MF), pp. 1–2.

PLDI-2014-LogozzoLFB #towards #verification

Verification modulo versions: towards usable verification (FL, SKL, MF, SB), p. 32.

PLDI-2013-BurckhardtFHMMTK #exclamation #feedback #programming #user interface

It’s alive! continuous feedback in UI programming (SB, MF, PdH, SM, MM, NT, JK), pp. 95–104.

VMCAI-2013-CousotCFL #automation

Automatic Inference of Necessary Preconditions (PC, RC, MF, FL), pp. 128–148.

ASE-2012-XiaoTFHM #analysis #privacy

User-aware privacy control via extended static-information-flow analysis (XX, NT, MF, JdH, MM), pp. 80–89.

CSEET-2012-TillmannMHFX #education #mobile #student #using

Engage Your Students by Teaching Computer Science Using Only Mobile Devices with TouchDevelop (NT, MM, JdH, MF, TX), pp. 87–89.

ECOOP-2012-BurckhardtFLW #consistency

Cloud Types for Eventual Consistency (SB, MF, DL, BPW), pp. 283–307.

ESOP-2012-BurckhardtLFS #consistency #transaction

Eventually Consistent Transactions (SB, DL, MF, MS), pp. 67–86.

FSE-2012-TillmannMHFB #development #mobile #named

TouchDevelop: app development on mobile devices (NT, MM, JdH, MF, SB), p. 39.

ITiCSE-2012-TillmannMHFBSX #education #future of #mobile #programming

The future of teaching programming is on mobile devices (NT, MM, JdH, MF, JB, AS, TX), pp. 156–161.

Onward-2011-TillmannMHF #mobile #named #programming

TouchDevelop: programming cloud-connected mobile devices via touchscreen (NT, MM, JdH, MF), pp. 49–60.

OOPSLA-2010-BebenitaBFLSTV #compilation #jit #named

SPUR: a trace-based JIT compiler for CIL (MB, FB, MF, FL, WS, NT, HV), pp. 708–725.

SAC-2010-FahndrichBL #contract #embedded

Embedded contract languages (MF, MB, FL), pp. 2103–2110.

SAS-2010-Fahndrich #contract #verification

Static Verification for Code Contracts (MF), pp. 2–5.

SAS-2009-XiaFL #data flow

Inferring Dataflow Properties of User Defined Table Processors (SX, MF, FL), pp. 19–35.

CC-2008-LogozzoF #analysis #bytecode #on the #source code

On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis (FL, MF), pp. 197–212.

OOPSLA-2008-FerraraLF #dot-net

Safer unsafe code for .NET (PF, FL, MF), pp. 329–346.

SAC-2008-LogozzoF #abstract domain #array #named #performance #relational #validation

Pentagons: a weakly relational abstract domain for the efficient validation of array accesses (FL, MF), pp. 184–188.

SAC-OOPS-J-2008-LogozzoF10 #abstract domain #array #named #performance #relational #validation

Pentagons: A weakly relational abstract domain for the efficient validation of array accesses (FL, MF), pp. 796–807.

OOPSLA-2007-FahndrichX #invariant

Establishing object invariants with delayed types (MF, SX), pp. 337–350.

GPCE-2006-FahndrichCL #generative

Reflective program generation with patterns (MF, MC, JRL), pp. 275–284.

ECOOP-2004-DeLineF #type system

Typestates for Objects (RD, MF), pp. 465–490.

OOPSLA-2003-FahndrichL #object-oriented

Declaring and checking non-null types in an object-oriented language (MF, KRML), pp. 302–312.

PLDI-2002-FahndrichD #imperative #linear #programming

Adoption and Focus: Practical Linear Types for Imperative Programming (MF, RD), pp. 13–24.

PLDI-2001-DeLineF #bytecode #low level #protocol

Enforcing High-Level Protocols in Low-Level Software (RD, MF), pp. 59–69.

POPL-2001-RehofF #analysis #polymorphism #type system

Type-base flow analysis: from polymorphic subtyping to CFL-reachability (JR, MF), pp. 54–66.

SAS-2001-DasLFR #impact analysis #optimisation #pointer #scalability

Estimating the Impact of Scalable Pointer Analysis on Optimization (MD, BL, MF, JR), pp. 260–278.

PLDI-2000-FahndrichRD #analysis #constraints #scalability #using

Scalable context-sensitive flow analysis using instantiation constraints (MF, JR, MD), pp. 253–263.

POPL-2000-SuFA #constraints #graph

Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs (ZS, MF, AA), pp. 81–95.

SAS-2000-FosterFA #analysis #c #points-to #polymorphism

Polymorphic versus Monomorphic Flow-Insensitive Points-to Analysis for C (JSF, MF, AA), pp. 175–198.

PLDI-1999-FosterFA #formal method

A Theory of Type Qualifiers (JSF, MF, AA), pp. 192–203.

PLDI-1998-FahndrichFSA #constraints #graph #online

Partial Online Cycle Elimination in Inclusion Constraint Graphs (MF, JSF, ZS, AA), pp. 85–96.

TACAS-1998-AikenFS #detection #logic programming #source code

Detecting Races in Relay Ladder Logic Programs (AA, MF, ZS), pp. 184–200.

ICFP-1997-FahndrichB #abstraction

Statically Checkable Pattern Abstractions (MF, JB), pp. 75–84.

SAS-1997-FahndrichA #constraints #program analysis #set #using

Program Analysis Using Mixed Term and Set Constraints (MF, AA), pp. 114–126.

FPCA-1995-AikenF #dynamic typing #type inference #type system

Dynamic Typing and Subtype Inference (AA, MF), pp. 182–191.

PLDI-1995-AikenFL #analysis #higher-order #memory management

Better Static Memory Management: Improving Region-Based Analysis of Higher-Order Languages (AA, MF, RL), pp. 174–185.

Haskell-2011-LeijenFB #concurrent #functional

Prettier concurrency: purely functional concurrent revisions (DL, MF, SB), pp. 83–94.