Stem modulo$ (all stems)

127 papers:

DAC-2015-CampbellVPC #detection #fault #low cost #synthesis

High-level synthesis of error detecting cores through low-cost modulo-3 shadow datapaths (KAC, PV, DZP, DC), p. 6.

FoSSaCS-2015-HabermehlK #on the #quantifier

On Presburger Arithmetic Extended with Modulo Counting Quantifiers (PH, DK), pp. 375–389.

TACAS-2015-SebastianiT #cost analysis #modulo theories #optimisation

Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions (RS, PT), pp. 335–349.

PLDI-2015-LalQ #graph #source code

DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs (AL, SQ), pp. 280–290.

ICALP-v1-2015-0001GR #graph #morphism

Counting Homomorphisms to Square-Free Graphs, Modulo 2 (AG, LAG, DR), pp. 642–653.

CADE-2015-Ji #deduction #model checking

CTL Model Checking in Deduction Modulo (KJ), pp. 295–310.

CAV-2015-DasLLL #precise #verification

Angelic Verification: Precise Verification Modulo Unknowns (AD, SKL, AL, YL), pp. 324–342.

CAV-2015-DietschHLP #approach #ltl #model checking #modulo theories

Fairness Modulo Theory: A New Approach to LTL Software Model Checking (DD, MH, VL, AP), pp. 49–66.

CAV-2015-SebastianiT #modulo theories #named #optimisation

OptiMathSAT: A Tool for Optimization Modulo Theories (RS, PT), pp. 447–454.

CAV-2015-ManoliosPP #framework #modulo theories #programming

The Inez Mathematical Programming Modulo Theories Framework (PM, JP, VP), pp. 53–69.

ICLP-J-2015-AlvianoP #fuzzy #modulo theories #satisfiability #set

Fuzzy answer set computation via satisfiability modulo theories (MA, RP), pp. 588–603.

RTA-2015-ClercM #term rewriting

Presenting a Category Modulo a Rewriting System (FC, SM), pp. 89–105.

TLCA-2015-Assaf #π-calculus

Conservativity of Embeddings in the λ π Calculus Modulo Rewriting (AA0), pp. 31–44.

TACAS-2014-CimattiGMT #abstraction #modulo theories

IC3 Modulo Theories via Implicit Predicate Abstraction (AC, AG, SM, ST), pp. 46–61.

TACAS-2014-DeckerLT #modulo theories #monitoring

Monitoring Modulo Theories (ND, ML, DT), pp. 341–356.

WRLA-2014-AguirreMPP #logic #maude

Conditional Narrowing Modulo in Rewriting Logic and Maude (LA, NMO, MP, IP), pp. 80–96.

WRLA-2014-RochaMM #analysis #smt

Rewriting Modulo SMT and Open System Analysis (CR, JM, CAM), pp. 247–262.

PLDI-2014-LeAS #compilation #equivalence #validation

Compiler validation via equivalence modulo inputs (VL, MA, ZS), p. 25.

PLDI-2014-LogozzoLFB #towards #verification

Verification modulo versions: towards usable verification (FL, SKL, MF, SB), p. 32.

CHI-2014-ZadeAGDC #bisimulation #distance #edit distance #evolution #modelling

Edit distance modulo bisimulation: a quantitative measure to study evolution of user models (HZ, SAA, SG, AKD, VC), pp. 1757–1766.

LOPSTR-2014-ChristiansenK #confluence #constraints #equivalence

Confluence Modulo Equivalence in Constraint Handling Rules (HC, MHK), pp. 41–58.

LCTES-2014-HenryAMM #encoding #execution #how #modulo theories #optimisation #semantics #worst-case

How to compute worst-case execution time by optimization modulo theory and a clever encoding of program semantics (JH, MA, DM, CM), pp. 43–52.

LICS-CSL-2014-CarreiroFVZ #automaton #similarity

Weak MSO: automata and expressiveness modulo bisimilarity (FC, AF, YV, FZ), p. 27.

LICS-CSL-2014-FredriksonJ #approach #privacy #satisfiability

Satisfiability modulo counting: a new approach for analyzing privacy properties (MF, SJ), p. 10.

