Travelled to:1 × Austria
1 × Poland
1 × USA
Collaborated with:S.Jha M.Christodorescu R.Joiner T.W.Reps P.A.Porras H.Saïdi V.Yegneswaran
Talks about:new (2) counterexampl (1) algorithm (1) properti (1) behavior (1) approxim (1) approach (1) abstract (1) satisfi (1) privaci (1)
Person: Matthew Fredrikson
DBLP: Fredrikson:Matthew
Contributed to:
2014
2012
2011Wrote 3 papers:
- LICS-CSL-2014-FredriksonJ #approach #privacy #satisfiability
- Satisfiability modulo counting: a new approach for analyzing privacy properties (MF, SJ), p. 10.
- CAV-2012-FredriksonJJRPSY #abstraction #performance #policy #refinement #runtime #using
- Efficient Runtime Policy Enforcement Using Counterexample-Guided Abstraction Refinement (MF, RJ, SJ, TWR, PAP, HS, VY), pp. 548–563.
- CADE-2011-FredriksonCJ #algorithm #analysis #approximate #behaviour #complexity
- Dynamic Behavior Matching: A Complexity Analysis and New Approximation Algorithms (MF, MC, SJ), pp. 252–267.