BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
logic (51)
system (39)
theori (38)
problem (36)
order (35)

Stem decid$ (all stems)

381 papers:

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

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.