Stem infinit$ (all stems)

267 papers:

TACAS-2015-CookKP #infinity

Fairness for Infinite-State Systems (BC, HK, NP), pp. 384–398.

CIAA-2015-HoffmannS #infinity #metric #word

Subword Metrics for Infinite Words (SH, LS), pp. 165–175.

DLT-2015-AvgustinovichFP #complexity #infinity #permutation

Ergodic Infinite Permutations of Minimal Complexity (SVA, AEF, SP), pp. 71–84.

DLT-2015-CzybaST #automaton #finite #infinity #modelling

Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (CC, CS, WT), pp. 203–214.

DLT-2015-KlimannPS #automaton #infinity

A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group (IK, MP, DS), pp. 313–325.

ICALP-v1-2015-FullaZ #constraints #infinity

A Galois Connection for Valued Constraint Languages of Infinite Size (PF, SZ), pp. 517–528.

ICALP-v2-2015-Finkel #automaton #infinity #scalability #theorem #word

Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words (OF), pp. 222–233.

ICALP-v2-2015-Klein0 #game studies #how #infinity #lookahead #question

How Much Lookahead is Needed to Win Infinite Games? (FK, MZ), pp. 452–463.

ICML-2015-CarpentierV #infinity

Simple regret for infinitely many armed bandits (AC, MV), pp. 1133–1141.

PPDP-2015-RondogiannisT #logic programming #using

Expressing preferences in logic programming using an infinite-valued logic (PR, AT), pp. 208–219.

CAV-2015-CookKP #automation #infinity #on the #verification

On Automation of CTL* Verification for Infinite-State Systems (BC, HK, NP), pp. 13–29.

CSL-2015-KuskeLM #decidability #infinity #monad #word

Infinite and Bi-infinite Words with Decidable Monadic Theories (DK, JL, AM), pp. 472–486.

LICS-2015-DasR #axiom #infinity

A Complete Axiomatization of MSO on Infinite Trees (AD, CR), pp. 390–401.

VMCAI-2015-BackesR #abstraction #analysis #clustering #graph transformation #infinity

Analysis of Infinite-State Graph Transformation Systems by Cluster Abstraction (PB, JR), pp. 135–152.

VLDB-2014-KellarisPXP #infinity #sequence

Differentially Private Event Sequences over Infinite Streams (GK, SP, XX, DP), pp. 1155–1166.

WRLA-2014-BaeM #infinity #model checking #using

Infinite-State Model Checking of LTLR Formulas Using Narrowing (KB, JM), pp. 113–129.

STOC-2014-CoudronY #constant #infinity

Infinite randomness expansion with a constant number of devices (MC, HY), pp. 427–436.

AFL-2014-DuS #infinity #similarity #word

Similarity density of the Thue-Morse word with overlap-free infinite binary words (CFD, JS), pp. 231–245.

AFL-2014-Loding #automaton #infinity #problem #word

Decision Problems for Deterministic Pushdown Automata on Infinite Words (CL), pp. 55–73.

CIAA-2014-PittouR #automaton #infinity

Weighted Variable Automata over Infinite Alphabets (MP, GR), pp. 304–317.

DLT-2014-DickyJ #finite #infinity #word

Embedding Finite and Infinite Words into Overlapping Tiles — (Short Paper) (AD, DJ), pp. 339–347.

ICALP-v2-2014-BlondinFM #branch #infinity

Handling Infinitely Branching WSTS (MB, AF, PM), pp. 13–25.

ICALP-v2-2014-Bojanczyk14a #infinity #quantifier

Weak MSO+U with Path Quantifiers over Infinite Trees (MB), pp. 38–49.

ICALP-v2-2014-BojanczykGMS #decidability #infinity #on the

On the Decidability of MSO+U on Infinite Trees (MB, TG, HM, MS), pp. 50–61.

LATA-2014-DrosteD #automaton #infinity #logic #word

Weighted Automata and Logics for Infinite Nested Words (MD, SD), pp. 323–334.

ICML-c1-2014-ZhangZZ #infinity #markov #modelling

Max-Margin Infinite Hidden Markov Models (AZ, JZ, BZ), pp. 315–323.

ICML-c2-2014-KnowlesGP #infinity #metric #normalisation #random #using

A reversible infinite HMM using normalised random measures (DAK, ZG, KP), pp. 1998–2006.

ICPR-2014-BargiXP #adaptation #classification #infinity #learning #online #segmentation #streaming

An Infinite Adaptive Online Learning Model for Segmentation and Classification of Streaming Data (AB, RYDX, MP), pp. 3440–3445.

POPL-2014-BeyeneCPR #approach #constraints #game studies #graph #infinity

A constraint-based approach to solving games on infinite graphs (TAB, SC, CP, AR), pp. 221–234.

FSE-2014-LiYP0H #finite #infinity #ltl #named #satisfiability

Aalta: an LTL satisfiability checker over Infinite/Finite traces (JL, YY, GP, LZ, JH), pp. 731–734.

FSE-2014-VakiliD #infinity #modelling #smt #using #verification

Verifying CTL-live properties of infinite state models using an SMT solver (AV, NAD), pp. 213–223.

LICS-CSL-2014-AbdullaAHMKT #energy #game studies #infinity

