Efficient analysis of concurrent constraint logic programs (Q4630298): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-56939-1_108
+Normal rank
@@ Property / OpenAlex ID @@
+W1832894047
@@ Property / OpenAlex ID: W1832894047 / rank @@
+Normal rank
@@ Property / cites work @@
+Deadlock analysis in networks of communicating processes
+Normal rank
@@ Property / cites work @@
+Deadlock absence proofs for networks of communicating processes
+Normal rank
@@ Property / cites work @@
+Efficient analysis of concurrent constraint logic programs
+Normal rank
@@ Property / cites work @@
+Q3777424
@@ Property / cites work: Q3777424 / rank @@
+Normal rank
@@ Property / cites work @@
+Closures and fairness in the semantics of programming logic
+Normal rank
@@ Property / cites work @@
+Q3992908
@@ Property / cites work: Q3992908 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992568
@@ Property / cites work: Q3992568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3727353
@@ Property / cites work: Q3727353 / rank @@
+Normal rank