Testing Concurrent Objects with Application-Specific Schedulers (Q5505611): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-85762-4_22
+Normal rank
@@ Property / OpenAlex ID @@
+W1541559884
@@ Property / OpenAlex ID: W1541559884 / rank @@
+Normal rank
@@ Property / cites work @@
+Maude: specification and programming in rewriting logic
+Normal rank
@@ Property / cites work @@
+A Complete Guide to the Future
@@ Property / cites work: A Complete Guide to the Future / rank @@
+Normal rank
@@ Property / cites work @@
+Task automata: Schedulability, decidability and undecidability
+Normal rank
@@ Property / cites work @@
+Q4240122
@@ Property / cites work: Q4240122 / rank @@
+Normal rank
@@ Property / cites work @@
+Conditional rewriting logic as a unified model of concurrency
+Normal rank
@@ Property / cites work @@
+Q2761742
@@ Property / cites work: Q2761742 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471927
@@ Property / cites work: Q4471927 / rank @@
+Normal rank
@@ Property / cites work @@
+A Theory of Bounded Fair Scheduling
@@ Property / cites work: A Theory of Bounded Fair Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Whodunit? Causal Analysis for Counterexamples
@@ Property / cites work: Whodunit? Causal Analysis for Counterexamples / rank @@
+Normal rank