Infinite-state energy games (PAA, MFA, PH, RM, KNK, PT), p. 10.

LICS-CSL-2014-BlumensathCKPB #automaton #infinity #logic

Two-way cost automata and cost logics over infinite trees (AB, TC, DK, PP, MVB), p. 9.

LICS-CSL-2014-Khoussainov #infinity #random

A quest for algorithmically random infinite structures (BK), p. 9.

LICS-CSL-2014-RouxP #game studies #infinity

Infinite sequential games with real-valued payoffs (SLR, AP), p. 10.

ICALP-v1-2013-Velner #complexity #game studies #infinity

The Complexity of Infinitely Repeated Alternating Move Games (YV), pp. 816–827.

LATA-2013-Etessami #algorithm #infinity #probability #recursion #verification

Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems (KE), p. 12.

LATA-2013-Smith #bound

Infiniteness and Boundedness in 0L, DT0L, and T0L Systems (TS), pp. 535–546.

ICML-c1-2013-ZhaiB #infinity #online

Online Latent Dirichlet Allocation with Infinite Vocabulary (KZ, JLBG), pp. 561–569.

ICML-c3-2013-Chatzis #infinity

Infinite Markov-Switching Maximum Entropy Discrimination Machines (SC), pp. 729–737.

ICML-c3-2013-YoshiiTMG #infinity

Infinite Positive Semidefinite Tensor Factorization for Source Separation of Mixture Signals (KY, RT, DM, MG), pp. 576–584.

QAPL-2013-BertrandS #automaton #game studies #infinity #probability

Solving Stochastic Büchi Games on Infinite Decisive Arenas (NB, PS), pp. 116–131.

POPL-2013-AbelPTS #infinity #named #pattern matching #programming

Copatterns: programming infinite structures by observations (AA, BP, DT, AS), pp. 27–38.

CSL-2013-BilkowskiS #ambiguity #infinity #problem

Unambiguity and uniformization problems on infinite trees (MB, MS), pp. 81–100.

CSL-2013-ChatterjeeF #game studies #infinity

Infinite-state games with finitary conditions (KC, NF), pp. 181–196.

LICS-2013-Riba #infinity #word

Forcing MSO on Infinite Words in Weak MSO (CR), pp. 448–457.

RTA-2013-BaeEM #infinity #logic #model checking #using

Abstract Logical Model Checking of Infinite-State Systems Using Narrowing (KB, SE, JM), pp. 81–96.

DLT-J-2011-ChaturvediOT12 #game studies #infinity

Languages versus ω-Languages in Regular Infinite Games (NC, JO, WT), pp. 985–1000.

DLT-J-2011-DiekertM12 #infinity #word

Group Extensions over Infinite Words (VD, AGM), pp. 1001–1020.

ICALP-v2-2012-BojanczykP #infinity #regular expression #set

Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (MB, TP), pp. 104–115.

ICALP-v2-2012-KuperbergB #infinity #logic #on the #power of #word

On the Expressive Power of Cost Logics over Infinite Words (DK, MVB), pp. 287–298.

ICFP-2012-EndrullisHB #complexity #equivalence #infinity #on the #specification

On the complexity of equivalence of specifications of infinite objects (JE, DH, RB), pp. 153–164.

ICGT-2012-GadducciLV #approximate #infinity #modelling

Exploiting Over- and Under-Approximations for Infinite-State Counterpart Models (FG, ALL, AV), pp. 51–65.

ICML-2012-PallaKG #infinity #network

An Infinite Latent Attribute Model for Network Data (KP, DAK, ZG), p. 55.

ICML-2012-Rakotomamonjy #infinity

Sparse Support Vector Infinite Push (AR), p. 48.

ICML-2012-XuYQ #composition #data analysis #infinity #modelling #multi #parametricity

Infinite Tucker Decomposition: Nonparametric Bayesian Models for Multiway Data Analysis (ZX, FY, AQ), p. 218.

KDIR-2012-MiaoLWZ #infinity #modelling #process #semantics #topic #wiki

Infinite Topic Modelling for Trend Tracking — Hierarchical Dirichlet Process Approaches with Wikipedia Semantic based Method (YM, CL, HW, LZ), pp. 35–44.

MoDELS-2012-CombemaleTB #infinity #modelling

Formally Defining and Iterating Infinite Models (BC, XT, BB), pp. 119–133.

MoDELS-2012-CombemaleTB #infinity #modelling

Formally Defining and Iterating Infinite Models (BC, XT, BB), pp. 119–133.

OOPSLA-2012-KlingMCR #infinity #named #on-demand

Bolt: on-demand infinite loop escape in unmodified binaries (MK, SM, MC, MCR), pp. 431–450.

ICLP-2012-SatoM #infinity #probability

Tabling for infinite probability computation (TS, PM), pp. 348–358.

LICS-2012-AlurFT #infinity #string

Regular Transformations of Infinite Strings (RA, EF, AT), pp. 65–74.

LICS-2012-ChatterjeeT #automaton #decidability #infinity #probability #problem #word

Decidable Problems for Probabilistic Automata on Infinite Words (KC, MT), pp. 185–194.

VMCAI-2012-BouajjaniDES #abstract domain #automation #infinity #reasoning #source code

Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data (AB, CD, CE, MS), pp. 1–22.

