275 papers:
- SIGMOD-2015-JoglekarGPR #correlation #evaluation
- Exploiting Correlations for Expensive Predicate Evaluation (MJ, HGM, AGP, CR), pp. 1183–1198.
- ESOP-2015-TerauchiU #approach #refinement
- Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement (TT, HU), pp. 610–633.
- LATA-2015-UlyantsevZS #automaton #identification #symmetry
- BFS-Based Symmetry Breaking Predicates for DFA Identification (VU, IZ, AS), pp. 611–622.
- SAC-2015-JakobsW #analysis #data flow #proving #source code
- Programs from proofs of predicated dataflow analyses (MCJ, HW), pp. 1729–1736.
- PPoPP-2015-ArbelM #concurrent #scalability
- Predicate RCU: an RCU for scalable concurrent updates (MA, AM), pp. 21–30.
- CADE-2015-Passmore #algebra #decidability #integer
- Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers (GOP), pp. 181–196.
- CAV-2015-KuwaharaSU0 #abstraction #functional #higher-order #source code #termination
- Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs (TK, RS, HU, NK), pp. 287–303.
- CSL-2015-Paperman #first-order #logic
- Finite-Degree Predicates and Two-Variable First-Order Logic (CP), pp. 616–630.
- VMCAI-2015-PrabhakarS #abstraction #analysis #hybrid
- Foundations of Quantitative Predicate Abstraction for Stability Analysis of Hybrid Systems (PP, MGS), pp. 318–335.
- ESOP-2014-SvendsenB #concurrent
- Impredicative Concurrent Abstract Predicates (KS, LB), pp. 149–168.
- FoSSaCS-2014-AntonopoulosGHKO #induction #logic #problem
- Foundations for Decision Problems in Separation Logic with General Inductive Predicates (TA, NG, CH, MIK, JO), pp. 411–425.
- TACAS-2014-CimattiGMT #abstraction #modulo theories
- IC3 Modulo Theories via Implicit Predicate Abstraction (AC, AG, SM, ST), pp. 46–61.
- TACAS-2014-LoweMW #analysis #contest
- CPAchecker with Sequential Combination of Explicit-Value Analyses and Predicate Analyses — (Competition Contribution) (SL, MUM, PW), pp. 392–394.
- ICALP-v1-2014-KhotTW #approximate #complexity
- The Complexity of Somewhat Approximation Resistant Predicates (SK, MT, PW), pp. 689–700.
- FM-2014-PonzioRAF #bound #performance
- Efficient Tight Field Bounds Computation Based on Shape Predicates (PP, NR, NA, MFF), pp. 531–546.
- ICGT-2014-JansenGN #execution #generative #induction #pointer #source code #symbolic computation
- Generating Inductive Predicates for Symbolic Execution of Pointer-Manipulating Programs (CJ, FG, TN), pp. 65–80.
- QAPL-2014-LatellaLMS #communication
- Stochastically timed predicate-based communication primitives for autonomic computing (DL, ML, MM, VS), pp. 1–16.
- IJCAR-2014-HorbachS #axiom #locality #reachability
- Locality Transfer: From Constrained Axiomatizations to Reachability Predicates (MH, VSS), pp. 192–207.
- ISSTA-2014-ZuoKS #debugging #mining #performance
- Efficient predicated bug signature mining via hierarchical instrumentation (ZZ, SCK, CS), pp. 215–224.
- LICS-CSL-2014-BrotherstonFPG #induction #logic #satisfiability
- A decision procedure for satisfiability in separation logic with inductive predicates (JB, CF, JANP, NG), p. 10.
- RTA-TLCA-2014-BaeM #abstraction
- Predicate Abstraction of Rewrite Theories (KB, JM), pp. 61–76.
- DATE-2013-HanCL #compilation
- Compiling control-intensive loops for CGRAs with state-based full predication (KH, KC, JL), pp. 1579–1582.
- FoSSaCS-2013-Staton #algebra #logic
- An Algebraic Presentation of Predicate Logic — (Extended Abstract) (SS), pp. 401–417.
- TACAS-2013-Wendler #analysis #contest
- CPAchecker with Sequential Combination of Explicit-State Analysis and Predicate Analysis — (Competition Contribution) (PW), pp. 613–615.
- PLDI-2013-HungG #monitoring #named
- AutoSynch: an automatic-signal monitor based on predicate tagging (WLH, VKG), pp. 253–262.
- SAS-2013-DanMVY #abstraction #memory management #modelling
- Predicate Abstraction for Relaxed Memory Models (AMD, YM, MTV, EY), pp. 84–104.
- STOC-2013-Huang #approximate #satisfiability
- Approximation resistance on satisfiable instances for predicates with few accepting inputs (SH), pp. 457–466.
- DHM-SET-2013-YangYF #safety #using
- Predicating the Safety of Airport Approaches Using a Cognitive Pilot Model (CY, TY, SF), pp. 126–133.
- SEKE-2013-ZhangLK #debugging #on the #statistics
- On the Use of Bug and Predicate Signatures for Statistical Debugging (YZ, EL, BK), pp. 249–299.
- 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.
- ESEC-FSE-2013-SunK #debugging #mining
- Mining succinct predicated bug signatures (CS, SCK), pp. 576–586.
- CADE-2013-Comon-LundhCS #deduction
- Tractable Inference Systems: An Extension with a Deducibility Predicate (HCL, VC, GS), pp. 91–108.
- CAV-2013-Marques-SilvaJB #set
- Minimal Sets over Monotone Predicates in Boolean Formulae (JMS, MJ, AB), pp. 592–607.
- DAC-2012-UrdahlSWK #abstraction #composition #concurrent #verification
- System verification of concurrent RTL modules by compositional path predicate abstraction (JU, DS, MW, WK), pp. 334–343.
- DATE-2012-HanPC #architecture #configuration management #power management
- State-based full predication for low power coarse-grained reconfigurable architecture (KH, SP, KC), pp. 1367–1372.
- VLDB-2012-AlyAO #query
- Spatial Queries with Two kNN Predicates (AMA, WGA, MO), pp. 1100–1111.
- TACAS-2012-LoweW #analysis #contest
- CPAchecker with Adjustable Predicate Analysis — (Competition Contribution) (SL, PW), pp. 528–530.
- TACAS-2012-ShvedMM #analysis #contest
- Predicate Analysis with BLAST 2.7 — (Competition Contribution) (PS, MUM, VSM), pp. 525–527.
- SAS-2012-AbdullaACLR #abstraction #automation #integer #source code
- Automatic Fence Insertion in Integer Programs via Predicate Abstraction (PAA, MFA, YFC, CL, AR), pp. 164–180.
- ICALP-v2-2012-LitakPSS #algebra #logic
- Coalgebraic Predicate Logic (TL, DP, KS, LS), pp. 299–311.
- KDIR-2012-Delmonte #dependence #information management #null
- Predicate Argument Structures for Information Extraction from Dependency Representations — Null Elements are Missing (RD), pp. 463–474.
- OOPSLA-2012-ParizekL #abstraction #java #source code
- Predicate abstraction of Java programs with collections (PP, OL), pp. 75–94.
- SAC-2012-KaneiwaN #knowledge base #ontology
- Sorted hyper-predicate knowledge bases for ontologies and rules (KK, PHPN), pp. 312–319.
- ICSE-2012-GoreR #bias #debugging #metric #statistics
- Reducing confounding bias in predicate-level statistical debugging metrics (RG, PFRJ), pp. 463–473.
- ASE-2011-GoreRK #debugging #statistics
- Statistical debugging with elastic predicates (RG, PFRJ, DK), pp. 492–495.
- TACAS-2011-JungLWY #generative #invariant #quantifier
- Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference (YJ, WL, BYW, KY), pp. 205–219.
- TACAS-2011-PodelskiR #abstraction #invariant #termination
- Transition Invariants and Transition Predicate Abstraction for Program Termination (AP, AR), pp. 3–10.
- PLDI-2011-KobayashiSU #abstraction #higher-order #model checking
- Predicate abstraction and CEGAR for higher-order model checking (NK, RS, HU), pp. 222–233.
- ICALP-v2-2011-AndersonMSS #first-order #invariant #locality #logic #query
- Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates (MA, DvM, NS, LS), pp. 368–379.
- IFM-J-2009-Weiss11 #abstraction #calculus #logic
- Predicate abstraction in a program logic calculus (BW), pp. 861–876.
- KEOD-2011-TakeuchiTMMS #ambiguity #evaluation
- Verb Sense Disambiguation based on Thesaurus of Predicate-argument Structure — An Evaluation of Thesaurus of Predicate-argument Structure for Japanese Verbs (KT, ST, MM, YM, KS), pp. 208–213.
- LOPSTR-2011-Moura #semantics
- Meta-predicate Semantics (PM), pp. 155–172.
- POPL-2011-CookK
- Making prophecies with decision predicates (BC, EK), pp. 399–410.
- POPL-2011-GuptaPR #abstraction #concurrent #multi #refinement #source code #thread #verification
- Predicate abstraction and refinement for verifying multi-threaded programs (AG, CP, AR), pp. 331–344.
- CADE-2011-Horbach #horn clause #set
- Predicate Completion for non-Horn Clause Sets (MH), pp. 315–330.
- CAV-2011-ChinGVLCQ #calculus #verification
- A Specialization Calculus for Pruning Disjunctive Predicates to Support Verification (WNC, CG, RV, QLL, FC, SQ), pp. 293–309.
- CAV-2011-DonaldsonKKW #abstraction #concurrent #source code #symmetry
- Symmetry-Aware Predicate Abstraction for Shared-Variable Concurrent Programs (AFD, AK, DK, TW), pp. 356–371.
- CAV-2011-SharmaDDA #generative #invariant #using
- Simplifying Loop Invariant Generation Using Splitter Predicates (RS, ID, TD, AA), pp. 703–719.
- CSL-2011-Aschieri #analysis
- Transfinite Update Procedures for Predicative Systems of Analysis (FA), pp. 20–34.
- LICS-2011-BarrasJSW #decidability #first-order #higher-order #named #type system
- CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory (BB, JPJ, PYS, QW), pp. 143–151.
- TLCA-2011-RoweB #approximate #object-oriented #programming #semantics
- Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming — (Extended Abstract) (RNSR, SvB), pp. 229–244.
- DATE-2010-CimattiFGKR #abstraction #integration #smt
- Tighter integration of BDDs and SMT for Predicate Abstraction (AC, AF, AG, KK, MR), pp. 1707–1712.
- WRLA-2010-AsavoaeA #abstraction #framework #semantics #𝕂
- Collecting Semantics under Predicate Abstraction in the 𝕂 Framework (IMA, MA), pp. 123–139.
- ICALP-v2-2010-FontaineLV #algebra #approach #automaton #using
- Automata for Coalgebras: An Approach Using Predicate Liftings (GF, RAL, YV), pp. 381–392.
- ICPR-2010-LiP10a #analysis #classification #monitoring #realtime
- Human State Classification and Predication for Critical Care Monitoring by Real-Time Bio-signal Analysis (XL, FP), pp. 2460–2463.
- KR-2010-BaaderBLW #logic #query
- Query and Predicate Emptiness in Description Logics (FB, MB, CL, FW).
- ECOOP-2010-Dinsdale-YoungDGPV #concurrent
- Concurrent Abstract Predicates (TDY, MD, PG, MJP, VV), pp. 504–528.
- OOPSLA-2010-ChibaIZ #compilation #composition
- Mostly modular compilation of crosscutting concerns by contextual predicate dispatch (SC, AI, SZ), pp. 539–554.
- OOPSLA-2010-QuillienW #agile
- Rubber ducks, nightmares, and unsaturated predicates: proto-scientific schemata are good for agile (JQ, DW), pp. 901–917.
- PPDP-2010-LiangK #datalog #statistics
- Deriving predicate statistics in datalog (SL, MK), pp. 45–56.
- QAPL-2010-NdukwuMc #abstraction #approach #independence #probability #source code
- An expectation transformer approach to predicate abstraction and data independence for probabilistic programs (UN, AM), pp. 129–143.
- CC-2010-Hoflehner
- Strategies for Predicate-Aware Register Allocation (GH), pp. 185–204.
- TAP-2010-Blanchette #algebra #analysis #data type #induction #recursion #relational
- Relational Analysis of (Co)inductive Predicates, (Co)algebraic Datatypes, and (Co)recursive Functions (JCB), pp. 117–134.
- VMCAI-2010-JungKWY #abstraction #algorithm #invariant #learning
- Deriving Invariants by Algorithmic Learning, Decision Procedures, and Predicate Abstraction (YJ, SK, BYW, KY), pp. 180–196.
- TACAS-2009-BakewellG #abstraction #composition #game studies #semantics
- Compositional Predicate Abstraction from Game Semantics (AB, DRG), pp. 62–76.
- PLDI-2009-SrivastavaG #abstraction #using #verification
- Program verification using templates over predicate abstraction (SS, SG), pp. 223–234.
- IFM-2009-Weiss #abstraction #calculus #logic
- Predicate Abstraction in a Program Logic Calculus (BW), pp. 136–150.
- AdaEurope-2009-MarrefB #analysis #worst-case
- Predicated Worst-Case Execution-Time Analysis (AM, GB), pp. 134–148.
- PADL-2009-Moura #implementation
- Secure Implementation of Meta-predicates (PM), pp. 269–283.
- SAC-2009-Manine #information management #learning #multi #ontology
- Learning the ontological theory of an information extraction system in the multi-predicate ILP setting (APM), pp. 1578–1582.
- HPCA-2009-StephensonZR #lightweight #order
- Lightweight predication support for out of order processors (MS, LZ, RR), pp. 201–212.
- CADE-2009-LahiriQ #abstraction #algorithm #complexity
- Complexity and Algorithms for Monomial and Clausal Predicate Abstraction (SKL, SQ), pp. 214–229.
- ICLP-2009-Rosa #detection #distributed #programming
- Locally Distributed Predicates: A Programming Facility for Distributed State Detection (MD), pp. 557–558.
- VMCAI-2009-GulwaniSV #abstraction #constraints #invariant
- Constraint-Based Invariant Inference over Predicate Abstraction (SG, SS, RV), pp. 120–135.
- DATE-2008-HohenauerELAMBS #execution #optimisation
- Retargetable Code Optimization for Predicated Execution (MH, FE, RL, GA, HM, GB, BS), pp. 1492–1497.
- PODS-2008-Koch #approximate #database #probability #query
- Approximating predicates and expressive queries on probabilistic databases (CK), pp. 99–108.
- VLDB-2008-JohnsonRSS #evaluation #parallel
- Row-wise parallel predicate evaluation (RJ, VR, RS, GS), pp. 622–634.
- ESOP-2008-Allamigeon #abstraction #array
- Non-disjunctive Numerical Domain for Array Predicate Abstraction (XA), pp. 163–177.
- ICALP-C-2008-ShiW #encryption
- Delegating Capabilities in Predicate Encryption Systems (ES, BW), pp. 560–578.
- QAPL-2008-KattenbeltKNP #abstraction #game studies #probability
- Game-Based Probabilistic Predicate Abstraction in PRISM (MK, MZK, GN, DP), pp. 5–21.
- ASPLOS-2008-JoaoMKAP #object-oriented #performance
- Improving the performance of object-oriented languages with dynamic predication of indirect jumps (JAJ, OM, HK, RA, YNP), pp. 80–90.
- ISSTA-2008-SankaranarayananCIG #learning
- Dynamic inference of likely data preconditions over predicates by tree learning (SS, SC, FI, AG), pp. 295–306.
- ASE-2007-BlancGK #abstraction #c++ #verification
- Verifying C++ with STL containers via predicate abstraction (NB, AG, DK), pp. 521–524.
- DATE-2007-KroeningS #image #interactive #proving #refinement #using #word
- Interactive presentation: Image computation and predicate refinement for RTL verilog using word level proofs (DK, NS), pp. 1325–1330.
- SIGMOD-2007-ChandelHKSS #approximate #benchmark #declarative #metric
- Benchmarking declarative approximate selection predicates (AC, OH, NK, MS, DS), pp. 353–364.
- SIGMOD-2007-LazaridisM #multi #optimisation
- Optimization of multi-version expensive predicates (IL, SM), pp. 797–808.
- VLDB-2007-ShenDNR #datalog #declarative #embedded #information management #using
- Declarative Information Extraction Using Datalog with Embedded Extraction Predicates (WS, AD, JFN, RR), pp. 1033–1044.
- ESOP-2007-NanevskiAMB #data type #hoare #type system
- Abstract Predicates and Mutable ADTs in Hoare Type Theory (AN, AA, GM, LB), pp. 189–204.
- TACAS-2007-ChatterjeeLQR #bytecode #low level #reachability
- A Reachability Predicate for Analyzing Low-Level Software (SC, SKL, SQ, ZR), pp. 19–33.
- PLDI-2007-RamanathanGJ #mining #specification #using
- Static specification inference using predicate mining (MKR, AG, SJ), pp. 123–134.
- SEFM-2007-Bayley #design pattern #formal method #logic
- Formalising Design Patterns in Predicate Logic (IB), pp. 25–36.
- CIKM-2007-GarakaniIHH #named #novel #query #xml
- Ntjfsatnot: a novel method for query with not-predicates on xml data (VG, SKI, MH, MH), pp. 885–888.
- ICML-2007-KokD #statistics
- Statistical predicate invention (SK, PMD), pp. 433–440.
- CGO-2007-KimJMP #compilation
- Profile-assisted Compiler Support for Dynamic Predication in Diverge-Merge Processors (HK, JAJ, OM, YNP), pp. 367–378.
- HPCA-2007-QuinonesPG #branch #execution #predict
- Improving Branch Prediction and Predicated Execution in Out-of-Order Processors (EQ, JMP, AG), pp. 75–84.
- ISSTA-2007-NainarCRL #debugging #statistics #using
- Statistical debugging using compound boolean predicates (PAN, TC, JR, BL), pp. 5–15.
- TLCA-2007-Marion #analysis
- Predicative Analysis of Feasibility and Diagonalization (JYM), pp. 290–304.
- DAC-2006-WangGG #deduction #difference #learning #logic
- Predicate learning and selective theory deduction for a difference logic solver (CW, AG, MKG), pp. 235–240.
- SIGMOD-2006-Amer-YahiaCD #flexibility #performance #xml
- Flexible and efficient XML search with complex full-text predicates (SAY, EC, AD), pp. 575–586.
- TACAS-2006-JhalaM #approach #refinement
- A Practical and Complete Approach to Predicate Refinement (RJ, KLM), pp. 459–473.
- TACAS-2006-KroeningS #approximate #image #logic
- Approximating Predicate Images for Bit-Vector Logic (DK, NS), pp. 242–256.
- SAS-2006-Schmidt #approximate
- Underapproximating Predicate Transformers (DAS), pp. 127–143.
- CIKM-2006-KuntschkeK #data type #evaluation
- Matching and evaluation of disjunctive predicates for data stream sharing (RK, AK), pp. 832–833.
- PADL-2006-SoaresRF #prolog
- Generic Cut Actions for External Prolog Predicates (TS, RR, MF), pp. 16–30.
- ICSE-2006-ZhangGG #automation #fault
- Locating faults through automated predicate switching (XZ, NG, RG), pp. 272–281.
- CAV-2006-JainIGSW #abstraction #invariant #refinement #using
- Using Statically Computed Invariants Inside the Predicate Abstraction and Refinement Loop (HJ, FI, AG, IS, CW), pp. 137–151.
- CAV-2006-KroeningW #abstraction
- Counterexamples with Loops for Predicate Abstraction (DK, GW), pp. 152–165.
- CAV-2006-LahiriNO #abstraction #performance #smt
- SMT Techniques for Fast Predicate Abstraction (SKL, RN, AO), pp. 424–437.
- CSL-2006-RabinovichT #decidability
- Decidable Theories of the Ordering of Natural Numbers with Unary Predicates (AMR, WT), pp. 562–574.
- ICLP-2006-GuoLJ #optimisation
- Relaxation on Optimization Predicates (HFG, ML, BJ), pp. 425–426.
- ICLP-2006-WittocxVMDB #semantics
- Predicate Introduction Under Stable and Well-Founded Semantics (JW, JV, MM, MD, MB), pp. 242–256.
- LICS-2006-ChaubardPS #composition #first-order
- First Order Formulas with Modular Predicates (LC, JÉP, HS), pp. 211–220.
- VMCAI-2006-BinghamR #abstraction #logic #source code
- A Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs (JDB, ZR), pp. 207–221.
- VMCAI-2006-JaffarSV #abstraction #composition
- A CLP Method for Compositional and Intermittent Predicate Abstraction (JJ, AES, RV), pp. 17–32.
- ASE-2005-KashyapG #detection #performance #reachability
- Exploiting predicate structure for efficient reachability detection (SK, VKG), pp. 4–13.
- DAC-2005-JainKSC #abstraction #refinement #verification #word
- Word level predicate abstraction and refinement for verifying RTL verilog (HJ, DK, NS, EMC), pp. 445–450.
- DAC-2005-ParthasarathyICB #learning
- Structural search for RTL with predicate learning (GP, MKI, KTC, FB), pp. 451–456.
- SIGMOD-2005-DennyF #query
- Predicate Result Range Caching for Continuous Queries (MD, MJF), pp. 646–657.
- VLDB-2005-JinL #estimation #fuzzy #scalability #set #string
- Selectivity Estimation for Fuzzy String Predicates in Large Data Sets (LJ, CL), pp. 397–408.
- VLDB-2005-MarklMKTHS
- Consistently Estimating the Selectivity of Conjuncts of Predicates (VM, NM, MK, TMT, PJH, US), pp. 373–384.
- TACAS-2005-ClarkeKSY #abstraction #named #satisfiability
- SATABS: SAT-Based Predicate Abstraction for ANSI-C (EMC, DK, NS, KY), pp. 570–574.
- TACAS-2005-JainIGG #abstraction #locality
- Localization and Register Sharing for Predicate Abstraction (HJ, FI, AG, MKG), pp. 397–412.
- SEKE-2005-DingXDCH #design #mobile #modelling
- Design an Interoperable Mobile Agent System Based on Predicate Transition Net Models (JD, DX, YD, PJC, XH), pp. 560–565.
- LOPSTR-2005-AlbertPG #logic programming #partial evaluation #source code
- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates (EA, GP, JPG), pp. 115–132.
- POPL-2005-PodelskiR #abstraction #termination
- Transition predicate abstraction and fair termination (AP, AR), pp. 132–144.
- SAC-2005-PaulyS #identification
- Identifying topological predicates for vague spatial objects (AP, MS), pp. 587–591.
- ESEC-FSE-2005-FischerJM #data flow
- Joining dataflow with predicates (JF, RJ, RM), pp. 227–236.
- SOSP-2005-JoshiKDC #detection
- Detecting past and present intrusions through vulnerability-specific predicates (AJ, STK, GWD, PMC), pp. 91–104.
- CAV-2005-LahiriBC #abstraction
- Predicate Abstraction via Symbolic Decision Procedures (SKL, TB, BC), pp. 24–38.
- CSL-2005-Katsumata #logic #metalanguage #semantics
- A Semantic Formulation of TT-Lifting and Logical Predicates for Computational Metalanguage (SyK), pp. 87–102.
- CSL-2005-Slissenko #algorithm #logic #verification
- Verification in Predicate Logic with Time: Algorithmic Questions (AS), pp. 3–17.
- VMCAI-2005-BalabanPZ #abstraction #analysis
- Shape Analysis by Predicate Abstraction (IB, AP, LDZ), pp. 164–180.
- VMCAI-2005-ManevichYRS #abstraction #canonical
- Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists (RM, EY, GR, SS), pp. 181–198.
- SIGMOD-2004-JiangLW #performance #query
- Efficient Processing of Twig Queries with OR-Predicates (HJ, HL, WW), pp. 59–70.
- SIGMOD-2004-Sarawagi #performance #set #similarity
- Efficient set joins on similarity predicates (SS, AK), pp. 743–754.
- TACAS-2004-BallCDR #abstraction #approximate
- Refining Approximations in Software Predicate Abstraction (TB, BC, SD, SKR), pp. 388–403.
- ICALP-2004-Katsumata
- A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems (SyK), pp. 831–845.
- KR-2004-EiterFFPW #bound #complexity #model checking #programming #set
- Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming (TE, WF, MF, GP, SW), pp. 377–387.
- OOPSLA-2004-Millstein
- Practical predicate dispatch (TDM), pp. 345–364.
- SAC-2004-WuCY #performance
- VCR indexing for fast event matching for highly-overlapping range predicates (KLW, SKC, PSY), pp. 740–747.
- ASPLOS-2004-RabbahSEW #compilation
- Compiler orchestrated prefetching via speculation and predication (RMR, HS, ME, WFW), pp. 189–198.
- CC-2004-CaiGX
- Region-Based Partial Dead Code Elimination on Predicated Code (QC, LG, JX), pp. 150–166.
- CGO-2004-SmelyanskiyMD #probability #scheduling
- Probabilistic Predicate-Aware Modulo Scheduling (MS, SAM, ESD), pp. 151–162.
- CAV-2004-BallCLZ #abstraction #automation #named #proving #refinement #theorem proving
- Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement (TB, BC, SKL, LZ), pp. 457–461.
- CAV-2004-LahiriB #bound #verification
- Indexed Predicate Discovery for Unbounded System Verification (SKL, REB), pp. 135–147.
- CSL-2004-Hyvernat #linear #logic
- Predicate Transformers and Linear Logic: Yet Another Denotational Model (PH), pp. 115–129.
- VMCAI-2004-LahiriB #abstraction #invariant #quantifier
- Constructing Quantified Invariants via Predicate Abstraction (SKL, REB), pp. 267–281.
- DATE-2003-PillaiJ #clustering #scheduling
- Compiler-Directed ILP Extraction for Clustered VLIW/EPIC Machines: Predication, Speculation and Modulo Scheduling (SP, MFJ), pp. 10422–10427.
- SIGMOD-2003-ChaudhuriGS #query
- Factorizing Complex Predicates in Queries to Exploit Indexes (SC, PG, SS), pp. 361–372.
- SIGMOD-2003-GuptaS #query #xpath
- Stream Processing of XPath Queries with Predicates (AKG, DS), pp. 419–430.
- TACAS-2003-AlurDI #abstraction #hybrid
- Counter-Example Guided Predicate Abstraction of Hybrid Systems (RA, TD, FI), pp. 208–223.
- SEKE-2003-DongFH #diagrams #statechart
- Deriving Hierarchical Predicate/Transition Nets from Statechart Diagrams (ZD, YF, XH), pp. 150–157.
- LOPSTR-2003-AlexandreBD #induction #proving #synthesis
- Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures (FA, KB, MD), pp. 20–33.
- ICSE-2003-BinkleyH #dependence #empirical #roadmap
- An Empirical Study of Predicate Dependence Levels and Trends (DB, MH), pp. 330–340.
- CGO-2003-ChuangCF
- Phi-Predication for Light-Weight If-Conversion (WC, BC, JF), pp. 179–192.
- CGO-2003-SmelyanskiyMDL #constraints #scheduling
- Predicate-Aware Scheduling: A Technique for Reducing Resource Constraints (MS, SAM, ESD, HHSL), pp. 169–178.
- HPCA-2003-SimonCF #branch #predict
- Incorporating Predicate Information into Branch Predictors (BS, BC, JF), pp. 53–64.
- CAV-2003-ClarkeGTW #abstraction #how #performance
- Making Predicate Abstraction Efficient: How to Eliminate Redundant Predicates (EMC, OG, MT, DW), pp. 126–140.
- CAV-2003-LahiriBC #abstraction #approach
- A Symbolic Approach to Predicate Abstraction (SKL, REB, BC), pp. 141–153.
- FATES-2003-SenG #on the
- On Checking Whether a Predicate Definitely Holds (AS, VKG), pp. 15–29.
- ICLP-2003-FarreTU
- Handling Existential Derived Predicates in View Updating (CF, ET, TU), pp. 148–162.
- ICLP-2003-GuoG
- A New Mode Declaration for Tabled Predicates (HFG, GG), pp. 485–486.
- SAT-2003-ClarkeTVW #abstraction #hardware #satisfiability #verification
- SAT Based Predicate Abstraction for Hardware Verification (EMC, MT, HV, DW), pp. 78–92.
- VMCAI-2003-DamsN #abstraction #analysis #model checking
- Shape Analysis through Predicate Abstraction and Model Checking (DD, KSN), pp. 310–324.
- SIGMOD-2002-ChangH #query
- Minimal probing: supporting expensive predicates for top-k queries (KCCC, SwH), pp. 346–357.
- SCAM-2002-RillingLG #message passing #slicing #source code
- Predicate-Based Dynamic Slicing of Message Passing Programs (JR, HFL, DG), p. 133–?.
- PLDI-2002-Gargi #algorithm
- A Sparse Algorithm for Predicated Global Value Numbering (KG), pp. 45–56.
- ICEIS-2002-ChouT
- Predicate-Based Caching Scheme for Wireless Environments (PLC, ZT), pp. 57–64.
- SEKE-2002-XuVIY #behaviour #modelling #multi #using #verification
- Modeling and verifying multi-agent behaviors using predicate/transition nets (DX, RAV, TRI, JY), pp. 193–200.
- POPL-2002-FlanaganQ #abstraction #verification
- Predicate abstraction for software verification (CF, SQ), pp. 191–202.
- ISSTA-2002-BoyapatiKM #automation #java #named #testing
- Korat: automated testing based on Java predicates (CB, SK, DM), pp. 123–133.
- DAC-2001-JacomeVP #architecture #clustering
- Clustered VLIW Architectures with Predicated Switching (MFJ, GdV, SP), pp. 696–701.
- PODS-2001-CaiCKN #complexity #on the
- On the Complexity of Join Predicates (JyC, VTC, RK, JFN).
- PODS-2001-ZhangMTGS #performance
- Efficient Computation of Temporal Aggregates with Range Predicates (DZ, AM, VJT, DG, BS).
- PLDI-2001-BallMMR #abstraction #automation #c #source code
- Automatic Predicate Abstraction of C Programs (TB, RM, TDM, SKR), pp. 203–213.
- ICFP-2001-NanevskiBH #automation #generative #geometry #staged
- Automatic Generation of Staged Geometric Predicates (AN, GEB, RH), pp. 217–228.
- HPCA-2001-WangWKRS #execution #scheduling
- Register Renaming and Scheduling for Dynamic Execution of Predicated Code (PHW, HW, RMK, KR, JPS), pp. 15–25.
- SAT-2001-Shlyakhter #effectiveness #generative #problem #symmetry
- Generating effective symmetry-breaking predicates for search problems (IS), pp. 19–35.
- FoSSaCS-2000-Treinen #automaton #logic #testing
- Predicate Logic and Tree Automata with Tests (RT), pp. 329–343.
- SAS-2000-KnoopCJ
- Partial Redundancy Elimination on Predicated Code (JK, JFC, RDCJ), pp. 260–279.
- IFM-2000-CansellMM #diagrams #verification
- Predicate Diagrams for the Verification of Reactive Systems (DC, DM, SM), pp. 380–397.
- ICPR-v3-2000-MaenpaaPO #classification #multi
- Texture Classification by Multi-Predicate Local Binary Pattern Operators (TM, MP, TO), pp. 3951–3954.
- CL-2000-ArenasBK #calculus #consistency #database #query
- Applications of Annotated Predicate Calculus to Querying Inconsistent Databases (MA, LEB, MK), pp. 926–941.
- CSL-2000-Yavorsky #logic #on the #proving #standard
- On the Logic of the Standard Proof Predicate (REY), pp. 527–541.
- OOPSLA-1999-ChambersC #multi #performance
- Efficient Multiple and Predicated Dispatching (CC, WC), pp. 238–255.
- PPoPP-1999-MoonH #analysis #array #automation #data flow #evaluation #parallel
- Evaluation of Predicated Array Data-Flow Analysis for Automatic Parallelization (SM, MWH), pp. 84–95.
- CAV-1999-DasDP #abstraction #experience
- Experience with Predicate Abstraction (SD, DLD, SP), pp. 160–171.
- LICS-1999-Pym #logic #on the
- On Bunched Predicate Logic (DJP), pp. 183–192.
- TLCA-1999-Hasegawa #linear #logic
- Logical Predicates for Intuitionistic Linear Type Theories (MH), pp. 198–212.
- ASE-1998-LeePL #detection
- Detection of Exclusive OR Global Predicates (EL, CP, DL), pp. 213–216.
- PODS-1998-KolaitisMT #complexity #on the #problem #query
- On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates (PGK, DLM, MNT), pp. 197–204.
- VLDB-1998-ShivakumarGC #approximate
- Filtering with Approximate Predicates (NS, HGM, CC), pp. 263–274.
- ECOOP-1998-ErnstKC #formal method
- Predicate Dispatching: A Unified Theory of Dispatch (MDE, CSK, CC), pp. 186–211.
- ISSTA-1998-BultanGL #approach #constraints #integer #verification
- Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach (TB, RG, CL), pp. 113–123.
- VLDB-1997-HelmerM #algorithm #comparison #evaluation #in memory #memory management #set
- Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates (SH, GM), pp. 386–395.
- EDOC-1997-Hull #transaction
- Global Predicate-Based Locks in Long-Running Transactions (RH), p. 197–?.
- ECOOP-1997-BenzakenS #constraints #database #object-oriented #programming language
- Static Integrity Constraint Management in Object-Oriented Database Programming Languages via Predicate Transformers (VB, XS), pp. 60–84.
- CADE-1997-RousselM #calculus #compilation
- Exact Kanowledge Compilation in Predicate Calculus: The Partial Achievement Case (OR, PM), pp. 161–175.
- SIGMOD-1996-PoosalaIHS #estimation
- Improved Histograms for Selectivity Estimation of Range Predicates (VP, YEI, PJH, EJS), pp. 294–305.
- VLDB-1996-ChaudhuriS #optimisation #query
- Optimization of Queries with User-defined Predicates (SC, KS), pp. 87–98.
- KR-1996-CrawfordGLR #problem #symmetry
- Symmetry-Breaking Predicates for Search Problems (JMC, MLG, EML, AR), pp. 148–159.
- CADE-1996-Ohlbach #named #quantifier
- SCAN — Elimination of Predicate Quantifiers (HJO), pp. 161–165.
- CSL-1996-Geuvers #dependent type #higher-order #logic #modelling #type system
- Extending Models of Second Order Predicate Logic to Models of Second Dependent Type Theory (HG), pp. 167–181.
- SIGMOD-1995-BhargavaGI #query
- Hypergraph Based Reorderings of Outer Join Queries with Complex Predicates (GB, PG, BRI), pp. 304–315.
- ICLP-1995-NilssonH #higher-order #logic programming #source code
- Constructing Logic Programs with Higher-Order Predicates (JFN, AH), p. 827.
- SIGMOD-1994-Hellerstein
- Practical Predicate Placement (JMH), pp. 325–335.
- SIGMOD-1994-KemperMPS #optimisation #query
- Optimizing Disjunctive Queries with Expensive Predicates (AK, GM, KP, MS), pp. 336–347.
- VLDB-1994-LevyMS #optimisation #query
- Query Optimization by Predicate Move-Around (AYL, ISM, YS), pp. 96–107.
- CIKM-1994-Borgida #logic #on the
- On The Relationship Between Description Logic and Predicate Logic (AB), pp. 219–225.
- CC-1994-ParrQ #ll #semantics
- Adding Semantic and Syntactic Predicates To LL(k): pred-LL(k) (TJP, RWQ), pp. 263–277.
- ICLP-1994-Christiansen #performance
- Efficient and Complete Demo Predicates for Definite Clause Languages (HC), pp. 735–736.
- KBSE-1993-PerryP #named #reuse
- INQUIRE: Predicate-Based Use and Reuse (DEP, SSP), p. 21.
- PODS-1993-Chaudhuri #datalog #recursion
- Finding Nonrecursive Envelopes for Datalog Predicates (SC), pp. 135–146.
- SIGMOD-1993-HellersteinS #migration #optimisation #query
- Predicate Migration: Optimizing Queries with Expensive Predicates (JMH, MS), pp. 267–276.
- PEPM-1993-Mycroft #abstract interpretation
- Completeness and predicate-based abstract interpretation (AM), pp. 179–185.
- ECOOP-1993-Chambers
- Predicate Classes (CC), pp. 268–296.
- ICSE-1993-Tai #generative #source code #testing
- Predicate-Based Test Generation for Computer Programs (KCT), pp. 267–276.
- PODS-1992-BeeriM #functional #programming
- Functional and Predicative Programming in OODB’s (CB, TM), pp. 176–190.
- KR-1992-GabbayO #higher-order #logic #quantifier
- Quantifier Elimination in Second-Order Predicate Logic (DMG, HJO), pp. 425–435.
- LOPSTR-1992-GallagherW #logic programming #source code
- Deletion of Redundant Unary Type Predicates from Logic Programs (JPG, DAdW), pp. 151–167.
- CSL-1992-Lautemann #logic #monad #problem
- Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates (CL), pp. 327–339.
- JICSLP-1992-ColussiM #unification
- A Predicate Transformer for Unification (LC, EM), pp. 67–81.
- JICSLP-1992-MarekNR #logic programming #modelling
- The Stable Models of a Predicate Logic Program (VWM, AN, JBR), pp. 446–460.
- JICSLP-1992-Sato #metaprogramming
- Meta-Programming through a Truth Predicate (TS), pp. 526–540.
- PODS-1991-GangulyGZ #logic programming
- Minimum and Maximum Predicates in Logic Programming (SG, SG, CZ), pp. 154–163.
- ML-1991-WirthO #constraints
- Constraints on Predicate Invention (RW, PO), pp. 457–461.
- PLILP-1991-ChenW #abstraction #compilation #higher-order #logic programming
- Compilation of Predicate Abstractions in Higher-Order Logic Programming (WC, DSW), pp. 287–298.
- ICLP-1991-Sato #first-order #logic programming
- Full First Order Logic Programming and Truth Predicate (TS), p. 948.
- ISLP-1991-Kawamura #logic programming #performance #source code
- Derivation of Efficient Logic Programs by Synthesizing New Predicates (TK), pp. 611–625.
- ISLP-1991-Szeredi #prolog #using
- Using Dynamic Predicates in an Or--Parallel Prolog System (PS), pp. 355–371.
- LICS-1991-Mendler #recursion
- Predicative Type Universes and Primitive Recursion (NPM), pp. 173–184.
- SIGMOD-1990-HansonCKW #algorithm #database
- A Predicate Matching Algorithm for Database Rule Systems (ENH, MC, CHK, YWW), pp. 271–280.
- ESOP-1990-ProiettiP #logic programming #source code #synthesis
- Synthesis of Eureka Predicates for Developing Logic Programs (MP, AP), pp. 306–325.
- ALP-1990-Han #graph #query #recursion
- Recursive Query Processing in Predicate-Goal Graph (JLH), pp. 247–261.
- CAV-1990-Langevin #automation #calculus #verification
- Automated RTL Verification Based on Predicate Calculus (ML), pp. 116–125.
- CLP-1990-Plumer90 #logic programming #proving #source code #termination
- Termination Proofs for Logic Programs Based on Predicate Inequalities (LP), pp. 634–648.
- STOC-1989-GoldreichL
- A Hard-Core Predicate for all One-Way Functions (OG, LAL), pp. 25–32.
- SEKE-1989-HeL #logic #petri net #specification
- Deriving Temporal Logic Specifications from Predicate Transition Petri Net (XH, JANL), pp. 116–121.
- CSL-1989-Mey #calculus
- A Predicate Calculus with Control of Derivations (DM), pp. 254–266.
- NACLP-1989-DungK #on the #source code
- On the Generalized Predicate Completion of Non-Horn Programs (PMD, KK), pp. 587–603.
- VDME-1988-Blikle #specification #validation
- Three-Valued Predicates for Software Specification and Validation (AB), pp. 243–266.
- ML-1988-MuggletonB #first-order
- Machine Invention of First Order Predicates by Inverting Resolution (SM, WLB), pp. 339–352.
- CSL-1988-Plumer #automation #prolog #proving #source code #termination
- Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs (LP), pp. 254–271.
- JICSCP-1988-Moinard88
- Pointwise Circumscription is Equivalent to Predicate Completion (Sometimes) (YM), pp. 1097–1105.
- LICS-1987-Emden #first-order #functional #logic #programming #relational
- First-order Predicate Logic as a Common Basis for Relational and Functional Programming (Abstract) (MHvE), p. 179.
- VLDB-1986-BottcherJS #adaptation #database
- Adaptive Predicate Managers in Database Systems (SB, MJ, JWS), pp. 21–29.
- ICSE-1985-WhiteS #testing
- Experiments Determining Best Paths for Testing Computer Program Predicates (LJW, PNS), pp. 238–243.
- SLP-1985-Naish85 #prolog
- All Solutions Predicates in Prolog (LN), pp. 73–77.
- SIGMOD-1984-ValduriezV #multi #using
- A Multikey Hashing Scheme Using Predicate Trees (PV, YV), pp. 107–114.
- CADE-1984-Mulmuley #proving #recursion
- The Mechanization of Existence Proofs of Recursive Predicates (KM), pp. 460–475.
- SLP-1984-Tamaki84 #logic programming #programming language #semantics
- Semantics of a Logic Programming Language with a Reducibility Predicate (HT), pp. 259–264.
- SLP-1984-UeharaOKT84 #bibliography #bottom-up #implementation #logic #parsing
- A Bottom-Up Parser Based on Predicate Logic: A Survey of the Formalism and its Implementation Technique (KU, RO, OK, JT), pp. 220–227.
- VLDB-1983-Reimer #concurrent #problem
- Solving the Phantom Problem by Predicative Optimistic Concurrency Control (MR), pp. 81–88.
- ICALP-1983-Smyth #perspective
- Power Domains and Predicate Transformers: A Topological View (MBS), pp. 662–675.
- POPL-1983-FerranteO #dependence
- A Program Form Based on Data Dependency in Predicate Regions (JF, KJO), pp. 217–236.
- ILPC-1982-ChakravarthyMT82 #database #logic #relational
- Interfacing Predicate Logic Languages and Relational Databases (USC, JM, DT), pp. 91–98.
- VLDB-1980-Demolombe #calculus #estimation #query #tuple
- Estimation of the Number of Tuples Satisfying a Query Expressed in Predicate Calculus Language (RD), pp. 55–63.
- VLDB-1980-RosenkrantzH #query
- Processing Conjunctive Predicates and Queries (DJR, HBHI), pp. 64–72.
- SIGMOD-1979-HuntR #complexity #testing
- The Complexity of Testing Predicate Locks (HBHI, DJR), pp. 127–133.
- VLDB-1979-Demolombe #calculus #semantics
- Semantic Checking of Questions Expressed in Predicate Calculus Language (RD), pp. 444–450.
- VLDB-1979-MunzSS #database #testing
- Application of Sub-Predicate Tests in Database Systems (RM, HJS, FS), pp. 426–435.
- POPL-1979-Andler
- Predicate Path Expressions (SA), pp. 226–236.
- SIGMOD-1977-WongE
- Interval Hierarchies and Their Application to Predicate Files (Abstract) (KCW, ME), p. 168.
- STOC-1970-Reiter #proving #theorem proving
- The Predicate Elimination Strategy in Theorem Proving (RR), pp. 180–183.
- LISP-1963-McIntosh #lisp
- The use of operator predicates in LISP (HVM), p. 9.