Back to Results
First PageMeta Content
Automata theory / Logic in computer science / Model theory / Complexity classes / Electronic design automation / Satisfiability / FO / Boolean satisfiability problem / Constraint automaton / Theoretical computer science / Mathematical logic / Mathematics


The Effects of Bounding Syntactic Resources on Presburger LTL ∗ St´ephane Demri LSV, ENS Cachan CNRS, INRIA Saclay [removed]
Add to Reading List

Document Date: 2009-06-18 03:59:48

Open Document

File Size: 412,08 KB

Share Result on Facebook

Company

Bounding Syntactic Resources / /

/

Facility

i.e. hq / /

IndustryTerm

finite-state systems / flat counter systems / model-checking pushdown systems / infinite-state systems / Counter systems / cryptographic protocols / pushdown systems / /

Organization

CNRS Univ. / /

ProgrammingLanguage

XML / /

ProvinceOrState

Pennsylvania / /

PublishedMedium

la Recherche / /

Technology

artificial intelligence / XML / /

SocialTag