Stem assumpt$ (all stems)

93 papers:

HIMI-IKC-2015-SturreCVS #assessment #eye tracking #using

Using Eye Movements to Test Assumptions of the Situation Present Assessment Method (LS, DC, KPLV, TZS), pp. 45–52.

ASPLOS-2015-AlglaveBDGKPSW #behaviour #concurrent #gpu #programming

GPU Concurrency: Weak Behaviours and Programming Assumptions (JA, MB, AFD, GG, JK, DP, TS, JW), pp. 577–591.

DATE-2014-HaddadTBF #independence #modelling #on the #probability

On the assumption of mutual independence of jitter realizations in P-TRNG stochastic models (PH, YT, FB, VF), pp. 1–6.

FASE-2014-LanduytJ #architecture #requirements

Modularizing Early Architectural Assumptions in Scenario-Based Requirements (DVL, WJ), pp. 170–184.

SEKE-2014-YangL #agile #architecture #development #identification

Identifying and Recording Software Architectural Assumptions in Agile Development (CY, PL), pp. 308–313.

ISSTA-2014-ZhangJWMLEN #empirical #independence

Empirically revisiting the test independence assumption (SZ, DJ, JW, KM, WL, MDE, DN), pp. 385–396.

TAP-2014-KanigCCGMR #verification

Explicit Assumptions — A Prenup for Marrying Static and Dynamic Program Verification (JK, RC, CC, JG, YM, ER), pp. 142–157.

GT-VMT-2013-GreenyerBM #diagrams #sequence chart #specification

The ScenarioTools Play-Out of Modal Sequence Diagram Specifications with Environment Assumptions (JG, CB, VPLM).

RE-2013-ZarghamiVESW #identification #risk management

Assumption-based risk identification method (ARM) in dynamic service provisioning (AZ, EV, MZE, MvS, RW), pp. 175–184.

SAT-2013-AudemardLS #incremental #satisfiability

Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction (GA, JML, LS), pp. 309–317.

SAT-2013-LagniezB

Factoring Out Assumptions to Speed Up MUS Extraction (JML, AB), pp. 276–292.

WICSA-ECSA-2012-LanduytTJ #architecture #requirements

Documenting Early Architectural Assumptions in Scenario-Based Requirements (DVL, ET, WJ), pp. 329–333.

DATE-2012-MitraBD #formal method #mining #ranking

Formal methods for ranking counterexamples through assumption mining (SM, AB, PD), pp. 911–916.

FM-2012-ChristakisMW #collaboration #testing #verification

Collaborative Verification and Testing with Explicit Assumptions (MC, PM, VW), pp. 132–146.

MoDELS-2012-RamirezCBS #nondeterminism #runtime

Relaxing Claims: Coping with Uncertainty While Evaluating Assumptions at Run Time (AJR, BHCC, NB, PS), pp. 53–69.

MoDELS-2012-RamirezCBS #nondeterminism #runtime

Relaxing Claims: Coping with Uncertainty While Evaluating Assumptions at Run Time (AJR, BHCC, NB, PS), pp. 53–69.

SAC-2012-MinervinidF #concept #learning #logic #probability

Learning probabilistic Description logic concepts: under different Assumptions on missing knowledge (PM, Cd, NF), pp. 378–383.

SAT-2012-NadelR #performance #satisfiability

Efficient SAT Solving under Assumptions (AN, VR), pp. 242–255.

ASE-2011-WelshSB #requirements #runtime #towards

Towards requirements aware systems: Run-time resolution of design-time assumptions (KW, PS, NB), pp. 560–563.

VLDB-2011-TzoumasDJ #estimation #independence #lightweight #modelling #visual notation

Lightweight Graphical Models for Selectivity Estimation Without Independence Assumptions (KT, AD, CSJ), pp. 852–863.

FASE-2011-FengKP #automation #composition #learning #probability #reasoning