AFL-2011-BorgwardtP #automaton #infinity #problem

The Inclusion Problem for Weighted Automata on Infinite Trees (SB, RP), pp. 108–122.

AFL-2011-Choffrut #finite #infinity #on the #word

On relations of finite words over infinite alphabets (CC), pp. 25–27.

DLT-2011-ChaturvediOT #game studies #infinity

Languages vs. ω-Languages in Regular Infinite Games (NC, JO, WT), pp. 180–191.

DLT-2011-DiekertM #infinity #problem #word

Solving Word Problems in Group Extensions over Infinite Words (VD, AGM), pp. 192–203.

DLT-2011-PelantovaS #infinity #word

Infinite Words Rich and Almost Rich in Generalized Palindromes (EP, SS), pp. 406–416.

ICML-2011-DoshiWTR #infinity #network

Infinite Dynamic Bayesian Networks (FD, DW, JBT, NR), pp. 913–920.

ICML-2011-LiuLC #infinity #policy #representation

The Infinite Regionalized Policy Representation (ML, XL, LC), pp. 769–776.

ICML-2011-ZhangDC #infinity

Tree-Structured Infinite Sparse Factor Model (XZ, DBD, LC), pp. 785–792.

ICML-2011-ZhuCX #infinity #kernel #process

Infinite SVM: a Dirichlet Process Mixture of Large-margin Kernel Machines (JZ, NC, EPX), pp. 617–624.

ECOOP-2011-CarbinMKR #detection #infinity

Detecting and Escaping Infinite Loops with Jolt (MC, SM, MK, MCR), pp. 609–633.

QAPL-2011-AndreychenkoCW #infinity #markov #modelling #on the fly

On-the-fly Uniformization of Time-Inhomogeneous Infinite Markov Population Models (AA, PC, VW), p. 1.

CSL-2011-FridmanLZ #game studies #infinity #lookahead

Degrees of Lookahead in Context-free Infinite Games (WF, CL, MZ), pp. 264–276.

LICS-2011-KufleitnerL #infinity #word

Languages of Dot-Depth One over Infinite Words (MK, AL), pp. 23–32.

FoSSaCS-2010-HoltmannKT #game studies #infinity #lookahead

Degrees of Lookahead in Regular Infinite Games (MH, LK, WT), pp. 252–266.

FoSSaCS-2010-ToL #algorithm #decidability #infinity #ltl #model checking

Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems (AWT, LL), pp. 221–236.

FoSSaCS-2010-TsukadaK #infinity #recursion

Untyped Recursion Schemes and Infinite Intersection Types (TT, NK), pp. 343–357.

TACAS-2010-DragerKFW #concurrent #infinity #model checking #named

SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems (KD, AK, BF, HW), pp. 271–274.

TACAS-2010-HahnHWZ #abstraction #infinity #modelling #named #probability #refinement

PASS: Abstraction Refinement for Infinite Probabilistic Models (EMH, HH, BW, LZ), pp. 353–357.

CIAA-2010-ForysOB #automaton #infinity

Symbolic Dynamics, Flower Automata and Infinite Traces (WF, PO, SB), pp. 135–142.

DLT-2010-DartoisKL #infinity #word

Rankers over Infinite Words (Extended Abstract) (LD, MK, AL), pp. 148–159.

DLT-2010-Staiger #finite #infinity #word

Joint Topologies for Finite and Infinite Words (LS), pp. 442–443.

LATA-2010-GrumbergKS #automaton #infinity

Variable Automata over Infinite Alphabets (OG, OK, SS), pp. 561–572.

KDIR-2010-ParviainenRML #approximate #infinity #learning #network

Interpreting Extreme Learning Machine as an Approximation to an Infinite Neural Network (EP, JR, YM, AL), pp. 65–73.

KR-2010-CeramiEB #decidability #logic

Decidability of a Description Logic over Infinite-Valued Product Logic (MC, FE, FB).

LOPSTR-2010-FioravantiPPS #evaluation #infinity #verification

Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation (FF, AP, MP, VS), pp. 164–183.

CSL-2010-CarraroES #exponential #infinity #multi

Exponentials with Infinite Multiplicities (AC, TE, AS), pp. 170–184.

ICLP-J-2010-PettorossiSP #infinity #logic programming #source code

Transformations of logic programs on infinite lists (AP, VS, MP), pp. 383–399.

ICTSS-2010-AartsJU #abstraction #communication #generative #infinity #modelling #protocol #using

Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction (FA, BJ, JU), pp. 188–204.

RTA-2010-ZantemaR #data type #infinity #proving

Proving Productivity in Infinite Data Structures (HZ, MR), pp. 401–416.

ASE-2009-BurnimJSS #detection #infinity #lightweight #named #runtime

Looper: Lightweight Detection of Infinite Loops at Runtime (JB, NJ, CS, KS), pp. 161–169.

FoSSaCS-2009-KuhnrichSSK #analysis #data flow #infinity #interprocedural

Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains (MK, SS, JS, SK), pp. 440–455.

ICALP-v2-2009-AcciaiB #behaviour #infinity #safety #π-calculus

Deciding Safety Properties in Infinite-State π-Calculus via Behavioural Types (LA, MB), pp. 31–42.

LATA-2009-Salimov #complexity #infinity #word

