Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation (Q3075482): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-18275-4_15
+Normal rank
@@ Property / OpenAlex ID @@
+W4256626421
@@ Property / OpenAlex ID: W4256626421 / rank @@
+Normal rank
@@ Property / cites work @@
+CONCUR 2005 – Concurrency Theory
@@ Property / cites work: CONCUR 2005 – Concurrency Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Macro tree transducers
@@ Property / cites work: Macro tree transducers / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
+Normal rank
@@ Property / cites work @@
+Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
+Normal rank
@@ Property / cites work @@
+Computer Aided Verification
@@ Property / cites work: Computer Aided Verification / rank @@
+Normal rank
@@ Property / cites work @@
+Language Strength Reduction
@@ Property / cites work: Language Strength Reduction / rank @@
+Normal rank
@@ Property / cites work @@
+Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
+Normal rank
@@ Property / cites work @@
+On optimal slicing of parallel programs
@@ Property / cites work: On optimal slicing of parallel programs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2712587
@@ Property / cites work: Q2712587 / rank @@
+Normal rank