BibSLEIGH — decid stem

Used together with:

logic (51)
system (39)
theori (38)
problem (36)
order (35)

Stem decid$ (all stems)

381 papers:

FoSSaCS-2015-ChadhaSVB #automaton #decidability #probability: Decidable and Expressive Classes of Probabilistic Automata (RC, APS, MV, YB), pp. 200–214.
FoSSaCS-2015-Cotton-BarrattH #automaton #decidability #memory management #ml: Fragments of ML Decidable by Nested Data Class Memory Automata (CCB, DH, ASM, CHLO), pp. 249–263.
CIAA-J-2013-KutribMMPW15 #automaton #decidability #finite #queue: Deterministic input-driven queue automata: Finite turns, decidability, and closure properties (MK, AM, CM, BP, MW), pp. 58–71.
CIAA-2015-BrodaCFM #algebra: Deciding Synchronous Kleene Algebra with Derivatives (SB, SC, MF, NM), pp. 49–62.
CIAA-2015-Prusa #context-free grammar #decidability #multi #problem: (Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars (DP), pp. 250–262.
DLT-2015-AlmeidaBKK #decidability #on the: On Decidability of Intermediate Levels of Concatenation Hierarchies (JA, JB, OK, MK), pp. 58–70.
DLT-2015-BealH #finite: Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts (MPB, PH), pp. 167–178.
LATA-2015-AnselmoGM #2d #decidability: Structure and Measure of a Decidable Class of Two-dimensional Codes (MA, DG, MM), pp. 315–327.
CHI-2015-AmmariKLS #how #online #what: Managing Children’s Online Identities: How Parents Decide what to Disclose about their Children Online (TA, PK, CL, SYS), pp. 1895–1904.
ESEC-FSE-2015-ChengGMSSW #formal method #semantics: Semantic degrees for Industrie 4.0 engineering: deciding on the degree of semantic formalization to select appropriate technologies (CHC, TG, CM, JOS, MS, PW), pp. 1010–1013.
CADE-2015-David #satisfiability: Deciding ATL* Satisfiability by Tableaux (AD), pp. 214–228.
CADE-2015-Passmore #algebra #decidability #integer: Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers (GOP), pp. 181–196.
CAV-2015-BansalR0BW: Deciding Local Theory Extensions via E-matching (KB, AR, TK, CWB, TW), pp. 87–105.
CSL-2015-KuskeLM #decidability #infinity #monad #word: Infinite and Bi-infinite Words with Decidable Monadic Theories (DK, JL, AM), pp. 472–486.
CSL-2015-LehtinenQ: Deciding the First Levels of the Modal μ Alternation Hierarchy by Formula Construction (KL, SQ), pp. 457–471.
LICS-2015-BenediktCB #decidability #fixpoint #logic: Interpolation with Decidable Fixpoint Logics (MB, BtC, MVB), pp. 378–389.
STOC-2014-GroheKS #first-order #graph: Deciding first-order properties of nowhere dense graphs (MG, SK, SS), pp. 89–98.
DLT-J-2013-AnselmoGM14 #2d #decidability: Prefix Picture codes: a Decidable class of Two-Dimensional codes (MA, DG, MM), pp. 1017–1032.
DLT-J-2013-BertoniCD14 #automaton #context-free grammar #decidability #on the #problem #quantum: On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages (AB, CC, FD), pp. 1065–1082.
ICALP-v2-2014-BojanczykGMS #decidability #infinity #on the: On the Decidability of MSO+U on Infinite Trees (MB, TG, HM, MS), pp. 50–61.
ICALP-v2-2014-OuaknineW14a #decidability #linear #sequence: Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences (JO, JW), pp. 330–341.
FM-2014-SanatiMM #decidability #guidelines #logic #metric #using: Analyzing Clinical Practice Guidelines Using a Decidable Metric Interval-Based Temporal Logic (MYS, WM, TSEM), pp. 611–626.
HIMI-DE-2014-Rodriguez #algorithm #image #matlab #predict: Prediction or Guess? Decide by Looking at Two Images Generated by a “MATLAB MySQL” Algorithm (CR0), pp. 87–97.
KR-2014-BorgwardtDP #decidability #logic: Decidable Gödel Description Logics without the Finitely-Valued Model Property (SB, FD, RP).
KR-2014-LakemeyerL #calculus #decidability #reasoning: Decidable Reasoning in a Fragment of the Epistemic Situation Calculus (GL, HJL).
LICS-CSL-2014-BaierKKW #complexity #decidability #linear #logic #monitoring: Weight monitoring with linear temporal logic: complexity and decidability (CB, JK, SK, SW), p. 10.
LICS-CSL-2014-CharatonikKM #decidability #logic #transitive: Decidability of weak logics with deterministic transitive closure (WC, EK, FM), p. 10.
LICS-CSL-2014-Ilik #axiom #decidability #morphism: Axioms and decidability for type isomorphism in the presence of sums (DI), p. 7.
RTA-TLCA-2014-CarvalhoS #decidability #polynomial #set: An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting (DdC, JGS), pp. 179–193.
VMCAI-2014-WangH #concurrent #reachability: Precisely Deciding Control State Reachability in Concurrent Traces with Limited Observability (CW, KH), pp. 376–394.
PODS-2013-Gottlob #identification #polynomial: Deciding monotone duality and identifying frequent itemsets in quadratic logspace (GG), pp. 25–36.
FoSSaCS-2013-CzerwinskiDLM #regular expression: Deciding Definability by Deterministic Regular Expressions (WC, CD, KL, WM), pp. 289–304.
CIAA-2013-KutribMMPW #automaton #decidability #finite #queue: Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties (MK, AM, CM, BP, MW), pp. 232–243.
DLT-2013-BertoniCD #automaton #context-free grammar #decidability #finite #linear #problem #quantum: Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem (AB, CC, FD), pp. 82–93.
DLT-2013-LuPC: Deciding Determinism of Unary Languages Is coNP-Complete (PL, FP, HC), pp. 350–361.
ICALP-v1-2013-Grier #finite #game studies: Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete (DG), pp. 497–503.
LATA-2013-AtminasLM: Deciding WQO for Factorial Languages (AA, VVL, MM), pp. 68–79.
LATA-2013-DelzannoT #complexity #decidability #network #verification: Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks (GD, RT), pp. 238–249.
SIGIR-2013-BoytsovBW #information retrieval #multi: Deciding on an adjustment for multiplicity in IR experiments (LB, AB, PW), pp. 403–412.
PPDP-2013-CalauttiGT #decidability #detection #logic programming #source code: Detecting decidable classes of finitely ground logic programs with function symbols (MC, SG, IT), pp. 239–250.
CADE-2013-KersaniP #decidability #first-order: Completeness and Decidability Results for First-Order Clauses with Indices (AK, NP), pp. 58–75.
CSL-2013-ChatterjeeCT #decidability #markov #process #what: What is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives (KC, MC, MT), pp. 165–180.
CSL-2013-ColcombetKLB #automaton: Deciding the weak definability of Büchi definable tree languages (TC, DK, CL, MVB), pp. 215–230.
CSL-2013-WangB #decidability #equation #semantics #type system: Semantics of Intensional Type Theory extended with Decidable Equational Theories (QW, BB), pp. 653–667.
ICLP-J-2013-GottlobMP #decidability #paradigm: Combining decidability paradigms for existential rules (GG, MM, AP), pp. 877–892.
LICS-2013-HofmanMT #decidability #simulation: Decidability of Weak Simulation on One-Counter Nets (PH, RM, PT), pp. 203–212.
RTA-2013-FujitaS #decidability: Decidable structures between Church-style and Curry-style (KeF, AS), pp. 190–205.
RTA-2013-TushkanovaRGK #automation #calculus #decidability: Automatic Decidability: A Schematic Calculus for Theories with Counting Operators (ET, CR, AG, OK), pp. 303–318.
ESOP-2012-AtigBBM #decidability #memory management #modelling #question #what: What’s Decidable about Weak Memory Models? (MFA, AB, SB, MM), pp. 26–46.
TACAS-2012-BozgaIK #termination: Deciding Conditional Termination (MB, RI, FK), pp. 252–266.
DLT-J-2011-CharlierRS12 #automation #decidability #sequence: Enumeration and Decidable Properties of Automatic Sequences (EC, NR, JS), pp. 1035–1066.
DLT-2012-BealCDJL #decidability #geometry #regular expression: Decidability of Geometricity of Regular Languages (MPB, JMC, JPD, HJ, SL), pp. 62–72.
ICALP-v2-2012-GavenciakKO #first-order: Deciding First Order Properties of Matroids (TG, DK, SiO), pp. 239–250.
ICGT-2012-AotoK #confluence #decidability #term rewriting: Rational Term Rewriting Revisited: Decidability and Confluence (TA, JK), pp. 172–186.
KR-2012-GiacomoLP #bound #calculus #decidability #verification: Bounded Situation Calculus Action Theories and Decidable Verification (GDG, YL, FP).
SEKE-2012-LuZZBA #decidability #invariant #petri net: Decidability of Minimal Supports of S-invariants and the Computation of their Supported S-invariants of Petri Nets (FL, QZ, HZ, YB, JA), pp. 340–345.
POPL-2012-BasuBO: Deciding choreography realizability (SB, TB, MO), pp. 191–202.
CAV-2012-GuhaNA #automaton #bisimulation #decidability #on the: On Decidability of Prebisimulation for Timed Automata (SG, CN, SAK), pp. 444–461.
CSL-2012-KufleitnerW #decidability: The FO2 alternation hierarchy is decidable (MK, PW), pp. 426–439.
ICLP-J-2012-AlvianoFLM #complexity #datalog #decidability #quantifier #semantics: Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues (MA, WF, NL, MM), pp. 701–718.
IJCAR-2012-FontaineMW #decidability: Combination of Disjoint Theories: Beyond Decidability (PF, SM, CW), pp. 256–270.
LICS-2012-ChatterjeeT #automaton #decidability #infinity #probability #problem #word: Decidable Problems for Probabilistic Automata on Infinite Words (KC, MT), pp. 185–194.
LICS-2012-FijalkowGO #automaton #probability #problem: Deciding the Value 1 Problem for Probabilistic Leaktight Automata (NF, HG, YO), pp. 295–304.
LICS-2012-GaoAC: Delta-Decidability over the Reals (SG, JA, EMC), pp. 305–314.
LICS-2012-Jancar #decidability #equivalence #first-order: Decidability of DPDA Language Equivalence via First-Order Grammars (PJ), pp. 415–424.
LICS-2012-MichaliszynO #decidability #logic: Decidable Elementary Modal Logics (JM, JO), pp. 491–500.
RTA-2012-BertrandDKSS #decidability #graph transformation #on the #reachability: On the Decidability Status of Reachability and Coverability in Graph Transformation Systems (NB, GD, BK, AS, JS), pp. 101–116.
RTA-2012-Felgenhauer #confluence #polynomial #term rewriting: Deciding Confluence of Ground Term Rewrite Systems in Cubic Time (BF), pp. 165–175.
CIAA-J-2010-DiekertK11 #regular expression: It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular (VD, SK), pp. 1813–1828.
DLT-2011-CharlierRS #automation #decidability #sequence: Enumeration and Decidable Properties of Automatic Sequences (EC, NR, JS), pp. 165–179.
DLT-2011-Manea #network: Deciding Networks of Evolutionary Processors (FM), pp. 337–349.
ICALP-v2-2011-BouajjaniMM #robust: Deciding Robustness against Total Store Ordering (AB, RM, EM), pp. 428–440.
ICALP-v2-2011-HopkinsMO #automaton #decidability #ml: A Fragment of ML Decidable by Visibly Pushdown Automata (DH, ASM, CHLO), pp. 149–161.
GT-VMT-2011-BrugginkH #decidability #graph: Decidability and Expressiveness of Finitely Representable Recognizable Graph Languages (HJSB, MH).
POPL-2011-MadhusudanPQ #decidability #logic: Decidable logics combining heap structures and data (PM, GP, XQ), pp. 611–622.
CADE-2011-ArnaudCD #protocol #recursion #security #testing: Deciding Security for Protocols with Recursive Tests (MA, VC, SD), pp. 49–63.
CSL-2011-CantoneLA #decidability #logic #order #quantifier #set: A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics (DC, CL, MNA), pp. 129–143.
CSL-2011-Kieronski #decidability #linear #logic #order: Decidability Issues for Two-Variable Logics with Several Linear Orders (EK), pp. 337–351.
CSL-2011-SchnablS #complexity #runtime: The Exact Hardness of Deciding Derivational and Runtime Complexity (AS, JGS), pp. 481–495.
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.
LICS-2011-BodirskyPT #decidability: Decidability of Definability (MB, MP, TT), pp. 321–328.
LICS-2011-BresolinMSS #decidability #logic #what: What’s Decidable about Halpern and Shoham’s Interval Logic? The Maximal Fragment ABBL (DB, AM, PS, GS), pp. 387–396.
LICS-2011-Figueira #decidability #logic #word: A Decidable Two-Way Logic on Data Words (DF), pp. 365–374.
FoSSaCS-2010-DemriS #decidability #ltl #model checking: When Model-Checking Freeze LTL over Counter Machines Becomes Decidable (SD, AS), pp. 176–190.
FoSSaCS-2010-Stirling #decidability #higher-order: Introduction to Decidability of Higher-Order Matching (CS), p. 1.
FoSSaCS-2010-ToL #algorithm #decidability #infinity #ltl #model checking: Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems (AWT, LL), pp. 221–236.
STOC-2010-GodoyGRA #decidability #problem: The HOM problem is decidable (GG, OG, LR, CÀ), pp. 485–494.
ICALP-v2-2010-GimbertO #automaton #decidability #finite #probability #problem #word: Probabilistic Automata on Finite Words: Decidable and Undecidable Problems (HG, YO), pp. 527–538.
ICALP-v2-2010-MontanariPS #decidability #logic: Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals (AM, GP, PS), pp. 345–356.
IFM-2010-Dimovski #composition #equivalence #nondeterminism #source code #termination: A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs (AD), pp. 121–135.
GT-VMT-2010-RehakSSH #decidability: Decidable Race Condition and Open Coregions in HMSC (VR, PS, JS, LH).
ICPR-2010-LobranoTGR #decidability: A Score Decidability Index for Dynamic Score Combination (CL, RT, GG, FR), pp. 69–72.
KR-2010-BagetLM #decidability: Walking the Decidability Line for Rules with Existential Variables (JFB, ML, MLM).
KR-2010-BartholomewL #decidability #modelling: A Decidable Class of Groundable Formulas in the General Theory of Stable Models (MB, JL).
KR-2010-CeramiEB #decidability #logic: Decidability of a Description Logic over Infinite-Valued Product Logic (MC, FE, FB).
KR-2010-GlimmR #decidability #query: Status QIO: Conjunctive Query Entailment Is Decidable (BG, SR).
ICLP-J-2010-AlvianoFL #decidability #effectiveness #query: Disjunctive ASP with functions: Decidable queries and effective computation (MA, WF, NL), pp. 497–512.
ICLP-J-2010-BaseliceB #decidability #source code #subclass: A decidable subclass of finitary programs (SB, PAB), pp. 481–496.
ICLP-J-2010-GabbrielliMMS #decidability: Decidability properties for fragments of CHR (MG, JM, MCM, JS), pp. 611–626.
IJCAR-2010-AravantinosCP #decidability: A Decidable Class of Nested Iterated Schemata (VA, RC, NP), pp. 293–308.
LICS-2010-PlaceS #xpath: Deciding Definability in FO2(<) (or XPath) on Trees (TP, LS), pp. 253–262.
DAC-2009-VenerisS: The day Sherlock Holmes decided to do EDA (AGV, SS), pp. 631–634.
ITiCSE-2009-ZanderTSMMHF #learning: Learning styles: novices decide (CZ, LT, BS, LM, RM, BH, SF), pp. 223–227.
STOC-2009-KawarabayashiR #decidability: Hadwiger’s conjecture is decidable (KiK, BAR), pp. 445–454.
DLT-2009-BlakeleyBGR #complexity #on the #set #word: On the Complexity of Deciding Avoidability of Sets of Partial Words (BB, FBS, JG, NR), pp. 113–124.
DLT-2009-Souza #decidability #equivalence #on the #transducer: On the Decidability of the Equivalence for a Certain Class of Transducers (RdS), pp. 478–489.
ICALP-v1-2009-AubrunB #decidability #finite: Decidability of Conjugacy of Tree-Shifts of Finite Type (NA, MPB), pp. 132–143.
ICALP-v2-2009-AcciaiB #behaviour #infinity #safety #π-calculus: Deciding Safety Properties in Infinite-State π-Calculus via Behavioural Types (LA, MB), pp. 31–42.
ICALP-v2-2009-Michaliszyn #decidability #transitive: Decidability of the Guarded Fragment with the Transitive Closure (JM), pp. 261–272.
ICALP-v2-2009-PlaceS #decidability: A Decidable Characterization of Locally Testable Tree Languages (TP, LS), pp. 285–296.
LATA-2009-BaillyD #convergence: Absolute Convergence of Rational Series Is Semi-decidable (RB, FD), pp. 117–128.
ICFP-2009-SchrijversJSV #data type #decidability #type inference: Complete and decidable type inference for GADTs (TS, SLPJ, MS, DV), pp. 341–352.
LOPSTR-2009-PettorossiPS #branch #logic #program transformation: Deciding Full Branching Time Logic by Program Transformation (AP, MP, VS), pp. 5–21.
CADE-2009-BonacinaLM #on the #proving #satisfiability #theorem proving: On Deciding Satisfiability by DPLL(G+T) and Unsound Theorem Proving (MPB, CL, LMdM), pp. 35–50.
CADE-2009-HorbachW #decidability: Decidability Results for Saturation-Based Model Building (MH, CW), pp. 404–420.
CSL-2009-AtseriasW #consistency #constraints #decidability #problem: Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems (AA, MW), pp. 102–116.
CSL-2009-DuparcFM #automaton #decidability #game studies #linear #problem: Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (JD, AF, FM), pp. 225–239.
CSL-2009-HorbachW #induction #query: Deciding the Inductive Validity of FOR ALL THERE EXISTS * Queries (MH, CW), pp. 332–347.
CSL-2009-MontanariPS #decidability #logic: A Decidable Spatial Logic with Cone-Shaped Cardinal Directions (AM, GP, PS), pp. 394–408.
CSL-2009-Rabinovich #decidability #problem: Decidable Extensions of Church’s Problem (AR), pp. 424–439.
ICLP-2009-LierlerL #decidability #source code: One More Decidable Class of Finitely Ground Programs (YL, VL), pp. 489–493.
LICS-2009-BertrandGG #decidability #game studies #probability: Qualitative Determinacy and Decidability of Stochastic Games with Signals (NB, BG, HG), pp. 319–328.
LICS-2009-Kahlon #bound #communication #decidability #thread: Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks (VK), pp. 27–36.
VMCAI-2009-Maier: Deciding Extensions of the Theories of Vectors and Bags (PM), pp. 245–259.
FoSSaCS-2008-GodoyMT #decidability #morphism: Classes of Tree Homomorphisms with Decidable Preservation of Regularity (GG, SM, ST), pp. 127–141.
FoSSaCS-2008-HabermehlIV #array #decidability #integer #question #what: What Else Is Decidable about Integer Arrays? (PH, RI, TV), pp. 474–489.
DLT-2008-CsimaK #decidability #question #reachability: When Is Reachability Intrinsically Decidable? (BFC, BK), pp. 216–227.
DLT-2008-DennunzioF #2d #automaton #decidability: Decidable Properties of 2D Cellular Automata (AD, EF), pp. 264–275.
DLT-2008-Jancar #decidability #similarity: Selected Ideas Used for Decidability and Undecidability of Bisimilarity (PJ), pp. 56–71.
DLT-2008-Souza #decidability #equivalence #on the #transducer: On the Decidability of the Equivalence for k-Valued Transducers (RdS), pp. 252–263.
ICFP-2008-HornM: Deciding kCFA is complete for EXPTIME (DVH, HGM), pp. 275–282.
CAiSE-2008-QueraltT #constraints #decidability #reasoning #uml: Decidable Reasoning in UML Schemas with Constraints (AQ, ET), pp. 281–295.
SAC-2008-AnagnostopoulosAH #adaptation #data type #multi #what: Deciding what to observe next: adaptive variable selection for regression in multivariate data streams (CA, NMA, DJH), pp. 961–965.
SMT-2007-RozanovS08 #constraints #generative #logic #similarity #transitive: Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic (MR, OS), pp. 3–17.
CSL-2008-Thomas #decidability #model transformation #monad #proving: Model Transformations in Decidability Proofs for Monadic Theories (WT), pp. 23–31.
IJCAR-2008-MouraB #effectiveness #logic #set #using: Deciding Effectively Propositional Logic Using DPLL and Substitution Sets (LMdM, NB), pp. 410–425.
IJCAR-2008-SchmidtT #first-order #logic: A General Tableau Method for Deciding Description Logics, Modal Logics and Related First-Order Fragments (RAS, DT), pp. 194–209.
LICS-2008-LanesePSS #calculus #decidability #higher-order #on the #process: On the Expressiveness and Decidability of Higher-Order Process Calculi (IL, JAP, DS, AS), pp. 145–155.
RTA-2008-KojimaS #decidability #linear #reachability #term rewriting: Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (YK, MS), pp. 187–201.
RTA-2008-ThiemannGS: Deciding Innermost Loops (RT, JG, PSK), pp. 366–380.
TACAS-2007-BryantKOSSB #abstraction: Deciding Bit-Vector Arithmetic with Abstraction (REB, DK, JO, SAS, OS, BAB), pp. 358–372.
TACAS-2007-FranzleH #logic: Deciding an Interval Logic with Accumulated Durations (MF, MRH), pp. 201–215.
CAiSE-2007-BlaauboerSA #requirements #traceability: Deciding to Adopt Requirements Traceability in Practice (FB, KS, MNA), pp. 294–308.
PPDP-2007-LushmanC #decidability #problem: A larger decidable semiunification problem (BL, GVC), pp. 143–152.
CADE-2007-LynchT #automation #decidability #revisited: Automatic Decidability and Combinability Revisited (CL, DKT), pp. 328–344.
LICS-2007-MontanariP: A Contraction Method to Decide MSO Theories of Deterministic Trees (AM, GP), pp. 141–150.
RTA-2007-GodoyH #decidability #term rewriting: Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems (GG, EH), pp. 184–199.
PODS-2006-Rosati #database #decidability #finite #on the #query: On the decidability and finite controllability of query processing in databases with incomplete information (RR), pp. 356–365.
TACAS-2006-OuaknineW #decidability #logic #metric #safety: Safety Metric Temporal Logic Is Fully Decidable (JO, JW), pp. 411–425.
ICALP-v2-2006-Stirling #approach #game studies #higher-order: A Game-Theoretic Approach to Deciding Higher-Order Matching (CS), pp. 348–359.
POPL-2006-Dam #decidability #proving: Decidability and proof systems for language-based noninterference relations (MD), pp. 67–78.
CSL-2006-RabinovichT #decidability: Decidable Theories of the Ordering of Natural Numbers with Unary Predicates (AMR, WT), pp. 562–574.
IJCAR-2006-BonacinaGNRZ #decidability: Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures (MPB, SG, EN, SR, DZ), pp. 513–527.
RTA-2006-WangS #decidability #linear #termination: Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems (YW, MS), pp. 343–356.
VMCAI-2006-BradleyMS #array #decidability #question #what: What’s Decidable About Arrays? (ARB, ZM, HBS), pp. 427–442.
PODS-2005-Vansummeren #xquery: Deciding well-definedness of XQuery fragments (SV), pp. 37–48.
ESOP-2005-BusiZ #mobile #reachability: Deciding Reachability in Mobile Ambients (NB, GZ), pp. 248–262.
FoSSaCS-2005-BozgaI #decidability #on the: On Decidability Within the Arithmetic of Addition and Divisibility (MB, RI), pp. 425–439.
FoSSaCS-2005-Kaiser #confluence #decidability #term rewriting: Confluence of Right Ground Term Rewriting Systems Is Decidable (LK), pp. 470–489.
FoSSaCS-2005-MurawskiW #algol #decidability #higher-order: Third-Order Idealized Algol with Iteration Is Decidable (ASM, IW), pp. 202–218.
TACAS-2005-Marrero #using: Using BDDs to Decide CTL (WM), pp. 222–236.
STOC-2005-GafniGP #adaptation #bound #complexity #set: From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement (EG, RG, BP), pp. 714–722.
DLT-J-2004-Lohrey05 #automation #complexity #decidability #monad: Decidability and complexity in automatic monoids (ML), pp. 707–722.
ICALP-2005-AbdullaDOW #automaton #complexity #decidability: Decidability and Complexity Results for Timed Automata via Channel Machines (PAA, JD, JO, JW), pp. 1089–1101.
ICALP-2005-Laird #decidability: Decidability in Syntactic Control of Interference (JL), pp. 904–916.
ICSE-2005-ShawHO #design #education #re-engineering #what: Deciding what to design: closing a gap in software engineering education (MS, JDH, IO), pp. 607–608.
CADE-2005-HustadtKS: Deciding Monodic Fragments by Temporal Resolution (UH, BK, RAS), pp. 204–218.
CADE-2005-KuncakNR #algebra #algorithm: An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic (VK, HHN, MCR), pp. 260–277.
CADE-2005-ZhangSM #decidability #first-order: The Decidability of the First-Order Theory of Knuth-Bendix Order (TZ, HBS, ZM), pp. 131–148.
CSL-2005-Blanqui #algebra #calculus #decidability: Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations (FB), pp. 135–150.
CSL-2005-KhoussainovR #algebra #decidability: Decidability of Term Algebras Extending Partial Algebras (BK, SR), pp. 292–308.
CSL-2005-Lutz #decidability: PDL with Intersection and Converse Is Decidable (CL), pp. 413–427.
CSL-2005-Murlak #on the: On Deciding Topological Classes of Deterministic Tree Languages (FM), pp. 428–441.
LICS-2005-KieronskiO #decidability #first-order #logic: Small Substructures and Decidability Issues for First-Order Logic with Two Variables (EK, MO), pp. 448–457.
LICS-2005-OuaknineW #decidability #logic #metric #on the: On the Decidability of Metric Temporal Logic (JO, JW), pp. 188–197.
TLCA-2005-AehligMO #decidability #higher-order #monad #recursion: The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable (KA, JGdM, CHLO), pp. 39–54.
PODS-2004-Bonatti #datalog #decidability #on the #query #recursion: On the Decidability of Containment of Recursive Datalog Queries — Preliminary report (PAB), pp. 297–306.
ESOP-2004-DuckPSS #decidability #dependence #functional #type inference: Sound and Decidable Type Inference for Functional Dependencies (GJD, SLPJ, PJS, MS), pp. 49–63.
ESOP-2004-Shmatikov #analysis #composition #decidability #encryption #protocol: Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation (VS), pp. 355–369.
FoSSaCS-2004-ConfortiG #decidability: Decidability of Freshness, Undecidability of Revelation (GC, GG), pp. 105–120.
TACAS-2004-KrcalY #analysis #automaton #decidability #problem #scheduling #using: Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata (PK, WY), pp. 236–250.
PLDI-2004-CavazosEM #heuristic: Inducing heuristics to decide whether to schedule (JC, JEBM), pp. 183–194.
CIAA-2004-BordihnHK #context-free grammar #linear #problem: Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages (HB, MH, MK), pp. 68–79.
DLT-2004-Lohrey #automation #complexity #decidability #monad: Decidability and Complexity in Automatic Monoids (ML), pp. 308–320.
DLT-2004-Truthe: A Method for Deciding the Finiteness of Deterministic Tabled Picture Languages (BT), pp. 406–417.
ICALP-2004-AbadiC #equation #protocol #security: Deciding Knowledge in Security Protocols Under Equational Theories (MA, VC), pp. 46–58.
SEFM-2004-LanotteMT #decidability #parametricity #probability #security: Decidability Results for Parametric Probabilistic Transition Systems with an Application to Security (RL, AMS, AT), pp. 114–121.
CSL-2004-ImmermanRRSY #bound #decidability #logic #transitive: The Boundary Between Decidability and Undecidability for Transitive-Closure Logics (NI, AMR, TWR, SS, GY), pp. 160–174.
IJCAR-2004-BaaderGT #decidability #logic #problem #word: A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics (FB, SG, CT), pp. 183–197.
IJCAR-2004-GodoyT #term rewriting: Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure (GG, AT), pp. 91–106.
LICS-2004-OuaknineW #automaton #decidability #on the #problem: On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap (JO, JW), pp. 54–63.
LICS-2004-SeshiaB #bound #quantifier #using: Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds (SAS, REB), pp. 100–109.
PODS-2003-CaliLR #complexity #consistency #database #decidability #on the #query #semistructured data: On the decidability and complexity of query answering over inconsistent and incomplete databases (AC, DL, RR), pp. 260–271.
FoSSaCS-2003-BertrandS #decidability #model checking: Model Checking Lossy Channels Systems Is Probably Decidable (NB, PS), pp. 120–135.
TACAS-2003-FontaineG #decidability #invariant #validation: Decidability of Invariant Validation for Paramaterized Systems (PF, EPG), pp. 97–112.
DLT-2003-KlimannLMP #ambiguity #automaton: Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton (IK, SL, JM, CP), pp. 373–385.
CADE-2003-GieslK #equation #induction: Deciding Inductive Validity of Equations (JG, DK), pp. 17–31.
CADE-2003-Schmidt-Schauss #bound #decidability #higher-order: Decidability of Arity-Bounded Higher-Order Matching (MSS), pp. 488–502.
CSL-2003-AbdullaBd #game studies: Deciding Monotonic Games (PAA, AB, Jd), pp. 1–14.
ICLP-2003-Valencia03a #concurrent #constraints #decidability #ltl #programming: Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL (FDV), pp. 422–437.
LICS-2003-KuncakR #decidability #recursion #type system: Structural Subtyping of Non-Recursive Types is Decidable (VK, MCR), pp. 96–107.
LICS-2003-OuaknineW #automaton #decidability #robust: Revisiting Digitization, Robustness, and Decidability for Timed Automata (JO, JW), pp. 198–207.
LICS-2003-PitermanV #decidability #future of #stack: Micro-Macro Stack Systems: A New Frontier of Elementary Decidability for Sequential Systems (NP, MYV), p. 381–?.
RTA-2003-Comon-LundhC #decidability #encryption #first-order #logic #protocol: New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols (HCL, VC), pp. 148–164.
RTA-2003-Verma #automaton #decidability #equation: Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties (KNV), pp. 180–196.
TACAS-2002-FersmanPY #automaton #decidability #process #scheduling: Timed Automata with Asynchronous Processes: Schedulability and Decidability (EF, PP, WY), pp. 67–82.
SAS-2002-Muller-OlmS #decidability #polynomial: Polynomial Constants Are Decidable (MMO, HS), pp. 4–19.
ICALP-2002-Colcombet #decidability #first-order #graph #on the #product line #reachability: On Families of Graphs Having a Decidable First Order Theory with Reachability (TC), pp. 98–109.
ICALP-2002-Senizergues #decidability: L(A) = L(B)? Decidability Results from Complete Formal Systems (GS), p. 37.
ICALP-2002-Stirling #equivalence #recursion: Deciding DPDA Equivalence Is Primitive Recursive (CS), pp. 821–832.
CADE-2002-GeorgievaHS #decidability: A New Clausal Class Decidable by Hyperresolution (LG, UH, RAS), pp. 260–274.
CADE-2002-Larchey-Wendling #logic: Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic (DLW), pp. 94–110.
CAV-2002-StrichmanSB #satisfiability: Deciding Separation Formulas with SAT (OS, SAS, REB), pp. 209–222.
CSL-2002-BeauquierRS #decidability #logic #model checking #probability: A Logic of Probability with Decidable Model-Checking (DB, AMR, AS), pp. 306–321.
CSL-2002-Schmidt-SchaussS #bound #decidability #higher-order #unification: Decidability of Bounded Higher-Order Unification (MSS, KUS), pp. 522–536.
LICS-2002-HirschkoffLS #decidability #logic: Separability, Expressiveness, and Decidability in the Ambient Logic (DH, ÉL, DS), pp. 423–432.
LICS-2002-HodkinsonWZ #branch #decidability #first-order #logic: Decidable and Undecidable Fragments of First-Order Branching Temporal Logics (IMH, FW, MZ), pp. 393–402.
LICS-2002-LynchM #automation #decidability: Automatic Decidability (CL, BM), p. 7–?.
LICS-2002-Ong #algol #decidability #equivalence: Observational Equivalence of 3rd-Order Idealized Algol is Decidable (CHLO), pp. 245–256.
LICS-2002-Tiwari #confluence #polynomial #term rewriting: Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time (AT), p. 447–?.
RTA-2002-DoughertyW #decidability #higher-order: A Decidable Variant of Higher Order Matching (DJD, TW), pp. 340–351.
RTA-2002-OhsakiT #decidability #equation: Decidability and Closure Properties of Equational Tree Languages (HO, TT), pp. 114–128.
SAT-2002-EglyWP #on the #problem: On deciding subsumption problems (UE, SW, RP), p. 36.
SAT-2002-PorschenRS #decidability #satisfiability: X3SAT is decidable in time O(2n/5) (SP, BR, ES), p. 10.
FoSSaCS-2001-DurandM #call-by #composition #on the: On the Modularity of Deciding Call-by-Need (ID, AM), pp. 199–213.
FoSSaCS-2001-Stirling #decidability #parallel #process #set #similarity: Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes (CS), pp. 379–393.
STOC-2001-SchaeferS #decidability #graph #string: Decidability of string graphs (MS, DS), pp. 241–246.
ICALP-2001-DiekertM #commutative #decidability #equation: Solvability of Equations in Free Partially Commutative Groups Is Decidable (VD, AM), pp. 543–554.
ICALP-2001-MargaraS #decidability #graph #network: Decidable Properties of Graphs of All-Optical Networks (LM, JS), pp. 518–529.
CSL-2001-BoerE #decidability #logic #navigation: Decidable Navigation Logics for Object Structures (FSdB, RMvE), pp. 324–338.
CSL-2001-CharatonikT #decidability #mobile #model checking: The Decidability of Model Checking Mobile Ambients (WC, JMT), pp. 339–354.
IJCAR-2001-BoigelotJW #automaton #integer #linear #on the: On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables (BB, SJ, PW), pp. 611–625.
IJCAR-2001-GieslK #decidability #induction #theorem: Decidable Classes of Inductive Theorems (JG, DK), pp. 469–484.
IJCAR-2001-GiunchigliaNT #named #quantifier #satisfiability: QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability (EG, MN, AT), pp. 364–369.
IJCAR-2001-Lucke #named #set: Hilberticus — A Tool Deciding an Elementary Sublanguage of Set Theory (JL), pp. 690–695.
IJCAR-2001-LynchM #complexity #decidability #equation #linear: Decidability and Complexity of Finitely Closable Linear Equational Theories (CL, BM), pp. 499–513.
LICS-2001-Ganzinger #concept #decidability #problem #semantics #word: Relating Semantic and Proof-Theoretic Concepts for Polynominal Time Decidability of Uniform Word Problems (HG), pp. 81–90.
TLCA-2001-KnapikNU #algebra #monad: Deciding Monadic Theories of Hyperalgebraic Trees (TK, DN, PU), pp. 253–267.
STOC-2000-MotwaniPSV #decidability #on the #problem: On the decidability of accessibility problems (extended abstract) (RM, RP, VAS, SV), pp. 306–315.
ICALP-2000-LugiezS #decidability #first-order #logic: Decidable First-Order Transition Logics for PA-Processes (DL, PS), pp. 342–353.
ICALP-2000-Urbanski #automaton #on the: On Deciding if Deterministic Rabin Language Is in Büchi Class (TFU), pp. 663–674.
KR-2000-Voronkov #using: Deciding K using inverse-K (AV), pp. 198–209.
POPL-2000-StoneH #equivalence: Deciding Type Equivalence with Singleton Kinds (CAS, RH), pp. 214–227.
CL-2000-LehmannL #calculus #decidability: Decidability Results for the Propositional Fluent Calculus (HL, ML), pp. 762–776.
CL-2000-NarendranR #decidability #formal method: The Theory of Total Unary RPO Is Decidable (PN, MR), pp. 660–672.
CL-2000-Pliuskevicius #deduction #on the #strict: On an ω-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL (RP), pp. 523–537.
LICS-2000-LindellW #decidability #finite #first-order: The Role of Decidability in First Order Separations over Classes of Finite Structures (SL, SW), pp. 45–50.
VLDB-1999-LeeL #termination: Unrolling Cycles to Decide Trigger Termination (SYL, TWL), pp. 483–493.
ESOP-1999-BenediktRS #data type #decidability #linked data #logic #open data: A Decidable Logic for Describing Linked Data Structures (MB, TWR, SS), pp. 2–19.
DLT-1999-AndreBC #bound #decidability #on the #query: On decidability of boundedness property for regular path queries (YA, FB, ACC), pp. 245–256.
DLT-1999-FernauR #decidability: Decidability of code properties (HF, KR, LS), pp. 153–163.
ICALP-1999-CortierGJV #decidability #reachability: Decidable Fragments of Simultaneous Rigid Reachability (VC, HG, FJ, MV), pp. 250–260.
ICALP-1999-FrickG #first-order #graph: Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs (MF, MG), pp. 331–340.
ICALP-1999-HirshfeldJ #algebra #bisimulation #decidability #process: Bisimulation Equivanlence Is Decidable for Normed Process Algebra (YH, MJ), pp. 412–421.
ICALP-1999-HirshfeldR #decidability #framework #logic: A Framework for Decidable Metrical Logics (YH, AMR), pp. 422–432.
POPL-1999-KfouryW #decidability #type inference: Principality and Decidable Type Inference for Finite-Rank Intersection Types (AJK, JBW), pp. 161–174.
SOSP-1999-SantryFHVCO #file system: Deciding when to forget in the Elephant file system (DSS, MJF, NCH, ACV, RWC, JO), pp. 110–123.
CADE-1999-Schmidt-SchaussS #decidability #equation: Solvability of Context Equations with Two Context Variables is Decidable (MSS, KUS), pp. 67–81.
CADE-1999-Sofronie-Stokkermans #complexity #decidability #on the: On the Universal Theory of Varieties of Distributive Lattices with Operators: Some Decidability and Complexity Results (VSS), pp. 157–171.
CAV-1999-PnueliRSS #similarity: Deciding Equality Formulas by Small Domains Instantiations (AP, YR, OS, MS), pp. 455–469.
RTA-1999-BaaderT #equation #problem #word: Deciding the Word Problem in the Union of Equational Theories Sharing Constructors (FB, CT), pp. 175–189.
RTA-1999-CaronSTT #quantifier #satisfiability: Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting (ACC, FS, ST, MT), pp. 103–117.
RTA-1999-LimetR #decidability: A New Result about the Decidability of the Existential One-Step Rewriting Theory (SL, PR), pp. 118–132.
RTA-1999-NagayaT #decidability #term rewriting: Decidability for Left-Linaer Growing Term Rewriting Systems (TN, YT), pp. 256–270.
PODS-1998-BaileyDR #database #decidability #problem #termination: Decidability and Undecidability Results for the Termination Problem of Active Database Rules (JB, GD, KR), pp. 264–273.
PODS-1998-CalvaneseGL #constraints #decidability #on the #query: On the Decidability of Query Containment under Constraints (DC, GDG, ML), pp. 149–158.
PODS-1998-NuttSS #query: Deciding Equivalences Among Aggregate Queries (WN, YS, SS), pp. 214–223.
FoSSaCS-1998-MuschollPS #sequence chart: Deciding Properties for Message Sequence Charts (AM, DP, ZS), pp. 226–242.
ICALP-1998-AlurMP #partial order: Deciding Global Partial-Order Properties (RA, KLM, DP), pp. 41–52.
ICALP-1998-DufourdFS #decidability: Reset Nets Between Decidability and Undecidability (CD, AF, PS), pp. 103–115.
ICALP-1998-JancarKM #bisimulation #finite #process: Deciding Bisimulation-Like Equivalences with Finite-State Processes (PJ, AK, RM), pp. 200–211.
ICALP-1998-Zakharov #approach #decidability #equivalence #performance #source code: An Efficient and Unified Approach to the Decidability of Equivalence of Propositional Programs (VAZ), pp. 247–258.
KR-1998-WolterZ #decidability #logic #on the: On the Decidability of Description Logics with Modal Operators (FW, MZ), pp. 512–523.
CSL-1998-RicheM #complexity #decidability: Belnap, Urquhart and Relevant Decidability & Complexity. “Das ist nicht Mathematik, das ist Theologie.” (JR, RKM), pp. 224–240.
RTA-1998-DegtyarevGNVV #decidability: The Decidability of Simultaneous Rigid E-Unification with One Variable (AD, YG, PN, MV, AV), pp. 181–195.
RTA-1998-Genet #approximate #decidability #normalisation #set: Decidable Approximations of Sets of Descendants and Sets of Normal Forms (TG), pp. 151–165.
RTA-1998-Levy #decidability #higher-order #problem #unification: Decidable and Undecidable Second-Order Unification Problems (JL), pp. 47–60.
RTA-1998-Waldmann #decidability #normalisation: Normalization of S-Terms is Decidable (JW), pp. 138–150.
PODS-1997-GuchtDGV #algebra #database #decidability #on the #set: On the Decidability of Semi-Linearity of Semi-Algebraic Sets and Its Implications for Spatial Databases (FD, MG, LV, DVG), pp. 68–77.
PODS-1997-LevyS #query: Deciding Containment for Queries with Complex Objects (AYL, DS), pp. 20–31.
STOC-1997-HerlihyR #decidability #distributed: The Decidability of Distributed Decision Tasks (Extended Abstract) (MH, SR), pp. 589–598.
DLT-1997-MateescuSY #context-free grammar #decidability: Decidability of fairness for context-free languages (AM, KS, SY), pp. 351–364.
ICALP-1997-Jancar #bisimulation #decidability #equivalence #process: Bisimulation Equivalence is Decidable for One-Counter Processes (PJ), pp. 549–559.
ICALP-1997-Senizergues #automaton #decidability #equivalence #problem: The Equivalence Problem for Deterministic Pushdown Automata is Decidable (GS), pp. 671–681.
WIA-1997-Ponty #performance #regular expression: An Efficient Null-Free Procedure for Deciding Regular Language Membership (JLP), pp. 159–170.
CADE-1997-DurandM #call-by #decidability #term rewriting: Decidable Call by Need Computations in term Rewriting (Extended Abstract) (ID, AM), pp. 4–18.
CADE-1997-KornK #logic: Deciding Intuitionistic Propositional Logic via Translation into Classical Logic (DSK, CK), pp. 131–145.
CAV-1997-Fisler #decidability #diagrams #regular expression: Containing of Regular Languages in Non-Regular Timing Diagram Languages is Decidable (KF), pp. 155–166.
LICS-1997-GradelOR #decidability #logic: Two-Variable Logic with Counting is Decidable (EG, MO, ER), pp. 306–317.
LICS-1997-Vorobyov #decidability: The “Hardest” Natural Decidable Theory (SGV), pp. 294–305.
RTA-1997-OttoKK #decidability #monad #problem #word: Cross-Sections for Finitely Presented Monoids with Decidable Word Problems (FO, MK, YK), pp. 53–67.
SAS-1996-RouxR #automaton #decidability #hybrid: Uniformity for the Decidability of Hybrid Automata (OFR, VR), pp. 301–316.
ICALP-1996-BosscherG #decidability #process #scalability: Regularity for a Large Class of Context-Free Processes is Decidable (DJBB, WODG), pp. 182–193.
ICALP-1996-Caucal #decidability #graph #infinity #monad #on the: On Infinite Transition Graphs Having a Decidable Monadic Theory (DC), pp. 194–205.
ICALP-1996-JancarE #bisimulation #petri net: Deciding Finiteness of Petri Nets Up To Bisimulation (PJ, JE), pp. 478–489.
ALP-1996-FassbenderM #decidability #recursion #strict: A Strict Border for the Decidability of E-Unification for Recursive Functions (HF, SM), pp. 194–208.
PLILP-1996-Ruggieri #decidability #logic programming #semantics #testing: Decidability of Logic Program Semantics and Applications to Testing (SR), pp. 347–362.
CADE-1996-Weidenbach #decidability #pseudo #unification: Unification in Pseudo-Linear Sort Theories is Decidable (CW), pp. 343–357.
CSL-1996-KozenS #algebra #decidability #testing: Kleene Algebra with Tests: Completeness and Decidability (DK, FS), pp. 244–259.
CSL-1996-Setzer #decidability #induction: Inductive Definitions with Decidable Atomic Formulas (AS), pp. 414–430.
LICS-1996-AbdullaCJT #decidability #infinity #theorem: General Decidability Theorems for Infinite-State Systems (PAA, KC, BJ, YKT), pp. 313–321.
LICS-1996-DegtyarevV #decidability #logic #problem: Decidability Problems for the Prenex Fragment of Intuitionistic Logic (AD, AV), pp. 503–512.
LICS-1996-Nieuwenhuis #decidability: Basic Paramodulation and Decidable Theories (Extended Abstract) (RN), pp. 473–482.
RTA-1996-Jacquemard #approximate #decidability #term rewriting: Decidable Approximations of Term Rewriting Systems (FJ), pp. 362–376.
STOC-1995-HenzingerKPV #automaton #decidability #hybrid #question #what: What’s decidable about hybrid automata? (TAH, PWK, AP, PV), pp. 373–382.
POPL-1995-CastagnaP #bound #decidability #named #quantifier: Corrigendum: Decidable Bounded Quantification (GC, BCP), p. 408.
POPL-1995-Vorobyov #bound #decidability #quantifier: Structural Decidable Extensions of Bounded Quantification (SGV), pp. 164–175.
LICS-1995-Kopylov #decidability #linear #logic: Decidability of Linear Affine Logic (APK), pp. 496–504.
RTA-1995-SchmidF #performance #testing #towards: Towards an Efficient Construction of Test Sets for Deciding Ground Reducability (KS, RF), pp. 86–100.
TLCA-1995-KurataT #decidability #type system: Decidable Properties of Intersection Type Systems (TK, MT), pp. 297–311.
ICALP-1994-Cerans #automaton #relational: Deciding Properties of Integral Relational Automata (KC), pp. 35–46.
TAGT-1994-Klempien-Hinrichs #confluence #decidability #simulation: Node Replacement in Hypergrahps: Simulation of Hyperedge Replacement, and Decidability of Confluence (RKH), pp. 397–411.
KR-1994-LakemeyerM #decidability #first-order #power of: Enhancing the Power of a Decidable First-Order Reasoner (GL, SM), pp. 403–414.
OOPSLA-1994-EifrigSTZ #decidability #object-oriented #type system: Application of OOP Type Theory: State, Decidability, Integragtion (JE, SFS, VT, AEZ), pp. 16–30.
POPL-1994-CastagnaP #bound #decidability #quantifier: Decidable Bounded Quantification (GC, BCP), pp. 151–162.
HPDC-1994-Benslimane #bound #communication #finite #state machine: Deciding Boundedness for Systems of Two Communicating Finite State Machines (AB), pp. 262–269.
CADE-1994-Prehofer #decidability #higher-order #problem #unification: Decidable Higher-Order Unification Problems (CP), pp. 635–649.
CAV-1994-McManisV #automaton #decidability #hybrid: Suspension Automata: A Decidable Class of Hybrid Automata (JM, PV), pp. 105–117.
CAV-1994-PuriV #decidability #difference #hybrid: Decidability of Hybrid Systems with Rectangular Differential Inclusion (AP, PV), pp. 95–104.
DLT-1993-Raz #context-free grammar #equivalence #multi: Deciding Multiplicity Equivalence for Certain Context-free Languages (DR), pp. 18–29.
ICALP-1993-IbarraJTW #decidability: New Decidability Results Concerning Two-way Counter Machines and Applications (OHI, TJ, NQT, HW), pp. 313–324.
ICALP-1993-JategaonkarM #concurrent #finite: Deciding True Concurrency Equivalences on Finite Sate Nets (Preliminary Report) (LJ, ARM), pp. 519–531.
ICALP-1993-LodayaT #decidability #logic #partial order: Decidability of a Partial Order Based Temporal Logic (KL, PST), pp. 582–592.
OOPSLA-1993-BruceCMGDM #decidability #object-oriented #type checking: Safe and Decidable Type Checking in an Object-Oriented Language (KBB, JC, TPM, RvG, AD, RM), pp. 29–46.
RTA-1993-Tajine #decidability #equation: The Negation Elimination from Syntactic Equational Formula is Decidable (MT), pp. 316–327.
ESOP-1992-OKeefeW #decidability #type inference: Type Inference for Partial Types is Decidable (PO, MW), pp. 408–417.
CADE-1992-DershowitzMS #convergence #decidability: Decidable Matching for Convergent Systems (Preliminary Version) (ND, SM, GS), pp. 589–602.
CAV-1992-Cerans #bisimulation #decidability #parallel #process: Decidability of Bisimulation Equivalences for Parallel Timer Processes (KC), pp. 302–315.
LICS-1992-ComonHJ #decidability #equation #problem: Decidable Problems in Shallow Equational Theories (Extended Abstract) (HC, MH, JPJ), pp. 255–265.
LICS-1992-Dowek #decidability #higher-order: Third Order Matching is Decidable (GD), pp. 2–10.
ICALP-1991-DiekertOR #complexity #confluence #decidability #on the: On Confluent Semi-Commutations — Decidability and Complexity Results (VD, EO, KR), pp. 229–241.
ICALP-1991-JouannaudO #decidability #satisfiability: Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable (JPJ, MO), pp. 455–468.
ICALP-1991-Vogler #similarity: Deciding History Preserving Bisimilarity (WV), pp. 495–505.
CAV-1991-HolmerLY #process #realtime: Deciding Properties of Regular Real Time Processes (UH, KGL, WY), pp. 443–453.
CAV-1991-Huttel #branch #decidability #process #similarity: Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes (HH), pp. 2–12.
RTA-1991-Salomaa #confluence #decidability #monad #term rewriting #termination: Decidability of Confluence and Termination of Monadic Term Rewriting Systems (KS), pp. 275–286.
STOC-1990-BorodinT #decidability #on the #polynomial: On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version) (AB, PT), pp. 535–545.
STOC-1990-HarjuK #automaton #decidability #equivalence #finite #multi: Decidability of the Multiplicity Equivalence of Multitape Finite Automata (TH, JK), pp. 477–481.
ICALP-1990-Choffrut #decidability: Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case (CC), pp. 490–500.
ICALP-1990-Riecke #call-by #decidability #proving: A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report) (JGR), pp. 20–31.
POPL-1990-Mairson #exponential #ml: Deciding ML Typability is Complete for Deterministic Exponential Time (HGM), pp. 382–401.
CADE-1990-Schwind #decidability #logic #proving #set #theorem proving: A Tableau-Based Theorem Prover for a Decidable Subset of Default Logic (CS), pp. 528–542.
CSL-1990-Fermuller #set: A Resolution Variant Deciding some Classes of Clause Sets (CGF), pp. 128–144.
LICS-1990-DauchetT #decidability #formal method #term rewriting: The Theory of Ground Rewrite Systems is Decidable (MD, ST), pp. 242–248.
LICS-1990-EmersonES #decidability #on the #performance: On the Limits of Efficient Temporal Decidability (Extended Abstract) (EAE, ME, JS), pp. 464–475.
CSL-1989-Leitsch: Deciding Horn Classes by Hyperresolution (AL), pp. 225–241.
RTA-1989-Tison #decidability #termination: Fair Termination is Decidable for Ground Systems (ST), pp. 462–476.
PODS-1988-KiferRS #approach #axiom #database #deduction #query #safety: An Axiomatic Approach to Deciding Query Safety in Deductive Databases (MK, RR, AS), pp. 52–60.
PODS-1988-Vardi #bound #decidability #linear #query #recursion: Decidability and Undecidability Results for Boundedness of Linear Recursive Queries (MYV), pp. 341–351.
STOC-1988-CosmadakisGKV #database #decidability #logic programming #optimisation #problem #source code: Decidable Optimization Problems for Database Logic Programs (Preliminary Report) (SSC, HG, PCK, MYV), pp. 477–490.
ICALP-1988-Culik #decidability #equivalence #problem #proving: New Techniques for Proving the Decidability of Equivalence Problems (KCI), pp. 162–175.
ICALP-1988-Turakainen #decidability #equivalence: The Equivalence of DGSM Replications on Q-Rational Languages is Decidable (PT), pp. 654–666.
LICS-1988-MullerSS #automaton #decidability #exponential #logic #why: Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time (DEM, AS, PES), pp. 422–427.
PODS-1987-NaughtonS #bound #decidability #recursion: A Decidable Class of Bounded Recursions (JFN, YS), pp. 227–236.
PODS-1987-Shmueli #decidability #logic #query: Decidability and Expressiveness of Logic Queries (OS), pp. 237–249.
CSL-1987-RehrmannP #equivalence #problem: Deciding the Path- and Word-Fair Equivalence Problem (RR, LP), pp. 211–222.
LICS-1987-DauchetTHL #confluence #decidability #term rewriting: Decidability of the Confluence of Ground Term Rewriting Systems (MD, ST, TH, PL), pp. 353–359.
RTA-1987-BurckertHS #decidability #equation #on the #unification: On Equational Theories, Unification and Decidability (HJB, AH, MSS), pp. 204–215.
PODS-1986-AbiteboulV #transaction: Deciding Properties of Transactional Schemas (SA, VV), pp. 235–239.
ICALP-1986-RosierY #complexity #concurrent #finite #on the #probability #source code #termination: On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs (LER, HCY), pp. 334–343.
LICS-1986-PerrinS #automaton #decidability #equivalence #integer #monad: Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories (DP, PES), pp. 301–304.
RTA-1985-Otto #algebra #finite #monad: Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems (FO), pp. 95–106.
STOC-1984-EmersonS #branch #logic: Deciding Branching Time Logic (EAE, APS), pp. 14–24.
ICALP-1984-ChazelleOSW #complexity #decidability: The Complexity and Decidability of Separation (BC, TO, ESS, DW), pp. 119–127.
STOC-1983-Feldman #decidability #logic #probability: A Decidable Propositional Probabilistic Dynamic Logic (YAF), pp. 298–309.
STOC-1982-Kosaraju #decidability #reachability: Decidability of Reachability in Vector Addition Systems (Preliminary Version) (SRK), pp. 267–281.
CADE-1982-Shostak: Deciding Combinations of Theories (RES), pp. 209–222.
STOC-1981-CulikH #decidability #equivalence #problem: The ω-Sequence Equivalence Problem for DOL Systems Is Decidable (KCI, TH), pp. 1–6.
ICALP-1981-HeintzS #decidability #polynomial #random: Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables (JH, MS), pp. 16–28.
POPL-1981-Pratt #decidability #logic: Program Logic Without Binding is Decidable (VRP), pp. 159–163.
STOC-1980-KannanL #decidability #problem: The Orbit Problem is Decidable (RK, RJL), pp. 252–261.
CADE-1980-Jeanrond #algebra #term rewriting #termination: Deciding Unique Termination of Permutative Rewriting Systems: Choose Your Term Algebra Carefully (HJJ), pp. 335–355.
ICALP-1979-Wegner #approach #decidability #two-level grammar: Bracketed Two-Level Grammars — A Decidable and Practical Approach to Language Definitions (LMW), pp. 668–682.
STOC-1977-SacerdoteT #decidability #problem #reachability: The Decidability of the Reachability Problem for Vector Addition Systems (Preliminary Version) (GSS, RLT), pp. 61–76.
ICALP-1977-CulikF #decidability #equivalence #problem #sequence: The Sequence Equivalence Problem for D0L Systems is Decidable (KCI, IF), pp. 148–163.
ICALP-1977-Walter #context-free grammar #decidability #equivalence: Structural Equivalence of Context-Free Grammar Forms is Decidable (HKGW), pp. 539–553.
ICALP-1976-Valiant #decidability #equivalence #problem: The Equivalence Problem for DOL Systems and its Decidability for Binary Alphabets (LGV), pp. 31–37.
STOC-1974-Valiant #automaton #decidability #equivalence: The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata (LGV), pp. 27–32.
ICALP-1974-Bertsch #decidability: A Decidability Result for Sequential Grammars (EB), pp. 577–583.
ICALP-1974-Mehlhorn #decidability #recursion: The “Almost All” Theory of Subrecursive Degrees is Decidable (KM), pp. 317–325.
STOC-1972-ConstableM #decidability #equivalence #problem #recursion: Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems (RLC, SSM), pp. 1–17.