Constructing Infinite Words of Intermediate Arithmetical Complexity (PVS), pp. 696–701.

SAC-2009-Djelloul #exponential #finite #infinity #linear

From exponential to almost linear decomposability of finite or infinite trees (KD), pp. 897–902.

SAC-2009-OwenP #framework #infinity

Infinite bar-joint frameworks (JCO, SCP), pp. 1116–1121.

CAV-2009-HahnHWZ #infinity #markov #model checking #named

INFAMY: An Infinite-State Markov Model Checker (EMH, HH, BW, LZ), pp. 641–647.

CAV-2009-HenzingerMW #abstraction #infinity #markov

Sliding Window Abstraction for Infinite Markov Chains (TAH, MM, VW), pp. 337–352.

LICS-2009-Tan #automaton #graph #infinity #reachability

Graph Reachability and Pebble Automata over Infinite Alphabets (TT), pp. 157–166.

FoSSaCS-2008-Goubault-Larrecq #game studies #infinity #probability #simulation

Simulation Hemi-metrics between Infinite-State Stochastic Games (JGL), pp. 50–65.

FoSSaCS-2008-Ummels #complexity #game studies #infinity #multi #nash

The Complexity of Nash Equilibria in Infinite Multiplayer Games (MU), pp. 20–34.

ICML-2008-DickHS #infinity #learning #semistructured data

Learning from incomplete data with infinite imputations (UD, PH, TS), pp. 232–239.

ICML-2008-GaelSTG #infinity #markov

Beam sampling for the infinite hidden Markov model (JVG, YS, YWT, ZG), pp. 1088–1095.

KR-2008-CaliGK #constraints #infinity #query #relational

Taming the Infinite Chase: Query Answering under Expressive Relational Constraints (AC, GG, MK), pp. 70–80.

CSL-2008-TorreMP #automaton #exponential #infinity

An Infinite Automaton Characterization of Double Exponential Time (SLT, PM, GP), pp. 33–48.

LICS-2008-BaierBBBG #automaton #infinity #model checking

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata (CB, NB, PB, TB, MG), pp. 217–226.

RTA-2008-Zantema #infinity #normalisation

Normalization of Infinite Terms (HZ), pp. 441–455.

ASE-2007-Hall #infinity #modelling #named #realtime #validation

Rteq: modeling and validating infinite-state hard-real-time systems (RJH), pp. 481–484.

SIGMOD-2007-LiGLSZ #clustering #database #named #parallel

InfiniteDB: a pc-cluster based parallel massive database management system (JL, HG, JL, SS, WZ), pp. 899–909.

TACAS-2007-BouajjaniJS #framework #infinity #network #process #reasoning

A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes (AB, YJ, MS), pp. 690–705.

SAS-2007-GallJ #automaton #infinity #representation #verification

Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification (TLG, BJ), pp. 52–68.

CIAA-2007-HoltmannL #game studies #infinity #memory management #reduction

Memory Reduction for Strategies in Infinite Games (MH, CL), pp. 253–264.

ICALP-2007-BodirskyCKO #constraints

Maximal Infinite-Valued Constraint Languages (MB, HC, JK, TvO), pp. 546–557.

ICML-2007-KirshnerS #infinity

Infinite mixtures of trees (SK, PS), pp. 417–423.

SAC-2007-DjelloulDF #constraints #finite #first-order #infinity #prolog #theorem proving #towards #unification #using

Toward a first-order extension of Prolog’s unification using CHR: a CHR first-order constraint solver over finite or infinite trees (KD, TBHD, TWF), pp. 58–64.

ESEC-FSE-2007-PradellaMP #symmetry #verification

The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties (MP, AM, PSP), pp. 312–320.

CADE-2007-GhilardiNRZ #infinity #model checking #satisfiability

Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems (SG, EN, SR, DZ), pp. 362–378.

CAV-2007-AbdullaDR #infinity #process #verification

Parameterized Verification of Infinite-State Processes with Global Conditions (PAA, GD, AR), pp. 145–157.

CSL-2007-CarayolL #infinity #order

MSO on the Infinite Binary Tree: Choice and Order (AC, CL), pp. 161–176.

LICS-2007-BrotherstonS #calculus #induction #infinity

Complete Sequent Calculi for Induction and Infinite Descent (JB, AS), pp. 51–62.

LICS-2007-Escardo #infinity #performance #set

Infinite sets that admit fast exhaustive search (MHE), pp. 443–452.

LICS-2007-KahlerKT #encryption #infinity #model checking #protocol

Infinite State AMC-Model Checking for Cryptographic Protocols (DK, RK, TT), pp. 181–192.

RTA-2007-EscobarM #infinity #model checking #using

Symbolic Model Checking of Infinite-State Systems Using Narrowing (SE, JM), pp. 153–168.

FoSSaCS-2006-ChenFN #finite #infinity #on the #simulation

On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation (TC, WF, SN), pp. 1–15.

CIAA-2006-RoyC #finite #infinity #model checking

A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems (SR, BC), pp. 277–278.

DLT-2006-DrosteR #automaton #infinity #logic #word

Weighted Automata and Weighted Logics on Infinite Words (MD, GR), pp. 49–58.

ICALP-v2-2006-Kopczynski #game studies #infinity

