Suchergebnisse - CCS Concepts: • Theory of computation → Programming logic

Computing Precise Control Interface Specifications von Campbell, Eric Hayden, Hojjat, Hossein, Foster, Nate

“… Verifying network programs is challenging because of how they divide labor: the control plane computes high level routes through the network and compiles them …”
Volltext

Structural Temporal Logic for Mechanized Program Verification von Ioannidis, Eleftherios, Zakowski, Yannick, Zdancewic, Steve, Angel, Sebastian

“… , the guardedness checker). Further, reasoning at the level of models instead of program constructs creates a verification gap that loses the benefits of modularity and composition enjoyed by structural program logics such as Hoare Logic …”
Volltext

Fast and Optimal Extraction for Sparse Equality Graphs von Goharshady, Amir Kafshdar, Lam, Chun Kit, Parreaux, Lionel

“… Equality graphs (e-graphs) are used to compactly represent equivalence classes of terms in symbolic reasoning systems. Beyond their original roots in automated …”
Volltext

StarMalloc: Verifying a Modern, Hardened Memory Allocator von Reitz, Antonin, Fromherz, Aymeric, Protzenko, Jonathan

“… Using the Steel separation logic framework, we show how to specify and verify a multitude of low-level patterns and delicate security mechanisms, by relying on a combination of dependent types, SMT …”
Volltext

On compiling Boolean circuits optimized for secure multi-party computation von Büscher, Niklas, Franz, Martin, Holzer, Andreas, Veith, Helmut, Katzenbeisser, Stefan

“… Secure multi-party computation (MPC) allows two or more distrusting parties to jointly evaluate a function over private inputs …”
Volltext

Layered and object-based game semantics von Oliveira Vale, Arthur, Melliès, Paul-André, Shao, Zhong, Koenig, Jérémie, Stefanesco, Léo

“… Large-scale software verification relies critically on the use of compositional languages, semantic models, specifications, and verification techniques. Recent …”
Volltext

SSA Translation Is an Abstract Interpretation von Lemerre, Matthieu

“… Static single assignment (SSA) form is a popular intermediate representation that helps implement useful static analyses, including global value numbering …”
Volltext

Why Are Proofs Relevant in Proof-Relevant Models? von Kerinec, Axel, Manzonetto, Giulio, Olimpieri, Federico

“… Relational models of λ-calculus can be presented as type systems, the relational interpretation of a λ-term being given by the set of its typings. Within a …”
Volltext

A General Noninterference Policy for Polynomial Time von Hainry, Emmanuel, Péchoux, Romain

“… We introduce a new noninterference policy to capture the class of functions computable in polynomial time on an object-oriented programming language …”
Volltext

A reasonably exceptional type theory von Pédrot, Pierre-Marie, Tabareau, Nicolas, Fehrmann, Hans Jacob, Tanter, Éric

“… Traditional approaches to compensate for the lack of exceptions in type theories for proof assistants have severe drawbacks from both a programming and a reasoning perspective …”
Volltext

Separation logic for sequential programs (functional pearl) von Charguéraud, Arthur

“… This paper presents a simple mechanized formalization of Separation Logic for sequential programs …”
Volltext

ARM2GC: Succinct Garbled Processor for Secure Computation von Songhori, Ebrahim M., Riazi, M. Sadegh, Hussain, Siam U., Sadeghi, Ahmad-Reza, Koushanfar, Farinaz

“… We present ARM2GC, a novel secure computation framework based on Yao's Garbled Circuit (GC …”
Volltext

Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming von Ehrhard, Thomas, Pagani, Michele, Tasson, Christine

“… This category gives a denotational model of an extension of PCF supporting the main primitives of probabilistic functional programming, like continuous and discrete probabilistic distributions …”
Volltext

Compiling with Abstract Interpretation von Lesbre, Dorian, Lemerre, Matthieu

“… Rewriting and static analyses are mutually beneficial techniques: program transformations change the inten- sional aspects of the program, and can thus improve …”
Volltext

A separation logic for heap space under garbage collection von Madiot, Jean-Marie, Pottier, François

“… We present SL♢, a Separation Logic that allows controlling the heap space consumption of a program in the presence of dynamic memory allocation and garbage collection …”
Volltext

Proving expected sensitivity of probabilistic programs von Barthe, Gilles, Espitau, Thomas, Grégoire, Benjamin, Hsu, Justin, Strub, Pierre-Yves

“… We develop a relational program logic called EpRHL for proving expected sensitivity properties …”
Volltext

Intersection types and (positive) almost-sure termination von Dal Lago, Ugo, Faggian, Claudia, Rocca, Simona Ronchi Della

“… Randomized higher-order computation can be seen as being captured by a λ-calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice …”
Volltext

Polyadic approximations, fibrations and intersection types von Mazza, Damiano, Pellissier, Luc, Vial, Pierre

“… Starting from an exact correspondence between linear approximations and non-idempotent intersection types, we develop a general framework for building systems …”
Volltext

Reduction monads and their signatures von Ahrens, Benedikt, Hirschowitz, André, Lafont, Ambroise, Maggesi, Marco

“… In this work, we study reduction monads , which are essentially the same as monads relative to the free functor from sets into multigraphs. Reduction monads …”
Volltext