## Stem notion$ (all stems)

### 66 papers:

- ITiCSE-2014-BerryK #game studies #learning #programming
- The state of play: a notional machine for learning programming (MB, MK), pp. 21–26.
- HCI-TMT-2014-HeidtPBR #communication
- Tangible Disparity — Different Notions of the Material as Catalyst of Interdisciplinary Communication (MH, LP, AB, PR), pp. 199–206.
- HIMI-D-2013-Miki #design #experience #user interface
- Reconsidering the Notion of User Experience for Human-Centered Design (HM), pp. 329–337.
- FoSSaCS-2010-CassezMZ #complexity #data flow #security
- The Complexity of Synchronous Notions of Information Flow Security (FC, RvdM, CZ), pp. 282–296.
- ICALP-v1-2010-Ambos-SpiesB #exponential
- Weak Completeness Notions for Exponential Time (KAS, TB), pp. 503–514.
- KDD-2010-SarangiM #named #nondeterminism #similarity
- DUST: a generalized notion of similarity between uncertain time series (SRS, KM), pp. 383–392.
- MoDELS-v1-2010-Kuhne #inheritance
- An Observer-Based Notion of Model Inheritance (TK), pp. 31–45.
- PPDP-2010-Barbanerad #behaviour
- Two notions of sub-behaviour for session-based client/server systems (FB, Ud), pp. 155–164.
- POPL-2010-Henzinger #correctness
- From Boolean to quantitative notions of correctness (TAH), pp. 157–158.
- SAC-2010-MairizaZN #non-functional #requirements
- An investigation into the notion of non-functional requirements (DM, DZ, NN), pp. 311–317.
- SAC-2009-BroyLSSW #adaptation #behaviour #formal method
- Formalizing the notion of adaptive system behavior (MB, CL, WS, BS, SW), pp. 1029–1033.
- CSL-2009-AtseriasW #consistency #constraints #decidability #problem
- Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems (AA, MW), pp. 102–116.
- SIGMOD-2008-BonifatiMPRS #quality #towards
- The Spicy system: towards a notion of mapping quality (AB, GM, AP, SR, GS), pp. 1289–1294.
- GT-VMT-2006-BaldanCDFGR08 #graph grammar #towards #transaction
- Towards a Notion of Transaction in Graph Rewriting (PB, AC, FLD, LF, FG, LR), pp. 39–50.
- KR-2008-FaberTW #equivalence #logic programming #order #source code
- Notions of Strong Equivalence for Logic Programs with Ordered Disjunction (WF, HT, SW), pp. 433–443.
- KR-2008-Meyden #distributed #on the
- On Notions of Causality and Distributed Knowledge (RvdM), pp. 209–219.
- PPDP-2007-Lopez-FraguasRS #semantics
- A simple rewrite notion for call-time choice semantics (FJLF, JRH, JSH), pp. 197–208.
- ICLP-2007-Wong #equivalence #logic programming #source code
- A Stronger Notion of Equivalence for Logic Programs (KSW), pp. 453–454.
- CAiSE-2006-WeigandJABEI #on the
- On the Notion of Value Object (HW, PJ, BA, MB, AE, TI), pp. 321–335.
- CSL-2006-CortierRZ #standard
- Relating Two Standard Notions of Secrecy (VC, MR, EZ), pp. 303–318.
- WRLA-2004-ArrighiD05
- A Computational Definition of the Notion of Vectorial Space (PA, GD), pp. 249–261.
- DLT-J-2004-IbarraYD05 #on the #parallel
- On various notions of parallelism in P Systems (OHI, HCY, ZD), pp. 683–705.
- ICALP-2005-LipmaaWB #security #verification
- Designated Verifier Signature Schemes: Attacks, New Security Notions and a New Construction (HL, GW, FB), pp. 459–471.
- CAiSE-2005-PetrovJH #consistency #metadata #on the #repository
- On the Notion of Consistency in Metadata Repository Systems (IP, SJ, MH), pp. 90–104.
- STOC-2004-PrabhakaranS #security
- New notions of security: achieving universal composability without trusted setup (MP, AS), pp. 242–251.
- DLT-2004-EhrenfeuchtR
- Basic Notions of Reaction Systems (AE, GR), pp. 27–29.
- EDOC-2004-AlmeidaDSP #development #framework #on the
- On the Notion of Abstract Platform in MDA Development (JPAA, RMD, MvS, LFP), pp. 253–263.
- KDD-2004-SteinbachTXK
- Generalizing the notion of support (MS, PNT, HX, VK), pp. 689–694.
- CSL-2004-ArenasBL #finite #game studies #locality #modelling
- Game-Based Notions of Locality Over Finite Models (MA, PB, LL), pp. 175–189.
- CSL-2004-Atserias #complexity #random #satisfiability
- Notions of Average-Case Complexity for Random 3-SAT (AA), pp. 1–5.
- IJCAR-2004-BofillR #order
- Redundancy Notions for Paramodulation with Non-monotonic Orderings (MB, AR), pp. 107–121.
- AdaEurope-2003-LinM #behaviour #object-oriented #programming #type system
- A Behavioural Notion of Subtyping for Object-Oriented Programming in SPARK95 (TML, JAM), pp. 309–321.
- PPDP-2003-NielsenK #towards #trust
- Towards a formal notion of trust (MN, KK), pp. 4–7.
- FoSSaCS-2002-PlotkinP #monad
- Notions of Computation Determine Monads (GDP, JP), pp. 342–356.
- FLOPS-2002-Meer #algebra #consistency #constraints #on the #source code
- On Consistency and Width Notions for Constraint Programs with Algebraic Constraints (KM), pp. 88–102.
- WICSA-2001-GurpBS #on the #product line #variability
- On the Notion of Variability in Software Product Lines (JvG, JB, MS), pp. 45–54.
- ASE-2001-LedruBBMOP #adaptation #specification #testing
- Test Purposes: Adapting the Notion of Specification to Testing (YL, LdB, PB, OM, CO, MLP), pp. 127–134.
- STOC-2000-KatzY #encryption #probability #security
- Complete characterization of security notions for probabilistic private-key encryption (JK, MY), pp. 245–254.
- ICALP-2000-BaudronPS #multi #security
- Extended Notions of Security for Multicast Public Key Cryptosystems (OB, DP, JS), pp. 499–511.
- ICPR-v1-2000-Rodriguez-SanchezGFF #how
- How to Define the Notion of Microcalcifications in Digitized Mammograms (RRS, JAG, JFV, XRFV), pp. 1494–1499.
- LICS-2000-Birkedal
- A General Notion of Realizability (LB), pp. 7–17.
- TOOLS-USA-1998-LoweNTZ #inheritance #type system
- Weak Subtyping — Yet Another Notion of Inheritance (WL, RN, MT, WZ), pp. 333–345.
- IWTCS-1998-BaumgartenW #testing
- Qualitative Notions of Testability (BB, HW), pp. 345–360.
- KDD-1997-KnorrN
- A Unified Notion of Outliers: Properties and Computation (EMK, RTN), pp. 219–222.
- ICPR-1996-LiuL #approach #classification #effectiveness #performance #using
- An efficient and effective texture classification approach using a new notion in wavelet theory (JFL, JCML), pp. 820–824.
- PLILP-1995-Rety #revisited
- The Notion of Floundering for SLDNF-Resolution Revisited (JHR), pp. 380–396.
- LICS-1995-KfouryW #normalisation #proving #reduction #semantics #λ-calculus
- New Notions of Reduction and Non-Semantic Proofs of β-Strong Normalization in Typed λ-Calculi (AJK, JBW), pp. 311–321.
- CADE-1994-WirthG #equation #induction #on the
- On Notions of Inductive Validity for First-Oder Equational Clauses (CPW, BG), pp. 162–176.
- STOC-1993-BaruahCPV #resource management
- Proportionate progress: a notion of fairness in resource allocation (SKB, NKC, CGP, DAV), pp. 345–354.
- WSA-1993-GluckK #process
- Occam’s Razor in Metacompuation: the Notion of a Perfect Process Tree (RG, AVK), pp. 112–123.
- TLCA-1993-GianantonioH
- An Abstract Notion of Application (PDG, FH), pp. 124–138.
- ESOP-1992-BernotBK #towards
- Towards an Adequate Notion of Observation (GB, MB, TK), pp. 39–55.
- VDME-1991-1-Goldschlag #formal method
- A Mechanical Formalization of Several Fairness Notions (DMG), pp. 125–148.
- OOPSLA-ECOOP-1990-CarreG #inheritance #multi
- The Point of View Notion for Multiple Inheritance (BC, JMG), pp. 312–321.
- POPL-1990-Griffin #type system
- A Formulae-as-Types Notion of Control (TG), pp. 47–58.
- CLP-1990-PowerS90 #logic programming #source code
- A Notion of Map between Logic Programs (AJP, LS), pp. 390–404.
- HT-1989-DeRose
- Expanding the Notion of Links (SJD), pp. 249–257.
- POPL-1988-Cardelli #type system
- Structural Subtyping and the Notion of Power Type (LC), pp. 70–79.
- LICS-1988-MendlerA #framework
- The notion of a Framework and a framework for LTC (PFM, PA), pp. 392–399.
- LICS-1987-FaginH #communication
- I’m OK if You’re OK: On the Notion of Trusting Communication (RF, JYH), pp. 280–292.
- GG-1986-JanssensR #graph grammar
- Basic notions of actor grammars: A graph grammar model for actor computation (DJ, GR), pp. 280–298.
- STOC-1983-AhoUY #on the
- On Notions of Information Transfer in VLSI Circuits (AVA, JDU, MY), pp. 133–139.
- PODS-1982-GrahamM #dependence
- Notions of Dependency Satisfaction (MHG, AOM), pp. 177–188.
- ILPC-1982-Blair82
- The Undecidability of Two Completeness Notions for the “Negation as Failure” (HAB), pp. 164–168.
- ICALP-1979-RozenbergV #finite
- Extending the Notion of Finite Index (GR, DV), pp. 479–488.
- ICALP-1978-Zilli #combinator #logic #normalisation
- Head Recurrent Terms in Combinatory Logic: A Generalization of the Notion of Head Normal Form (MVZ), pp. 477–493.