Half-Positional Determinacy of Infinite Games (EK), pp. 336–347.

ICML-2006-GorurJR #infinity

A choice model with infinitely many latent features (DG, FJ, CER), pp. 361–368.

SAC-2006-DjelloulD #constraints #finite #first-order #formal method #infinity

Solving first-order constraints in the theory of finite or infinite trees: introduction to the decomposable theories (KD, TBHD), pp. 7–14.

SAC-2006-HeatherS #analysis #infinity #protocol #security

To infinity and beyond or, avoiding the infinite in security protocol analysis (JH, SS), pp. 346–353.

CSL-2006-Aehlig #automaton #finite #infinity #semantics

A Finite Semantics of Simply-Typed λ Terms for Infinite Runs of Automata (KA), pp. 104–118.

CSL-2006-BodirskyC #constraints #quantifier

Collapsibility in Infinite-Domain Quantified Constraint Satisfaction (MB, HC), pp. 197–211.

CSL-2006-GollerL #infinity #logic #model checking

Infinite State Model-Checking of Propositional Dynamic Logics (SG, ML), pp. 349–364.

CSL-2006-Ong #approach #infinity #semantics #verification

Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract) (CHLO), pp. 31–40.

CSL-2006-Segoufin #automaton #infinity #logic #word

Automata and Logics for Words and Trees over an Infinite Alphabet (LS), pp. 41–57.

IJCAR-2006-KoprowskiZ #automation #infinity #order #recursion #term rewriting

Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems (AK, HZ), pp. 332–346.

LICS-2006-Bryant #infinity #using #verification

Formal Verification of Infinite State Systems Using Boolean Methods (REB), pp. 3–4.

RTA-2006-Bryant #infinity #using #verification

Formal Verification of Infinite State Systems Using Boolean Methods (REB), pp. 1–3.

TACAS-2005-BinghamH #empirical #infinity #performance #verification

Empirically Efficient Verification for a Class of Infinite-State Systems (JDB, AJH), pp. 77–92.

TACAS-2005-KupfermanV #automaton #infinity #nondeterminism #word

Complementation Constructions for Nondeterministic Automata on Infinite Words (OK, MYV), pp. 206–221.

TACAS-2005-RemkeHC #infinity #markov #model checking

Model Checking Infinite-State Markov Chains (AR, BRH, LC), pp. 237–252.

DLT-J-2004-Staiger05 #infinity

Infinite Iterated Function Systems in Cantor Space and the Hausdorff Measure of ω-Power Languages (LS), pp. 787–802.

CIAA-2005-VielhaberC #infinity #on the #set #transducer

On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set (MV, MdPCC), pp. 356–357.

SEKE-2005-Wang #infinity #logic #model checking #specification

Specification of an Infinite-State Local Model Checker in Rewriting Logic (BYW), pp. 442–447.

SAC-2005-DantchevV #infinity #on the

On the computational limits of infinite satisfaction (SSD, FDV), pp. 393–397.

LICS-2005-AbdullaHM #finite #infinity #markov #verification

Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property (PAA, NBH, RM), pp. 127–136.

SIGMOD-2004-AyadN #infinity #optimisation #query

Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams (AA, JFN), pp. 419–430.

FoSSaCS-2004-FokkinkN #finite #infinity #on the

On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds (WF, SN), pp. 182–194.

FoSSaCS-2004-GiambiagiSV #behaviour #calculus #infinity #on the #process

On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi (PG, GS, FDV), pp. 226–240.

CIAA-2004-Ibarra #infinity

Automata-Theoretic Techniques for Analyzing Infinite-State Systems (OHI), p. 1.

SEFM-2004-Roy #finite #infinity #using #verification

Symbolic Verification of Infinite Systems using a Finite Union of DFAs (SR), pp. 56–66.

SEFM-2004-SchuleS #comparison #infinity #model checking #verification

Global vs. Local Model Checking: A Comparison of Verification Techniques for Infinite State Systems (TS, KS), pp. 67–76.

CAV-2004-FinkelL #image #infinity #model checking

Image Computation in Infinite State Model Checking (AF, JL), pp. 361–371.

CAV-2004-PitermanV #infinity #model checking

Global Model-Checking of Infinite-State Systems (NP, MYV), pp. 387–400.

CSL-2004-Gimbert #game studies #graph #infinity

Parity and Exploration Games on Infinite Graphs (HG), pp. 56–70.

LICS-2004-WohrleT #infinity #model checking

Model Checking Synchronized Products of Infinite Transition Systems (SW, WT), pp. 2–11.

ICALP-2003-CarayolC #infinity #on the

On Equivalent Representations of Infinite Structures (AC, TC), pp. 599–610.

ICALP-2003-XieDI #equation #infinity #polynomial #verification

A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems (GX, ZD, OHI), pp. 668–680.

CAV-2003-AlurTM #composition #game studies #graph #infinity #recursion

Modular Strategies for Infinite Games on Recursive Graphs (RA, SLT, PM), pp. 67–79.

CAV-2003-BartzisB #image #infinity #model checking #performance

Efficient Image Computation in Infinite State Model Checking (CB, TB), pp. 249–261.

CSL-2003-Bouajjani #infinity #tutorial #verification

Verification of Infinite State Systems (Tutorial) (AB), p. 71.

