„concurrent programs“

Suchergebnisse

118 Treffer

• Formal Methods for the Quantitative Evaluation of Collective Adaptive Systems – 16th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2016, Bertinoro, Italy, June 20-24, 2016, Advanced Lectures
  Bernardo, Marco ; De Nicola, Rocco ; Hillston, Jane 2016 Springer International Publishing
• Transactions on Petri Nets and Other Models of Concurrency XI
  2016 Springer International Publishing
• Verification of Sequential and Concurrent Programs
  1991 Springer New York
• Verification of Sequential and Concurrent Programs
  1997 Springer New York
• A Concurrent Mixed-Methods Study of Midwestern Latino Parents Participation and Preferences for Parenting Education Programs
  Ramos, Athena K. ; Su, Dejun ; Correa, Antonia ; Trinidad, Natalia
• Automatic and Dynamic Visualization of Process-Based Concurrent Programs
  Farina, Daniel Augusto Rodrigues ; Campiolo, Rodrigo ; Rufino, José ; Pereira, Maria João Varanda 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• ConDRust: Scalable Deterministic Concurrency from Verifiable Rust Programs (Artifact)
  Suchert, Felix ; Zeidler, Lisza ; Castrillon, Jeronimo ; Ertel, Sebastian
• A General Approach to Under-Approximate Reasoning About Concurrent Programs
  Raad, Azalea ; Vanegue, Julien ; Berdine, Josh ; O'Hearn, Peter 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On Verifying Concurrent Programs Under Weakly Consistent Models (Invited Talk)
  Bouajjani, Ahmed 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• ConDRust: Scalable Deterministic Concurrency from Verifiable Rust Programs
  Suchert, Felix ; Zeidler, Lisza ; Castrillon, Jeronimo ; Ertel, Sebastian 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Context-Bounded Analysis of Concurrent Programs (Invited Talk)
  Baumann, Pascal ; Ganardi, Moses ; Majumdar, Rupak ; Thinniyam, Ramanathan S. ; Zetzsche, Georg 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Using Linearizable Objects in Randomized Concurrent Programs (Invited Talk)
  Welch, Jennifer L. 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Reachability in Concurrent Uninterpreted Programs
  La Torre, Salvatore ; Parthasarathy, Madhusudan 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Polynomial-Time Fence Insertion for Structured Programs
  Taheri, Mohammad ; Pourdamghani, Arash ; Lesani, Mohsen 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs That Use Concurrent Objects
  Attiya, Hagit ; Enea, Constantin 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Synchronizing the Asynchronous
  Kragl, Bernhard ; Qadeer, Shaz ; Henzinger, Thomas A. 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Extracting Non-Deterministic Concurrent Programs
  Berger, Ulrich 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Automated Synthesis: Going Distributed (Invited Talk)
  Muscholl, Anca 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Benefits of Duality in Verifying Concurrent Programs under TSO
  Abdulla, Parosh Aziz ; Atig, Mohamed Faouzi ; Bouajjani, Ahmed ; Ngo, Tuan Phong 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Model Checking Concurrent Programs with Nondeterminism and Randomization
  Chadha, Rohit ; Sistla, A. Prasad ; Viswanathan, Mahesh 2010 Schloss Dagstuhl – Leibniz-Zentrum für Informatik