UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Taypsi: Static Enforcement of Privacy Policies for Policy-Agnostic Oblivious Computation

Proceedings of ACM on programming languages, 2024-04, Vol.8 (OOPSLA1), p.1407-1436, Article 144

2024

Volltextzugriff (PDF)

Taype: A Policy-Agnostic Language for Oblivious Computation

Proceedings of ACM on programming languages, 2023-06, Vol.7 (PLDI), p.1001-1025, Article 147

2023

Volltextzugriff (PDF)

Oblivious algebraic data types

Proceedings of ACM on programming languages, 2022-01, Vol.6 (POPL), p.1-29

2022

Volltextzugriff (PDF)

A HAT Trick: Automatically Verifying Representation Invariants using Symbolic Finite Automata

Proceedings of ACM on programming languages, 2024-06, Vol.8 (PLDI), p.1387-1411, Article 203

2024

Volltextzugriff (PDF)

Data-driven abductive inference of library specifications

Proceedings of ACM on programming languages, 2021-10, Vol.5 (OOPSLA), p.1-29

2021

Volltextzugriff (PDF)

Covering All the Bases: Type-Based Verification of Test Input Generators

Proceedings of ACM on programming languages, 2023-06, Vol.7 (PLDI), p.1244-1267, Article 157

2023

Volltextzugriff (PDF)

CLOTHO: directed test generation for weakly consistent database systems

Proceedings of ACM on programming languages, 2019-10, Vol.3 (OOPSLA), p.1-28

2019

Volltextzugriff (PDF)

Narcissus: correct-by-construction derivation of decoders and encoders from binary formats

Proceedings of ACM on programming languages, 2019-08, Vol.3 (ICFP), p.1-29

2019

Volltextzugriff (PDF)

A Type-Based Approach to Divide-and-Conquer Recursion in Coq

Proceedings of ACM on programming languages, 2023-01, Vol.7 (POPL), p.61-90, Article 3

2023

Volltextzugriff (PDF)

Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs

Automated Reasoning, 2020, Vol.12167, p.119-137

2020

Volltextzugriff (PDF)

Proof Automation with Large Language Models

Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering, 2024, p.1509-1520

2024

Volltextzugriff (PDF)

Using Coq to write fast and correct Haskell

Proceedings of the 10th ACM SIGPLAN International Symposium on Haskell, 2017, p.52-62

2017

Volltextzugriff (PDF)

A verified protocol buffer compiler

Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2019, p.222-233

2019

Volltextzugriff (PDF)

Fiat: Deductive Synthesis of Abstract Data Types in a Proof Assistant

Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015, p.689-700

2015

Volltextzugriff (PDF)

Using Coq to write fast and correct Haskell

SIGPLAN notices, 2017-10, Vol.52 (10), p.52-62

2017

Volltextzugriff (PDF)

Repairing serializability bugs in distributed database programs via automated schema refactoring

Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021, p.32-47

2021

Volltextzugriff (PDF)

Fiat: Deductive Synthesis of Abstract Data Types in a Proof Assistant

SIGPLAN notices, 2015-05, Vol.50 (1), p.689-700

2015

Volltextzugriff (PDF)

Fitting the pieces together: a machine-checked model of safe composition

Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering, 2009, p.243-252

2009

Volltextzugriff (PDF)