47 papers:
CASE-2015-ChenH #assembly #automation #distributed #petri net #using- Maximally permissive distributed control of automated manufacturing systems with assembly operations using Petri nets (CC, HH), pp. 532–538.
FM-2015-BagheriKMJ #android #bound #design #detection #protocol #verification- Detection of Design Flaws in the Android Permission Protocol Through Bounded Verification (HB, EK, SM, DJ), pp. 73–89.
SEKE-2015-SongHJC #android #generative #testing- Generating various contexts from permissions for testing Android applications (KS, ARH, SJ, SDC), pp. 87–92.
ASE-2014-ShenVTADLKZ #data flow- Information flows as a permission mechanism (FS, NV, CT, MA, BD, EJL, SYK, LZ), pp. 515–526.
TACAS-2014-DragerFKPU #probability #synthesis- Permissive Controller Synthesis for Probabilistic Systems (KD, VF, MZK, DP, MU), pp. 531–546.
PLDI-2014-StorkNSMFMA #approach #named #programming language- Æminium: a permission based concurrent-by-default programming language approach (SS, KN, JS, MM, AF, PM, JA), p. 4.
CHI-2014-TanNTNTEW #behaviour #developer #smarttech- The effect of developer-specified explanations for permission requests on smartphone user behavior (JT, KN, MT, HNA, CT, SE, DW), pp. 91–100.
HPCA-2014-ElwellRAP #architecture #memory management- A Non-Inclusive Memory Permissions architecture for protection against cross-layer attacks (JE, RR, NBAG, DP), pp. 201–212.
ASE-2013-HolavanalliMNRSKZ #android- Flow Permissions for Android (SH, DM, VN, BR, FS, SYK, LZ), pp. 652–657.
CASE-2013-HuZL13a #automation #distributed #petri net #scalability- Maximally permissive distributed control of large scale automated manufacturing systems modeled with Petri nets (HH, MZ, YL), pp. 1145–1150.
MSR-2013-StevensGFDC #android- Asking for (and about) permissions used by Android apps (RS, JG, VF, PTD, HC), pp. 31–40.
ICFP-2013-PottierP #programming- Programming with permissions in Mezzo (FP, JP), pp. 173–184.
ECOOP-2013-HeuleKMS #abstraction #generative #logic #verification- Verification Condition Generation for Permission Logics with Abstract Predicates and Abstraction Functions (SH, ITK, PM, AJS), pp. 451–476.
Onward-2013-ValleeWZFK #modelling #problem #reasoning #security- Usable security as a static-analysis problem: modeling and reasoning about user permissions in social-sharing systems (HQdlV, JMW, WZ, KF, SK), pp. 1–16.
VMCAI-2013-HeuleLMS- Abstract Read Permissions: Fractional Permissions without the Fractions (SH, KRML, PM, AJS), pp. 315–334.
ASE-2012-BartelKTM #android #automation- Automatically securing permission-based software by reducing the attack surface: an application to Android (AB, JK, YLT, MM), pp. 274–277.
ECOOP-2012-WestbrookZBS #parallel- Practical Permissions for Race-Free Parallelism (EMW, JZ, ZB, VS), pp. 614–639.
TOOLS-EUROPE-2012-MehnertA #type system #using #verification- Verification of Snapshotable Trees Using Access Permissions and Typestate (HM, JA), pp. 187–201.
PPDP-2012-OlartePRC #approach #automation #concurrent #constraints #linear #verification- A linear concurrent constraint approach for the automatic verification of access permissions (CO, EP, CR, NC), pp. 207–216.
POPL-2012-HeideggerBT #contract #scripting language- Access permission contracts for scripting languages (PH, AB, PT), pp. 111–122.
POPL-2012-NadenBAB #type system- A type system for borrowing permissions (KN, RB, JA, KB), pp. 557–570.
VMCAI-2012-FerraraM #automation- Automatic Inference of Access Permissions (PF, PM), pp. 202–218.
CASE-2011-NazeemR #classification #concurrent #design #policy #resource management- Designing maximally permissive deadlock avoidance policies for sequential resource allocation systems through classification theory (AN, SAR), pp. 405–412.
FM-2011-CiobanuK #interactive #migration- Timed Migration and Interaction with Access Permissions (GC, MK), pp. 293–307.
OCSC-2011-DerthickTKBZM #collaboration #wiki- Collaborative Sensemaking during Admin Permission Granting in Wikipedia (KD, PT, TK, AB, MZ, DWM), pp. 100–109.
Onward-2011-Bierhoff #automation #lightweight #reasoning #verification- Automated program verification made SYMPLAR: symbolic permissions for lightweight automated reasoning (KB), pp. 19–32.
ICSE-2011-AldrichGHMNSSSTW #programming language- Permission-based programming languages (JA, RG, MH, MM, KN, DS, SS, JS, ÉT, RW), pp. 828–831.
CASE-2010-NazeemR #approach #design #resource management- A practical approach to the design of maximally permissive liveness-enforcing supervisors for complex resource allocation systems (AN, SR), pp. 451–458.
PPDP-2010-DowekG #logic- Permissive-nominal logic (GD, MJG), pp. 165–176.
CASE-2009-WangLNRKML #concurrent #parallel #source code #thread- Maximally permissive deadlock avoidance for multithreaded computer programs (Extended abstract) (YW, HL, AN, SAR, TK, SAM, SL), pp. 37–41.
ICSM-2009-HuangSWSW #industrial #legacy #mining #preprocessor- Preprocessing the noise in legacy user permission assignment data for role mining — An industrial practice (CH, JS, XW, YS, DW), pp. 403–406.
ECOOP-2009-BierhoffBA #api #protocol- Practical API Protocol Checking with Access Permissions (KB, NEB, JA), pp. 195–219.
ICSE-2009-GeayPTRD #analysis #composition #precise #string- Modular string-sensitive permission analysis with demand-driven precision (EG, MP, TT, BGR, JD), pp. 177–187.
FASE-2008-JurjensSY #analysis #automation #security #using- Automated Analysis of Permission-Based Security Using UMLsec (JJ, JS, YY), pp. 292–295.
PLDI-2005-KrishnaswamiA #encapsulation #higher-order- Permission-based ownership: encapsulating state in higher-order typed languages (NRK, JA), pp. 96–106.
CHI-2005-PatilL #configuration management #privacy #what- Who gets to know what when: configuring privacy permissions in an awareness application (SP, JL), pp. 101–110.
POPL-2005-BornatCOP #logic- Permission accounting in separation logic (RB, CC, PWO, MJP), pp. 259–270.
RE-2005-BreauxA #semantics- Analyzing Goal Semantics for Rights, Permissions, and Obligations (TDB, AIA), pp. 177–188.
RE-2005-GiorginiMMZ #modelling #requirements #security- Modeling Security Requirements Through Ownership, Permission and Delegation (PG, FM, JM, NZ), pp. 167–176.
ESEC-FSE-2005-HenzingerJM #interface- Permissive interfaces (TAH, RJ, RM), pp. 31–40.
SAS-2003-Boyland- Checking Interference with Fractional Permissions (JB), pp. 55–72.
ISSTA-2002-Naumovich #algorithm #java #source code- A conservative algorithm for computing the flow of permissions in Java programs (GN), pp. 33–43.
DAC-1994-WangB #automaton #network- Permissible Observability Relations in FSM Networks (HYW, RKB), pp. 677–683.
EDAC-1994-RohfleischB #logic #optimisation- Introduction of Permissible Bridges with Application to Logic Optimization after Technology Mapping (BR, FB), pp. 87–93.
ML-1991-BennettD #probability- Comparing Stochastic Planning to the Acquisition of Increasingly Permissive Plans (SB, GD), pp. 586–590.
DAC-1990-SatoYMF #diagrams- Boolean Resubstitution with Permissible Functions and Binary Decision Diagrams (HS, YY, YM, MF), pp. 284–289.
LICS-1990-Meyden #logic- The Dynamic Logic of Permission (RvdM), pp. 72–78.