CSL-2003-RybinaV #infinity #model checking #performance

Fast Infinite-State Model Checking in Integer-Based Systems (Invited Lecture) (TR, AV), pp. 546–573.

ICLP-2003-DelzannoGM #composition #infinity #verification

Compositional Verification of Infinite State Systems (GD, MG, MCM), pp. 47–48.

FoSSaCS-2002-Loding #infinity #model checking

Model-Checking Infinite Systems Generated by Ground Tree Rewriting (CL), pp. 280–294.

STOC-2002-AspnesSS #infinity

Wait-free consensus with infinite arrivals (JA, GS, JS), pp. 524–533.

DLT-2002-AltenberndTW #infinity

Tiling Systems over Infinite Pictures and Their Acceptance Conditions (JHA, WT, SW), pp. 297–306.

DLT-2002-Cassaigne #complexity #infinity #word

Constructing Infinite Words of Intermediate Complexity (JC), pp. 173–184.

DLT-2002-Kari #infinity #problem

Infinite Snake Tiling Problems (JK), pp. 67–77.

DLT-2002-UmeoK #automaton #communication #infinity #realtime #sequence

An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton (HU, NK), pp. 339–348.

ICALP-2002-GenestMSZ #infinity #model checking

Infinite-State High-Level MSCs: Model-Checking and Realizability (BG, AM, HS, MZ), pp. 657–668.

KR-2002-Broxvall #constraints #infinity

Constraint Satisfaction on Infinite Domains: Composing Domains and Decomposing Constraints (MB), pp. 509–520.

CADE-2002-MouraRS #bound #infinity #lazy evaluation #model checking #proving #theorem proving

Lazy Theorem Proving for Bounded Model Checking over Infinite Domains (LMdM, HR, MS), pp. 438–455.

CAV-2002-RybinaV #canonical #infinity #model checking #using

Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking (TR, AV), pp. 386–400.

CAV-2002-Thomas #game studies #infinity #tutorial #verification

Infinite Games and Verification (Extended Abstract of a Tutorial) (WT), pp. 58–64.

CSL-2002-Kreutzer #fixpoint #infinity #logic

Partial Fixed-Point Logic on Infinite Structures (SK), pp. 337–351.

ICLP-2002-Bonatti #infinity #modelling #reasoning #source code

Reasoning with Infinite Stable Models II: Disjunctive Programs (PAB), pp. 333–346.

ICLP-2002-CharatonikMP #constraints #infinity #model checking

Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP (WC, SM, AP), pp. 115–129.

DLT-2001-Thomas #automaton #infinity

A Short Introduction to Infinite Automata (WT), pp. 130–144.

ICALP-2001-Bouajjani #infinity #term rewriting #verification

Languages, Rewriting Systems, and Verification of Infinite-State Systems (AB), pp. 24–39.

LOPSTR-2001-FioravantiPP #infinity #process #program transformation #set #using #verification

Verification of Sets of Infinite State Processes Using Program Transformation (FF, AP, MP), pp. 111–128.

LICS-2001-ArnoldLM #infinity #monad

The Hierarchy inside Closed Monadic Σ₁ Collapses on the Infinite Binary Tree (AA, GL, JM), pp. 157–166.

ESOP-2000-Mauborgne #infinity #representation #set

Improving the Representation of Infinite Trees to Deal with Sets of Trees (LM), pp. 275–289.

TACAS-2000-BodeveixF #infinity #named #validation

FMona: A Tool for Expressing Validation Techniques over Infinite State Systems (JPB, MF), pp. 204–219.

TACAS-2000-JonssonN #infinity #transitive #verification

Transitive Closures of Regular Relations for Verifying Infinite-State Systems (BJ, MN), pp. 220–234.

ICALP-2000-BealC #infinity #transducer #word

Determinization of Transducers over Infinite Words (MPB, OC), pp. 561–570.

ICALP-2000-Kuske #infinity #logic

Infinite Series-Parallel Posets: Logic and Languages (DK), pp. 648–662.

WLC-2000-AvgustinovichFF #complexity #infinity #word

Arithmetical Complexity of Infinite Words (SVA, DFDF, AEF), pp. 51–62.

ICSE-2000-DangK #approximate #infinity #model checking #realtime

Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems (ZD, RAK), pp. 345–354.

CAV-2000-AbdullaJ #infinity #tutorial #verification

Invited Tutorial: Verification of Infinite-State and Parameterized Systems (PAA, BJ), p. 4.

CAV-2000-KupfermanV #approach #infinity #reasoning

An Automata-Theoretic Approach to Reasoning about Infinite-State Systems (OK, MYV), pp. 36–52.

LICS-2000-AbdullaN #infinity #performance #verification

Better is Better than Well: On Efficient Verification of Infinite-State Systems (PAA, AN), pp. 132–140.

LICS-2000-Moszkowski #axiom #infinity #logic

A Complete Axiomatization of Interval Temporal Logic with Infinite Time (BCM), pp. 241–252.

ITiCSE-1999-Siegel #infinity #why

Why do fools fall into infinite loops: singing to your computer science class (EVS), pp. 167–170.

LOPSTR-1999-LeuschelM #abstract interpretation #infinity #model checking

Infinite State Model Checking by Abstract Interpretation and Program Specialisation (ML, TM), pp. 62–81.