HILT-2013-Bjorner #development #modulo theories #satisfiability

Satisfiability modulo theories for high integrity development (NB), pp. 5–6.

OOPSLA-2013-KneussKKS #recursion #synthesis

Synthesis modulo recursive functions (EK, IK, VK, PS), pp. 407–426.

CAV-2013-ManoliosP #modulo theories

ILP Modulo Theories (PM, VP), pp. 662–677.

CSL-2013-HarwathS #first-order #invariant #locality #logic #on the #quantifier

On the locality of arb-invariant first-order logic with modulo counting quantifiers (FH, NS), pp. 363–379.

RTA-2013-SmolkaT #recursion #unification

Unification Modulo Nonnested Recursion Schemes via Anchored Semi-Unification (GS, TT), pp. 271–286.

SAT-2013-CimattiGSS #approach #composition #modulo theories #satisfiability

A Modular Approach to MaxSAT Modulo Theories (AC, AG, BJS, RS), pp. 150–165.

WRLA-2012-GutierrezMR #axiom #order #similarity

Order-Sorted Equality Enrichments Modulo Axioms (RG, JM, CR), pp. 162–181.

CIAA-2012-ReidenbachS #automaton #bound #nondeterminism

Automata with Modulo Counters and Nondeterministic Counter Bounds (DR, MLS), pp. 361–368.

LATA-2012-AnantharamanBNR #unification

Unification Modulo Chaining (SA, CB, PN, MR), pp. 70–82.

CAV-2012-LalQL #modulo theories #reachability

A Solver for Reachability Modulo Theories (AL, SQ, SKL), pp. 427–443.

ICLP-2012-Ostrowski #csp

ASP modulo CSP: The clingcon system (MO), pp. 458–463.

ICLP-J-2012-Duck #constraints #named #satisfiability

SMCHR: Satisfiability modulo constraint handling rules (GJD), pp. 601–618.

ICLP-J-2012-OstrowskiS #csp

ASP modulo CSP: The clingcon system (MO, TS), pp. 485–503.

IJCAR-2012-AnantharamanELNR #unification

Unification Modulo Synchronous Distributivity (SA, SE, CL, PN, MR), pp. 14–29.

IJCAR-2012-JacquelBDD #automation #deduction #modulo theories #proving #theorem proving #using #verification

Tableaux Modulo Theories Using Superdeduction — An Application to the Verification of B Proof Rules with the Zenon Automated Theorem Prover (MJ, KB, DD, CD), pp. 332–338.

IJCAR-2012-MarshallN #algorithm #unification

New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants (AMM, PN), pp. 408–422.

LICS-2012-BaeldeN #deduction #fixpoint #logic

Combining Deduction Modulo and Logics of Fixed-Point Definitions (DB, GN), pp. 105–114.

SMT-2012-AlbertiBGRS #library #modulo theories #reachability

Reachability Modulo Theory Library (FA, RB, SG, SR, NS), pp. 67–76.

SMT-2012-BjornerMR #modulo theories #satisfiability #verification

Program Verification as Satisfiability Modulo Theories (NB, KLM, AR), pp. 3–11.

TACAS-2011-ConchonCI #modulo theories

Canonized Rewriting and Ground AC Completion Modulo Shostak Theories (SC, EC, MI), pp. 45–59.

TACAS-2011-GriggioLS #generative #integer #linear #performance #satisfiability

Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic (AG, TTHL, RS), pp. 143–157.

SAS-2011-SuterKK #recursion #satisfiability #source code

Satisfiability Modulo Recursive Programs (PS, ASK, VK), pp. 298–315.

SEFM-2011-EggersRNF #analysis #hybrid #satisfiability

Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods (AE, NR, NSN, MF), pp. 172–187.

PPDP-2011-EscobarKLMMNS #analysis #encryption #protocol #unification #using

Protocol analysis in Maude-NPA using unification modulo homomorphic encryption (SE, DK, CL, CM, JM, PN, RS), pp. 65–76.

PPDP-2011-SchernhammerM #axiom #incremental #recursion #specification

Incremental checking of well-founded recursive specifications modulo axioms (FS, JM), pp. 5–16.

