Travelled to:1 × Austria
1 × France
1 × Italy
1 × Portugal
1 × United Kingdom
3 × USA
Collaborated with:∅ Z.Manna H.B.Sipma J.Birgmeier G.Weissenbacher Z.Hassan F.Somenzi
Talks about:induct (3) increment (2) model (2) check (2) counterexampl (1) understand (1) reachabl (1) principl (1) polyrank (1) polynomi (1)
Person: Aaron R. Bradley
DBLP: Bradley:Aaron_R=
Contributed to:
20142012
2012
201120062005
20052005Wrote 9 papers:
- CAV-2014-BirgmeierBW #abstraction #induction
- Counterexample to Induction-Guided Abstraction-Refinement (CTIGAR) (JB, ARB, GW), pp. 831–848.
- CAV-2012-Bradley #incremental #induction #verification
- IC3 and beyond: Incremental, Inductive Verification (ARB), p. 4.
- CAV-2012-HassanBS #incremental #induction #model checking
- Incremental, Inductive CTL Model Checking (ZH, ARB, FS), pp. 532–547.
- SAT-2012-Bradley #comprehension
- Understanding IC3 (ARB), pp. 1–14.
- VMCAI-2011-Bradley #model checking #satisfiability
- SAT-Based Model Checking without Unrolling (ARB), pp. 70–87.
- VMCAI-2006-BradleyMS #array #decidability #question #what
- What’s Decidable About Arrays? (ARB, ZM, HBS), pp. 427–442.
- CAV-2005-BradleyMS #linear #ranking #reachability
- Linear Ranking with Reachability (ARB, ZM, HBS), pp. 491–504.
- ICALP-2005-BradleyMS #principle #ranking
- The Polyranking Principle (ARB, ZM, HBS), pp. 1349–1361.
- VMCAI-2005-BradleyMS #polynomial #source code #termination
- Termination of Polynomial Programs (ARB, ZM, HBS), pp. 113–129.