Automated repair of heap-manipulating programs using deductive synthesis (Q2234087): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-030-67067-2_17
+Normal rank
@@ Property / OpenAlex ID @@
+W3119757231
@@ Property / OpenAlex ID: W3119757231 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequent calculi for induction and infinite descent
+Normal rank
@@ Property / cites work @@
+Compositional Shape Analysis by Means of Bi-Abduction
+Normal rank
@@ Property / cites work @@
+Enhancing modular OO verification with separation logic
+Normal rank
@@ Property / cites work @@
+Automated verification of shape, size and bag properties via user-defined predicates in separation logic
+Normal rank
@@ Property / cites work @@
+Concise Read-Only Specifications for Better Synthesis of Programs with Pointers
+Normal rank
@@ Property / cites work @@
+Specification-Based Program Repair Using SAT
@@ Property / cites work: Specification-Based Program Repair Using SAT / rank @@
+Normal rank
@@ Property / cites work @@
+BI as an assertion language for mutable data structures
+Normal rank
@@ Property / cites work @@
+Enhancing Program Verification with Lemmas
@@ Property / cites work: Enhancing Program Verification with Lemmas / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic program repair using formal verification and expression templates
+Normal rank
@@ Property / cites work @@
+Automated mutual explicit induction proof in separation logic
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2234087