CAV-1999-AbdullaABBHL #abstraction #analysis #infinity #reachability #verification

Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis (PAA, AA, SB, AB, PH, YL), pp. 146–159.

LICS-1999-HalpernS #infinity #reasoning

Reasoning about Common Knowledge with Infinitely Many Agents (JYH, RAS), pp. 384–393.

FoSSaCS-1998-AlbayrakN #infinity

The WHILE Hierarchy of Program Schemes Is Infinite (CAA, TN), pp. 35–47.

TACAS-1998-CharatonikP #analysis #infinity

Set-Based Analysis of Reactive Infinite-State Systems (WC, AP), pp. 358–375.

ICALP-1998-KarhumakiLP #behaviour #infinity #word

Locally Periodic Infinite Words and a Chaotic Behaviour (JK, AL, WP), pp. 421–430.

WIA-1998-Augros #automaton #finite #infinity #set #word

Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set (XA), pp. 220–225.

SIGAda-1998-Duncan #ada #data type #infinity #library #reuse

Reusable Ada Libraries Supporting Infinite Data Structures (AGD), pp. 89–103.

KR-1998-Jaeger #infinity #network #random #reasoning #relational

Reasoning About Infinite Random Structures with Relational Bayesian Networks (MJ), pp. 570–581.

CAV-1998-BensalemLO #abstraction #automation #infinity

Computing Abstractions of Infinite State Systems Compositionally and Automatically (SB, YL, SO), pp. 319–331.

CAV-1998-IslesHB #infinity #memory management

Computing Reachable Control States of Systems Modeled with Uninterpreted Functions and Infinite Memory (AJI, RH, RKB), pp. 256–267.

CAV-1998-WolperB #infinity #verification

Verifying Systems with Infinite but Regular State Spaces (PW, BB), pp. 88–97.

LICS-1998-EmersonN #infinity #model checking #nondeterminism #on the

On Model Checking for Non-Deterministic Infinite-State Systems (EAE, KSN), pp. 70–80.

DLT-1997-MateescuM #infinity

Infinite trajectories (AM, GDM), pp. 489–505.

ICALP-1997-BurkartS #calculus #infinity #model checking #process #μ-calculus

Model Checking the Full Modal μ-Calculus for Infinite Sequential Processes (OB, BS), pp. 419–429.

CAV-1997-BultanGP #infinity #model checking #using

Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic (TB, RG, WP), pp. 400–411.

LICS-1997-DziembowskiJW #game studies #how #infinity #memory management #question

How Much Memory is Needed to Win Infinite Games? (SD, MJ, IW), pp. 99–110.

LICS-1997-MatzT #graph #infinity #monad #quantifier

The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite (OM, WT), pp. 236–244.

TACAS-1996-BuhrkeLV #infinity

Strategy Construction in Infinite Ganes with Streett and Rabin Chain Winning Conditions (NB, HL, JV), pp. 207–224.

ICALP-1996-Caucal #decidability #graph #infinity #monad #on the

On Infinite Transition Graphs Having a Decidable Monadic Theory (DC), pp. 194–205.

HPCA-1996-IyengarTB #infinity #modelling

Representative Traces for Processor Models with Infinite Cache (VSI, LT, PB), pp. 62–72.

CAV-1996-BoigelotG #communication #infinity #protocol #using #verification

Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract) (BB, PG), pp. 1–12.

LICS-1996-AbdullaCJT #decidability #infinity #theorem

General Decidability Theorems for Infinite-State Systems (PAA, KC, BJ, YKT), pp. 313–321.

PODS-1995-ChomickiK #infinity

Measuring Infinite Relations (JC, GMK), pp. 78–85.

DLT-1995-Lepisto #complexity #infinity #on the #word

On the Computational Complexity of Infinite Words (AL), pp. 350–359.

DLT-1995-LitovskyS #finite #infinity #word

Finite Acceptance of Infinite Words (IL, LS), pp. 360–369.

POPL-1995-BouajjaniEH #composition #infinity #parallel #process #verification

Verifying Infinite State Processes with Sequential and Parallel Composition (AB, RE, PH), pp. 95–106.

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

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

CAV-1995-JonssonK #algorithm #distributed #infinity #safety #verification

Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms (BJ, LK), pp. 42–53.

FME-1994-Jackson #infinity #model checking #specification

Abstract Model Checking of Infinite Specifications (DJ), pp. 519–531.

TAGT-1994-Bauderon #approach #generative #graph #infinity

A Category-Theoretical Approach to Vertex Replacement: The Generation of Infinite Graphs (MB), pp. 27–37.

ICALP-1993-EbingerM #infinity #logic

Logical Definability on Infinite Traces (WE, AM), pp. 335–346.

ICALP-1992-GastinP #automaton #infinity

Asynchronous Cellular Automata for Infinite Traces (PG, AP), pp. 583–594.

KR-1992-Davis #finite #infinity

Infinite Loops in Finite Time: Some Observations (ED), pp. 47–58.

PODS-1991-BaudinetNW #infinity #on the #query #representation

On the Representation of Infinite Temporal Data and Queries (MB, MN, PW), pp. 280–290.

STOC-1991-DengM #game studies #infinity #online #problem

