Travelled to:1 × Russia
1 × Spain
1 × The Netherlands
2 × France
2 × USA
Collaborated with:S.Jha T.W.Reps S.Gulwani Akhilesh Srikanth Burak Sahin G.Jin S.Lu S.Sankaranarayanan F.Ivancic A.Gupta A.Lal A.V.Nori S.K.Rajamani N.Kidd S.Chaki F.Sagstetter M.Lukasiewycz S.Steinhorst M.Wolf A.Bouard T.Peyrin A.Poschmann S.Chakraborty
Talks about:program (3) secur (2) spreadsheet (1) architectur (1) transform (1) pushdown (1) interact (1) challeng (1) unbound (1) theorem (1)
Person: William R. Harris
DBLP: Harris:William_R=
Contributed to:
2013
20132012
2011
2010
2010
20092017Wrote 8 papers:
- CAV-2013-HarrisJLJ #library #validation
- Validating Library Usage Interactively (WRH, GJ, SL, SJ), pp. 796–812.
- DATE-2013-SagstetterLSWBHJPPC #architecture #challenge #design #hardware #security
- Security challenges in automotive hardware/software architecture design (FS, ML, SS, MW, AB, WRH, SJ, TP, AP, SC), pp. 458–463.
- CAV-2012-HarrisJR #automaton #game studies #programming #safety
- Secure Programming via Visibly Pushdown Safety Games (WRH, SJ, TWR), pp. 581–598.
- PLDI-2011-HarrisG #spreadsheet
- Spreadsheet table transformations from examples (WRH, SG), pp. 317–328.
- POPL-2010-HarrisSIG #program analysis #satisfiability #source code
- Program analysis via satisfiability modulo path programs (WRH, SS, FI, AG), pp. 71–82.
- SAS-2010-HarrisLNR #termination
- Alternation for Termination (WRH, AL, AVN, SKR), pp. 304–319.
- FM-2009-HarrisKCJR #bound #data flow #process #verification
- Verifying Information Flow Control over Unbounded Processes (WRH, NK, SC, SJ, TWR), pp. 773–789.
- POPL-2017-SrikanthSH #complexity #theorem #using #verification
- Complexity verification using guided theorem enumeration (AS, BS, WRH), pp. 639–652.