„Program Verification“

Suchergebnisse

1.065 Treffer

• Mover Logic: A Concurrent Program Logic for Reduction and Rely-Guarantee Reasoning
  Flanagan, Cormac ; Freund, Stephen N. 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Dynamic Logic for Symbolic Execution for the Smart Contract Programming Language Michelson
  Arvay, Barnabas ; Doan, Thi Thu Ha ; Thiemann, Peter 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Automata-Based Approach for Synchronizable Mailbox Communication
  Delpy, Romain ; Muscholl, Anca ; Sutre, Grégoire 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Constrained Horn Clauses for Program Verification and Synthesis (Invited Talk)
  Gurfinkel, Arie 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Modular Verification of Intrusive List and Tree Data Structures in Separation Logic
  Hermes, Marc ; Krebbers, Robbert 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Multi-Stage Proof Logging Framework to Certify the Correctness of CP Solvers
  Flippo, Maarten ; Sidorov, Konstantin ; Marijnissen, Imko ; Smits, Jeff ; Demirović, Emir 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Linear Loop Synthesis for Quadratic Invariants
  Hitarth, S. ; Kenison, George ; Kovács, Laura ; Varonka, Anton 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity
  Aubert, Clément ; Rubiano, Thomas ; Rusch, Neea ; Seiller, Thomas 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Complexity of Verifying Loop-Free Programs as Differentially Private
  Gaboardi, Marco ; Nissim, Kobbi ; Purser, David 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Formal Proofs of Tarjan’s Strongly Connected Components Algorithm in Why3, Coq and Isabelle
  Chen, Ran ; Cohen, Cyril ; Lévy, Jean-Jacques ; Merz, Stephan ; Théry, Laurent 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Duality-Based Method for Identifying Elemental Balance Violations in Metabolic Network Models
  Zabeti, Hooman ; Stephen, Tamon ; Berger, Bonnie ; Chindelevitch, Leonid 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Program Logic for Union Bounds
  Barthe, Gilles ; Gaboardi, Marco ; Grégoire, Benjamin ; Hsu, Justin ; Strub, Pierre-Yves 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Formalizing, Mechanizing, and Verifying Class-Based Refinement Types (Artifact)
  Sun, Ke ; Wang, Di ; Chen, Sheng ; Wang, Meng ; Hao, Dan
• Tenspiler: A Verified-Lifting-Based Compiler for Tensor Operations (Artifact)
  Qiu, Jie ; Cai, Colin ; Bhatia, Sahil ; Hasabnis, Niranjan ; Seshia, Sanjit A. ; Cheung, Alvin
• Formal Methods for Correct Persistent Programming (Dagstuhl Seminar 23412)
  Lahav, Ori ; Raad, Azalea ; Tassarotti, Joseph ; Vafeiadis, Viktor ; Podkopaev, Anton
• The Futures of Reactive Synthesis (Dagstuhl Seminar 23391)
  Fijalkow, Nathanaël ; Finkbeiner, Bernd ; Pérez, Guillermo A. ; Polgreen, Elizabeth ; Morvan, Rémi
• Theoretical Advances and Emerging Applications in Abstract Interpretation (Dagstuhl Seminar 23281)
  Gurfinkel, Arie ; Mastroeni, Isabella ; Miné, Antoine ; Müller, Peter ; Becchi, Anna
• A Kleene Algebra with Tests for Union Bound Reasoning About Probabilistic Programs
  Gomes, Leandro ; Baillot, Patrick ; Gaboardi, Marco 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Information Flow Analysis for Detecting Non-Determinism in Blockchain (Artifact)
  Olivieri, Luca ; Negrini, Luca ; Arceri, Vincenzo ; Tagliaferro, Fabio ; Ferrara, Pietro ; Cortesi, Agostino ; Spoto, Fausto
• Towards a Coq-verified Chain of Esterel Semantics
  Rieg, Lionel ; Berry, Gérard