Automated Learning of Probabilistic Assumptions for Compositional Reasoning (LF, MZK, DP), pp. 2–17.

SCAM-2011-SawinR #algorithm #graph

Assumption Hierarchy for a CHA Call Graph Construction Algorithm (JS, AR), pp. 35–44.

STOC-2011-GentryW

Separating succinct non-interactive arguments from all falsifiable assumptions (CG, DW), pp. 99–108.

STOC-2011-Pass #security #standard

Limits of provable security from standard assumptions (RP), pp. 109–118.

ICALP-v1-2011-ChaillouxKR #complexity #quantum

Quantum Commitments from Complexity Assumptions (AC, IK, BR), pp. 73–85.

FM-2011-ZhangSPLD #on the #reduction

On Combining State Space Reductions with Global Fairness Assumptions (SJZ, JS, JP, YL, JSD), pp. 432–447.

CASE-2010-AllenT #consistency #detection #fault #industrial #nondeterminism

Event-based fault detection of manufacturing cell: Data inconsistencies between academic assumptions and industry practice (LVA, DMT), pp. 426–432.

CASE-2010-BeringV #automation #framework #quality #statistics

A Quality Framework to check the applicability of engineering and statistical assumptions for automated gauges (TPKB, SCV), pp. 319–325.

STOC-2010-Ajtai

Oblivious RAMs without cryptogrpahic assumptions (MA), pp. 181–190.

STOC-2010-ApplebaumBW #encryption

Public-key cryptography from different assumptions (BA, BB, AW), pp. 171–180.

LATA-2010-Lin #calculus #complexity

Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness (ZL0), pp. 414–425.

ICPR-2010-BrodersenOSB10a

The Binormal Assumption on Precision-Recall Curves (KHB, CSO, KES, JMB), pp. 4263–4266.

SIGIR-2010-KanoulasDPA #modelling #robust

Score distribution models: assumptions, intuition, and robustness to score manipulation (EK, KD, VP, JAA), pp. 242–249.

SAC-2010-GehlertBKMPP #adaptation #verification

Exploiting assumption-based verification for the adaptation of service-based applications (AG, AB, RK, AM, MP, KP), pp. 2430–2437.

EDOC-2009-Vaucouleur #enterprise

Customizable and Upgradable Enterprise Systems without the Crystal Ball Assumption (SV), pp. 203–212.

DAC-2008-YuB #fault #multi #using

