4 papers:
- KR-2014-Dyrkolbotn #how #set #using
- How to Argue for Anything: Enforcing Arbitrary Sets of Labellings using AFs (SKD).
- ICSE-2013-GoodenoughWK #induction
- Eliminative induction: a basis for arguing system confidence (JBG, CBW, AZK), pp. 1161–1164.
- RE-2011-YuTTFN #named
- OpenArgue: Supporting argumentation to evolve secure software systems (YY, TTT, AT, VNLF, BN), pp. 351–352.
- ICALP-1989-BrassardC #bound
- Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (GB, CC, MY), pp. 123–136.