CADE-2011-BaumgartnerT #evolution #similarity

Model Evolution with Equality Modulo Built-in Theories (PB, CT), pp. 85–100.

CADE-2011-Burel #deduction

Experimenting with Deduction Modulo (GB), pp. 162–176.

TLCA-2011-BrunelHH #algebra #deduction #orthogonal

Orthogonality and Boolean Algebras for Deduction Modulo (AB, OH, CH), pp. 76–90.

VMCAI-2011-SuterSK #constraints #modulo theories #satisfiability #set

Sets with Cardinality Constraints in Satisfiability Modulo Theories (PS, RS, VK), pp. 403–418.

DATE-2010-WangXY #scheduling

Reuse-aware modulo scheduling for stream processors (LW, JX, XY), pp. 1112–1117.

TACAS-2010-CimattiFGSS #formal method #satisfiability

Satisfiability Modulo the Theory of Costs: Foundations and Applications (AC, AF, AG, RS, CS), pp. 99–113.

POPL-2010-HarrisSIG #program analysis #satisfiability #source code

Program analysis via satisfiability modulo path programs (WRH, SS, FI, AG), pp. 71–82.

CSL-2010-Burel #deduction #proving

Embedding Deduction Modulo into a Prover (GB), pp. 155–169.

CSL-2010-Strub #coq #modulo theories

Coq Modulo Theory (PYS), pp. 529–543.

IJCAR-2010-GhilardiR #model checking #modulo theories #named

MCMT: A Model Checker Modulo Theories (SG, SR), pp. 22–29.

DATE-2009-KinsmanN #finite #modulo theories #precise #using

Finite Precision bit-width allocation using SAT-Modulo Theory (ABK, NN), pp. 1106–1111.

LCTES-2009-OhEPM #architecture #configuration management #scheduling

Recurrence cycle aware modulo scheduling for coarse-grained reconfigurable architectures (TO, BE, HP, SAM), pp. 21–30.

LCTES-2009-StotzerL #scheduling

Modulo scheduling without overlapped lifetimes (ES, ELL), pp. 1–10.

CADE-2009-BorrallerasLNRR #linear #polynomial #satisfiability

Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (CB, SL, RNM, ERC, AR), pp. 294–305.

CAV-2009-GeM #modulo theories #quantifier #satisfiability

Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories (YG, LMdM), pp. 306–320.

SAT-2009-KimSJ #modulo theories #performance #satisfiability

Efficient Term-ITE Conversion for Satisfiability Modulo Theories (HK, FS, HJ), pp. 195–208.

SAT-2009-Nieuwenhuis #algorithm #modulo theories #satisfiability

SAT Modulo Theories: Enhancing SAT with Special-Purpose Algorithms (RN), p. 1.

TACAS-2008-CimattiGS #generative #modulo theories #performance #satisfiability

Efficient Interpolant Generation in Satisfiability Modulo Theories (AC, AG, RS), pp. 397–412.

LATA-2008-KirchnerKM #pattern matching

Anti-pattern Matching Modulo (CK, RK, PEM), pp. 275–286.

CGO-2008-FanPKM #hardware #reuse #scheduling

Modulo scheduling for highly customized datapaths to increase hardware reusability (KF, HP, MK, SAM), pp. 124–133.

IJCAR-2008-TourEN #equation #unification

Unification and Matching Modulo Leaf-Permutative Equational Presentations (TBdlT, ME, PN), pp. 332–347.

SAT-2008-FaureNOR #formal method #linear #satisfiability

SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers (GF, RN, AO, ERC), pp. 77–90.

TACAS-2007-KrsticGGT #parametricity #satisfiability

Combined Satisfiability Modulo Parametric Theories (SK, AG, JG, CT), pp. 602–617.

CC-2007-ChoAUP #effectiveness #multi #preprocessor #scheduling

Preprocessing Strategy for Effective Modulo Scheduling on Multi-issue Digital Signal Processors (DC, RA, GRU, YP), pp. 16–31.

CADE-2007-GeBT #modulo theories #quantifier #satisfiability #using #verification

Solving Quantified Verification Conditions Using Satisfiability Modulo Theories (YG, CB, CT), pp. 167–182.

