Cardinality constraints for arrays (decidability results and applications) (Q1688541): Difference between revisions

@@ Property / cites work @@
+Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
+Normal rank
@@ Property / cites work @@
+Parameterized Verification of Infinite-State Processes with Global Conditions
+Normal rank
@@ Property / cites work @@
+Verifying programs with unreliable channels
@@ Property / cites work: Verifying programs with unreliable channels / rank @@
+Normal rank
@@ Property / cites work @@
+Model checking of systems with many identical timed processes
+Normal rank
@@ Property / cites work @@
+Counting Constraints in Flat Array Fragments
@@ Property / cites work: Counting Constraints in Flat Array Fragments / rank @@
+Normal rank
@@ Property / cites work @@
+Decision procedures for flat array properties
@@ Property / cites work: Decision procedures for flat array properties / rank @@
+Normal rank
@@ Property / cites work @@
+A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT
+Normal rank
@@ Property / cites work @@
+Tolerating corrupted communication
@@ Property / cites work: Tolerating corrupted communication / rank @@
+Normal rank
@@ Property / cites work @@
+The Heard-Of model: computing in distributed systems with benign faults
+Normal rank
@@ Property / cites work @@
+Q4945217
@@ Property / cites work: Q4945217 / rank @@
+Normal rank
@@ Property / cites work @@
+A Logic-Based Framework for Verifying Consensus Algorithms
+Normal rank
@@ Property / cites work @@
+PSync: a partially synchronous language for fault-tolerant distributed algorithms
+Normal rank
@@ Property / cites work @@
+Carathéodory bounds for integer cones
@@ Property / cites work: Carathéodory bounds for integer cones / rank @@
+Normal rank
@@ Property / cites work @@
+Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
+Normal rank
@@ Property / cites work @@
+Higher-order quantifier elimination, counter simulations and fault-tolerant systems
+Normal rank
@@ Property / cites work @@
+Presburger arithmetic with unary predicates is <i>Π</i><sub>1</sub><sup>1</sup> complete
+Normal rank
@@ Property / cites work @@
+SMT and POR beat counter abstraction: parameterized model checking of threshold-based distributed algorithms
+Normal rank
@@ Property / cites work @@
+On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
+Normal rank
@@ Property / cites work @@
+What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms
+Normal rank
@@ Property / cites work @@
+Automated Deduction – CADE-20
@@ Property / cites work: Automated Deduction – CADE-20 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding Boolean algebra with Presburger arithmetic
+Normal rank
@@ Property / cites work @@
+Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
+Normal rank
@@ Property / cites work @@
+Solving SAT and SAT Modulo Theories
@@ Property / cites work: Solving SAT and SAT Modulo Theories / rank @@
+Normal rank
@@ Property / cites work @@
+Decision Procedures for Multisets with Cardinality Constraints
+Normal rank
@@ Property / cites work @@
+Collections, Cardinalities, and Relations
@@ Property / cites work: Collections, Cardinalities, and Relations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737128
@@ Property / cites work: Q4737128 / rank @@
+Normal rank