Pages that link to "Item:Q4085221"

The following pages link to Verifying properties of parallel programs (Q4085221):

Displaying 49 items.

• On grainless footprint semantics for shared-memory programs (Q283741) (← links)
• Formal verification of concurrent programs with Read-write locks (Q351980) (← links)
• A cylinder computation model for many-core parallel computing (Q391222) (← links)
• Verification of object-oriented programs: a transformational approach (Q439944) (← links)
• The pursuit of deadlock freedom (Q580970) (← links)
• Inter-process buffers in separation logic with rely-guarantee (Q613139) (← links)
• Fine-grained concurrency with separation logic (Q763473) (← links)
• A proof technique for parallel programs (Q796292) (← links)
• A calculus and logic of resources and processes (Q855007) (← links)
• A semantics for concurrent separation logic (Q879367) (← links)
• Resources, concurrency, and local reasoning (Q879368) (← links)
• Verifying atomic data types (Q914403) (← links)
• A mechanical analysis of program verification strategies (Q928673) (← links)
• Local proofs for global safety properties (Q1039842) (← links)
• The lifeness property of on-the-fly garbage collector - a proof (Q1054471) (← links)
• An approach to automating the verification of compact parallel coordination programs. I (Q1056221) (← links)
• A generalized deadlock predicate (Q1085972) (← links)
• The formal development of a parallel program performing LU-decomposition (Q1096311) (← links)
• Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic (Q1139368) (← links)
• The temporal semantics of concurrent programs (Q1143164) (← links)
• Transformational semantics for concurrent programs (Q1144920) (← links)
• Methods and means of parallel processing of information (Q1155954) (← links)
• Parallel algorithms for the single source shortest path problem (Q1162156) (← links)
• Towards a foundation for semantics in complete metric spaces (Q1173767) (← links)
• Deadlock-free absorption of barrier synchronisations (Q1350300) (← links)
• A methodology for designing proof rules for fair parallel programs (Q1377299) (← links)
• Formal validation of data-parallel programs: a two-component assertional proof system for a simple language (Q1389681) (← links)
• A perspective on specifying and verifying concurrent modules (Q1648035) (← links)
• Efficient algorithms for the maximum sum problems (Q1662587) (← links)
• A brief history of process algebra (Q1781995) (← links)
• Corrigenda:Cooperating proofs for distributed programs with multiparty interactions (Q1813353) (← links)
• Distributed automata in an assumption-commitment framework (Q1847547) (← links)
• Fifty years of Hoare's logic (Q2280214) (← links)
• Revisiting concurrent separation logic (Q2397039) (← links)
• Automatic Inference of Access Permissions (Q2891412) (← links)
• Local Symmetry and Compositional Verification (Q2891426) (← links)
• Compositional Reasoning (Q3176370) (← links)
• Syntactic Control of Interference and Concurrent Separation Logic (Q3178275) (← links)
• Owicki-Gries Reasoning for Weak Memory Models (Q3449485) (← links)
• The Birth of Model Checking (Q3512430) (← links)
• Axiomatic system for proving the properties of simple multimodule programs (Q3829057) (← links)
• Current methods for proving program correctness (Q3911363) (← links)
• Verifying Visibility-Based Weak Consistency (Q5041095) (← links)
• (Q5090915) (← links)
• All-Path Reachability Logic (Q5170834) (← links)
• Convolution as a Unifying Concept (Q5277916) (← links)
• A Revisionist History of Concurrent Separation Logic (Q5739348) (← links)
• Using semantic correctness in multidatabases to achieve local autonomy, distribute coordination, and maintain global integrity (Q5946286) (← links)
• Steps in modular specifications for concurrent modules (invited tutorial paper) (Q5971389) (← links)