Pages that link to "Item:Q2303241"
From MaRDI portal
The following pages link to Solving quantifier-free first-order constraints over finite sets and binary relations (Q2303241):
Displaying 9 items.
- Automated proof of Bell-LaPadula security properties (Q2031424) (← links)
- An automatically verified prototype of the Tokeneer ID station specification (Q2069869) (← links)
- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership (Q2215960) (← links)
- Automated reasoning with restricted intensional sets (Q2666960) (← links)
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) (← links)
- (Q5087785) (← links)
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)
- An automatically verified prototype of the Android permissions system (Q6103592) (← links)
- A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers (Q6653095) (← links)