CAV-2007-MouraDS #modulo theories #satisfiability #tutorial

A Tutorial on Satisfiability Modulo Theories (LMdM, BD, NS), pp. 20–36.

CSL-2007-Burel #bound #deduction

Unbounded Proof-Length Speed-Up in Deduction Modulo (GB), pp. 496–511.

RTA-2007-NieuwenhuisORR #challenge #modulo theories #satisfiability

Challenges in Satisfiability Modulo Theories (RN, AO, ERC, AR), pp. 2–18.

SAT-2007-CimattiGS #flexibility #modulo theories #satisfiability

A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories (AC, AG, RS), pp. 334–339.

TLCA-2007-CousineauD #calculus #type system

Embedding Pure Type Systems in the λ-π-Calculus Modulo (DC, GD), pp. 102–117.

CAV-2006-Roe #heuristic #modulo theories #proving #smt #theorem proving

The Heuristic Theorem Prover: Yet Another SMT Modulo Theorem Prover (KR), pp. 467–470.

IJCAR-2006-HendrixMO #axiom #linear #order #specification

A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms (JH, JM, HO), pp. 151–155.

IJCAR-2006-JacquemardRV #automaton #constraints #equation #similarity

Tree Automata with Equality Constraints Modulo Equational Theories (FJ, MR, LV), pp. 557–571.

RTA-2006-Jouannaud #composition

Modular Church-Rosser Modulo (JPJ), pp. 96–107.

SAT-2006-NieuwenhuisO #modulo theories #on the #optimisation #problem #satisfiability

On SAT Modulo Theories and Optimization Problems (RN, AO), pp. 156–169.

SAT-2006-SheiniS #modulo theories #satisfiability

From Propositional Satisfiability to Satisfiability Modulo Theories (HMS, KAS), pp. 1–9.

SAT-2006-SheiniS06a #modulo theories #satisfiability

A Progressive Simplifier for Satisfiability Modulo Theories (HMS, KAS), pp. 184–197.

CAV-2005-BarrettMS #contest #modulo theories #named #satisfiability

SMT-COMP: Satisfiability Modulo Theories Competition (CWB, LMdM, AS), pp. 20–23.

CAV-2005-BozzanoBCJRRS #modulo theories #performance #satisfiability

Efficient Satisfiability Modulo Theories via Delayed Theory Combination (MB, RB, AC, TAJ, SR, PvR, RS), pp. 335–349.

RTA-2005-DowekW #modulo theories

Arithmetic as a Theory Modulo (GD, BW), pp. 423–437.

TLCA-2005-CosmoPR #commutative #recursion #type system

Subtyping Recursive Types Modulo Associative Commutative Products (RDC, FP, DR), pp. 179–193.

CGO-2004-SmelyanskiyMD #probability #scheduling

Probabilistic Predicate-Aware Modulo Scheduling (MS, SAM, ESD), pp. 151–162.

IJCAR-2004-Avenhaus #algorithm #performance #permutation

Efficient Algorithms for Computing Modulo Permutation Theories (JA), pp. 415–429.

IJCAR-2004-Bonichon #deduction #named

TaMeD: A Tableau Method for Deduction Modulo (RB), pp. 445–459.

DATE-2003-MeiVVML #architecture #configuration management #parallel #scheduling #using

Exploiting Loop-Level Parallelism on Coarse-Grained Reconfigurable Architectures Using Modulo Scheduling (BM, SV, DV, HDM, RL), pp. 10296–10301.

DATE-2003-PillaiJ #clustering #scheduling

Compiler-Directed ILP Extraction for Clustered VLIW/EPIC Machines: Predication, Speculation and Modulo Scheduling (SP, MFJ), pp. 10422–10427.

CADE-2003-AnantharamanNR #morphism #unification

Unification Modulo ACU I Plus Homomorphisms/Distributivity (SA, PN, MR), pp. 442–457.

CADE-2003-GanzingerHW

Superposition Modulo a Shostak Theory (HG, TH, UW), pp. 182–196.

RTA-2003-Blanqui #deduction

Rewriting Modulo in Deduction Modulo (FB), pp. 395–409.

