Incremental Computation of Succinct Abstractions for Hybrid Systems (Q3172856): Difference between revisions

@@ Property / cites work @@
+The essence of constraint propagation
@@ Property / cites work: The essence of constraint propagation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3601408
@@ Property / cites work: Q3601408 / rank @@
+Normal rank
@@ Property / cites work @@
+Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
+Normal rank
@@ Property / cites work @@
+Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
+Normal rank
@@ Property / cites work @@
+GUARANTEED TERMINATION IN THE VERIFICATION OF LTL PROPERTIES OF NON-LINEAR ROBUST DISCRETE TIME HYBRID SYSTEMS
+Normal rank
@@ Property / cites work @@
+Q4255591
@@ Property / cites work: Q4255591 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient solving of quantified inequality constraints over the real numbers
+Normal rank
@@ Property / cites work @@
+Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable
+Normal rank
@@ Property / cites work @@
+Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate
+Normal rank
@@ Property / cites work @@
+Logical Interpretation: Static Program Analysis Using Theorem Proving
+Normal rank