Multiple defect diagnosis using no assumptions on failing pattern characteristics (XY, RD(B), pp. 361–366.

REFSQ-2008-MarincicMW #embedded #requirements #verification

Classifying Assumptions Made during Requirements Verification of Embedded Systems (JM, AM, RW), pp. 141–146.

CAV-2008-PodelskiRW

Heap Assumptions on Demand (AP, AR, TW), pp. 314–327.

HIMI-IIE-2007-ZhangWE #collaboration #comprehension

Resolving Assumptions in Art-Technology Collaboration as a Means of Extending Shared Understanding (YZ, AW, EAE), pp. 204–211.

CAV-2007-GuptaMF #automation #composition #generative #verification

Automated Assumption Generation for Compositional Verification (AG, KLM, ZF), pp. 420–432.

ICPR-v3-2006-Sepp #3d #performance

Efficient Tracking in 6-DoF based on the Image-Constancy Assumption in 3-D (WS), pp. 59–62.

KR-2006-Straccia #logic programming #query #source code

Query Answering under the Any-World Assumption for Normal Logic Programs (US), pp. 329–339.

IFM-2005-BarradasB #fixpoint #semantics

A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions (HRB, DB), pp. 327–346.

SIGIR-2005-LinM #feedback #independence

Assessing the term independence assumption in blind relevance feedback (JJL, GCM), pp. 635–636.

RE-2005-DanevaW #enterprise #implementation #requirements

Requirements Engineering for Cross-organizational ERP Implementation: Undocumented Assumptions and Potential Mismatches (MD, RW), pp. 63–74.

RE-2005-MiranskyyaMDR #modelling #requirements

Modelling Assumptions and Requirements in the Context of Project Risk (AVM, NHM, MD, MR), pp. 471–472.

ICSE-2005-LagoV #architecture #modelling

Explicit assumptions enrich architectural models (PL, HvV), pp. 206–214.

CAV-2005-AlurMN #composition #learning #verification

Symbolic Compositional Verification by Learning Assumptions (RA, PM, WN), pp. 548–562.

ICLP-2005-ChristiansenD #abduction #logic programming #named #programming language #prolog

HYPROLOG: A New Logic Programming Language with Assumptions and Abduction (HC, VD), pp. 159–173.

FoSSaCS-2004-ZuninoD #calculus #encryption #process

A Note on the Perfect Encryption Assumption in a Process Calculus (RZ, PD), pp. 514–528.

IFM-2004-WangRL #csp #independence #reachability

Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption (XW, AWR, RL), pp. 247–266.

ICPR-v1-2004-MottlDK #algorithm #pattern matching #pattern recognition #problem #recognition

Pattern Recognition in Interrelated Data: The Problem, Fundamental Assumptions, Recognition Algorithms (VM, SD, AK), pp. 188–191.

RE-2004-HaleyLMN #requirements #security #trust

The Effect of Trust Assumptions on the Elaboration of Security Requirements (CBH, RCL, JDM, BN), pp. 102–111.

ICSE-2004-GiannakopoulouPC #source code #verification

Assume-Guarantee Verification of Source Code with Design-Level Assumptions (DG, CSP, JMC), pp. 211–220.

TACAS-2003-CobleighGP #composition #learning #verification

Learning Assumptions for Compositional Verification (JMC, DG, CSP), pp. 331–346.

STOC-2003-Lindell #bound

Bounded-concurrent secure two-party computation without setup assumptions (YL), pp. 683–692.

ICML-2003-RennieSTK #classification #naive bayes

Tackling the Poor Assumptions of Naive Bayes Text Classifiers (JDR, LS, JT, DRK), pp. 616–623.

ASE-2002-GiannakopoulouPB #component #generative #verification

Assumption Generation for Software Component Verification (DG, CSP, HB), pp. 3–12.

IFM-2002-BarradasB #liveness #proving #specification

Specification and Proof of Liveness Properties under Fairness Assumptions in B Event Systems (HRB, DB), pp. 360–379.

ICPR-v3-2002-MaragoudakisKF #independence #performance #segmentation

Incorporating Conditional Independence Assumption with Support Vector Machines to Enhance Handwritten Character Segmentation Performance (MM, EK, NF), pp. 911–914.

KDD-2002-ChudovaS #markov #sequence

Pattern discovery in sequences under a Markov assumption (DC, PS), pp. 153–162.

ICDAR-2001-MaragoudakisKFK #how #independence #segmentation

How Conditional Independence Assumption Affects Handwritten Character Segmentation (MM, EK, NF, GKK), pp. 246–250.

ASE-2000-KyaruziK #architecture #design #representation #towards

Towards Explicit Representation of Architectural Design Assumptions (JJK, JvK), pp. 249–252.

ICALP-2000-SantisCP #proving

Necessary and Sufficient Assumptions for Non-iterative Zero-Knowledge Proofs of Knowledge for All NP Relations (ADS, GDC, GP), pp. 451–462.

ICPR-v3-2000-Qiu

Computing Optical Flow Based on the Mass-Conserving Assumption (MQ), pp. 7041–7044.

ICSM-1999-DefamieJT #experience #reliability

Experience Paper: Software Reliability: Assumptions, Realities and Data (MD, PJ, JT), pp. 337–345.

VLDB-1997-PoosalaI #estimation #independence

Selectivity Estimation Without the Attribute Value Independence Assumption (VP, YEI), pp. 486–495.

ACIR-1997-MateevMS #dependence #how

Where the Linked Dependence Assumption Fails and How to Move Beyond It (BM, EM, PS).

ICLP-1997-DahlTL #natural language

Assumption Grammars for Processing Natural Language (VD, PT, RL), pp. 256–270.

ESOP-1996-Stolen #data flow #network

Assumption/Commitment Rules for Dataflow Networks — With an Emphasis on Completeness (KS), pp. 356–372.

SIGMOD-1995-BettiniWBJ #database #evaluation #query #semantics

Semantic Assumptions and Query Evaluation in Temporal Databases (CB, XSW, EB, SJ), pp. 257–268.

CAV-1995-DingelF #abstraction #infinity #model checking #proving #reasoning #theorem proving #using

Model Checking for Infinite State Systems Using Data Abstraction, Assumption-Commitment Style reasoning and Theorem Proving (JD, TF), pp. 54–69.

CAV-1995-EmersonS #approach #model checking #symmetry

Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach (EAE, APS), pp. 309–324.

ILPS-1995-TarauDF #backtracking #continuation #linear

Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator Grammars (PT, VD, AF), p. 642.

RE-1993-JohnsonGLFP #requirements

Recording requirements assumptions and rationale (LJ, SJG, JL, GF, CP), pp. 282–285.

ILPS-1993-Aparicio #semantics #set

Assumption Set Semantics (JNA), p. 639.

DAC-1991-BeerelM #testing

Testability of Asynchronous Timed Control Circuits with Delay Assumptions (PAB, THYM), pp. 446–451.

KR-1991-RodiP #using

A Nonmonotonic Assumption-Based TMS Using Stable Bases (WLR, SGP), pp. 485–495.

ICLP-1991-Inoue #logic programming #source code

Extended Logic Programs with Default Assumptions (KI), pp. 490–504.

ISLP-1991-PereiraAA #reasoning

Counterfactual Reasoning Based on Revising Assumptions (LMP, JNA, JJA), pp. 566–577.

STOC-1990-Hastad #generative #pseudo

Pseudo-Random Generators under Uniform Assumptions (JH), pp. 395–404.

SEKE-1990-SaveantC #metalanguage #problem #representation

A Metalanguage for Representation and Control in Assumption-based Problem Solvers (PS, PC), pp. 159–164.

KR-1989-Hirst #information management #ontology #representation

Ontological Assumptions in Knowledge Representation (GH), pp. 157–169.

KR-1989-Lozinskii

Plausible World Assumption (ELL), pp. 266–275.

STOC-1988-Ben-OrGKW #how #interactive #multi #proving

Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions (MBO, SG, JK, AW), pp. 113–131.

ICALP-1987-Josko #liveness #model checking

Modelchecking of CTL Formulae under Liveness Assumptions (BJ), pp. 280–289.

HCI-SES-1987-Litewka #concept #human-computer #interactive #research

Questionable Assumptions and Misconceptions in Ergonomic Research on Human-Computer Interaction: A Discussion (JL), pp. 337–344.

PODS-1986-BiskupBSK

One Flavor Assumption and Gamma-Acyclicity for Universal Relation Views (JB, HHB, LS, MK), pp. 148–159.

PODS-1985-SteinM

Relaxing the Universal Relation Scheme Assumption (JS, DM), pp. 76–84.

PODS-1984-ImielinskiS #database #on the

On Lossless Transformation of Database Schemes not Necessarily Satisfying Universal Instance Assumption (TI, NS), pp. 258–265.

PODS-1982-AtzeniP #database #relational

Assumptions in Relational Database Theory (PA, DSPJ), pp. 1–9.

CADE-1982-Minker #database #on the

On Indefinite Databases and the Closed World Assumption (JM), pp. 292–308.

SIGMOD-1981-Sagiv #question #using

Can We Use the Universal Instance Assumption Without Using Nulls? (YS), pp. 108–120.