Infinite Games, Randomization, Computability, and Applications to Online Problems (Preliminary Version) (XD, SM), pp. 289–298.

STOC-1991-Harel #graph #infinity

Hamiltonian Paths in Infinite Graphs (DH), pp. 220–229.

ICALP-1991-GastinPZ #infinity #theorem

A Kleene Theorem for Infinite Trace Languages (PG, AP, WZ), pp. 254–266.

CAV-1991-Sterling #infinity

Taming Infinite State Spaces (CS), p. 1.

CSL-1991-Mundici #logic #normalisation

Normal Forms in Infinite-Valued Logic: The Case of One Variable (DM), pp. 272–277.

ISLP-1991-BruynoogheSM #deduction #infinity #logic programming #source code

A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs (MB, DDS, BM), pp. 117–131.

PODS-1990-KabanzaSW #infinity

Handling Infinite Temporal Data (FK, JMS, PW), pp. 392–403.

STOC-1990-Blum #infinity #learning

Learning Boolean Functions in an Infinite Atribute Space (Extended Abstract) (AB), pp. 64–72.

CHI-1990-Carroll #human-computer #infinity

Infinite detail and emulation in an ontologically minimized HCI (JMC), pp. 321–328.

PODS-1989-SagivV #database #datalog #infinity #query #safety

Safety of Datalog Queries over Infinite Databases (YS, MYV), pp. 160–171.

SIGMOD-1989-ChomickiI #infinity #query #relational #specification

Relational Specifications of Infinite Query Answers (JC, TI), pp. 174–183.

ICALP-1989-DershowitzKP #infinity #normalisation

Infinite Normal Forms (Preliminary Version) (ND, SK, DAP), pp. 249–262.

ICALP-1989-EngelfrietH #automaton #infinity #word

Automata with Storage on Infinite Words (JE, HJH), pp. 289–303.

SEKE-1989-Tang #automation #concurrent #infinity #source code #verification

Temporal Theory for Automatic Verification of Infinite State Concurrent Programs (TGT), pp. 134–139.

PODS-1988-ChomickiI #database #deduction #infinity

Temporal Deductive Databases and Infinite Objects (JC, TI), pp. 61–73.

STOC-1988-PintzSS #infinity #performance #testing

Two Infinite Sets of Primes with Fast Primality Tests (JP, WLS, ES), pp. 504–509.

LICS-1988-Maher #algebra #axiom #finite #infinity

Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees (MJM), pp. 348–357.

LICS-1988-Niwinski #fixpoint #generative #infinity

Fixed Points vs. Infinite Generation (DN), pp. 402–409.

PODS-1987-RamakrishnanBS #horn clause #infinity #recursion #safety

Safety of Recursive Horn Clauses With Infinite Relations (RR, FB, AS), pp. 328–339.

STOC-1987-IwanoS #graph #infinity #testing

Testing for Cycles in Infinite Graphs with Periodic Structure (Extended Abstract) (KI, KS), pp. 46–55.

LICS-1987-Thomas #first-order #infinity #logic #on the

On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees (WT), pp. 245–256.

RTA-1987-Kirchner #infinity #process #set

Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes (HK), pp. 180–191.

LICS-1986-MendlerPC #infinity #type system

Infinite Objects in Type Theory (NPM, PP, RLC), pp. 249–255.

VLDB-1985-CellaryM #database #distributed #infinity

Locking with Prevention of Cyclic and Infinite Restarting in Distributed Database Systems (WC, TM), pp. 115–126.

ICALP-1985-BakkerMO #concurrent #finite #infinity #semantics

Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency (JWdB, JJCM, ERO), pp. 149–157.

ICALP-1985-BeauquierN #set #word

About Rational Sets of Factors of a Bi-Infinite Word (DB, MN), pp. 33–42.

ICALP-1985-MainBH #infinity

Applications of an Infinite Squarefree CO-CFL (MGM, WB, DH), pp. 404–412.

STOC-1984-Harel #infinity

A General Result on Infinite Trees and Its Applications (Preliminary Report) (DH), pp. 418–427.

ICALP-1984-Abdallah #infinity #logic programming #on the

On the Interpretation of Infinite Computations in Logic Programming (MANA), pp. 358–370.

ICALP-1984-Girault-Beauquier #automaton #behaviour #finite #infinity

Some Results About Finite and Infinite Behaviours of a Pushdown Automaton (DB), pp. 187–195.

LFP-1984-DoschM #infinity #lazy evaluation

Busy and Lazy FP with Infinite Objects (WD, BM), pp. 282–292.

ICALP-1983-Arnold #behaviour #infinity

Topological Characterizations of Infinite Behaviours of Transition Systems (AA), pp. 28–38.

ICALP-1983-Indermark #complexity #infinity

Complexity of Infinite Trees (KI), pp. 347–360.

GG-1982-SiromoneyS #graph #infinity

Space-filling curves and infinite graphs (RS, KGS), pp. 380–391.

CADE-1982-HenschenN #database #first-order #infinity #recursion #representation #sequence

Representing Infinite Sequences of Resolvents in recursive First-Order Horn Databases (LJH, SAN), pp. 342–359.

ICALP-1972-Turner #approach #complexity #infinity

An Infinite Hierarchy of Term Languages — An Approach to Mathematical Complexity (RT), pp. 593–608.