TLCA-2001-Dowek #modulo theories

The Stratified Foundations as a Theory Modulo (GD), pp. 136–150.

DATE-1999-JaschkeLB #resource management #scheduling

Time Constrained Modulo Scheduling with Global Resource Sharing (CJ, RL, FB), pp. 210–216.

STOC-1999-BussGIP #calculus #linear #polynomial

Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (SRB, DG, RI, TP), pp. 547–556.

CC-1999-Dinechin #memory management #scheduling

Extending Modulo Scheduling with Memory Reference Merging (BDdD), pp. 274–287.

HPCA-1999-FernandesLT #distributed #scheduling

Distributed Modulo Scheduling (MMF, JL, NPT), pp. 130–134.

LCTES-1999-StotzerL #architecture #scheduling

Modulo Scheduling for the TMS320C6x VLIW DSP Architecture (ES, ELL), pp. 28–34.

RTA-1999-CosmoG #normalisation #proving

Strong Normalization of Proof Nets Modulo Structural Congruences (RDC, SG), pp. 75–89.

RTA-1999-Marcinkowski #algebra #formal method

Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol (JM), pp. 92–102.

WRLA-1998-Viry #calculus #equation

Adventures in sequent calculus modulo equations (PV), pp. 21–32.

CC-1998-LelaitGE #algorithm #performance

A New Fast Algorithm for Optimal Register Allocation in Modulo Scheduled Loops (SL, GRG, CE), pp. 204–218.

RTA-1998-LimetR #equation #term rewriting

Solving Disequations Modulo Some Class of Rewrite Systems (SL, PR), pp. 121–135.

RTA-1998-Ohlebusch #equivalence #reduction #theorem

Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation (EO), pp. 17–31.

PLDI-1997-EichenbergerD #performance

Efficient Formulation for Optimal Modulo Schedulers (AEE, ESD), pp. 194–205.

CC-1996-PfahlerP #comparison #pipes and filters #scheduling

A Comparison of Modulo Scheduling Techniques for Software Pipelining (PP, GP), pp. 18–32.

CADE-1996-GuoNW #unification

Unification and Matching Modulo Nilpotence (QG, PN, DAW), pp. 261–274.

LICS-1996-Nurmonen #finite #order #quantifier

Counting Modulo Quantifiers on Finite Linearly Ordered Trees (JN), pp. 484–493.

RTA-1996-ContejeanM #named

CiME: Completion Modulo E (EC, CM), pp. 416–419.

STOC-1994-KrauseP #on the #power of

On the computational power of depth 2 circuits with threshold and modulo gates (MK, PP), pp. 48–57.

CADE-1994-Salzer #unification

Primal Grammars and Unification Modulo a Binary Clause (GS), pp. 282–295.

PLDI-1993-Huff #scheduling

Lifetime-Sensitive Modulo Scheduling (RAH), pp. 258–267.

RTA-1993-Zhang #case study

A Case Study of Completion Modulo Distributivity and Abelian Groups (HZ), pp. 32–46.

STOC-1992-BarringtonBR #representation

Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract) (DAMB, RB, SR), pp. 455–461.

ALP-1990-Bellegarde #category theory #formal method #process

A Matching Process Modulo a Theory of Categorical Products (FB), pp. 270–282.

RTA-1989-BairdPW #commutative #reduction #set

Complete Sets of Reductions Modulo Associativity, Commutativity and Identity (TBB, GEP, RWW), pp. 29–44.

ALP-1988-FulopV #automaton #linear #set #term rewriting

A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata (ZF, SV), p. 157.

RTA-1987-BachmairD #congruence

Completion for Rewriting Modulo a Congruence (LB, ND), pp. 192–203.

ICALP-1986-AverbuchWG #algorithm #classification #polynomial

Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial (AA, SW, ZG), pp. 31–39.

POPL-1984-JouannaudK #equation #set

Completion of a Set of Rules Modulo a Set of Equations (JPJ, HK), pp. 83–92.

CADE-1984-JouannaudM #equation #set #termination

Termination of a Set of Rules Modulo a Set of Equations (JPJ, MM), pp. 175–193.