Execution Synthesis: A Technique for Automating the Debugging of Software

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Enterprises collect data in large volumes and leverage them to drive numerous concurrent decisions and business processes. Their teams deploy multiple applications that often operate concurrently on the same data and infrastructure but have widely differen ...

How to measure students' Computational Problem-Solving (CPS) competencies is an ongoing research topic. Prevalent approaches vary by measurement tools (e.g., interactive programming, multiple-choice tests, or programming-independent tests) and task types ( ...

Verification and testing of hardware heavily relies on cycle-accurate simulation of RTL. As single-processor performance is growing only slowly, conventional, single-threaded RTL simulation is becoming impractical for increasingly complex chip designs and ...

This thesis demonstrates that it is feasible for systems code to expose a latency interface that describes its latency and related side effects for all inputs, just like the code's semantic interface describes its functionality and related side effects. S ...

Precise exceptions are a cornerstone of modern computing as they provide the abstraction of sequential instruction execution to programmers while accommodating microarchitectural optimizations. However, increasing compute capabilities in deep memory hierar ...

Most modern in-memory online transaction processing (OLTP) engines rely on multi-version concurrency control (MVCC) to provide data consistency guarantees in the presence of conflicting data accesses. MVCC improves concurrency by generating a new version o ...

Fuzzing reliably and efficiently finds bugs in software, including operating system kernels. In general, higher code coverage leads to the discovery of more bugs. This is why most existing kernel fuzzers adopt strategies to generate a series of inputs that ...

Fuzzing has emerged as the most broadly used testing technique to discover bugs. Effective fuzzers rely on coverage to prioritize inputs that exercise new program areas. Edge-based code coverage of the Program Under Test (PUT) is the most commonly used cov ...

The demise of Moore's Law and Dennard scaling has resulted in diminishing performance gains for general-purpose processors, and so has prompted a surge in academic and commercial interest for hardware accelerators. Specialized hardware has already redefine ...

A central task in high-level synthesis is scheduling: the allocation of operations to clock cycles. The classic approach to scheduling is static, in which each operation is mapped to a clock cycle at compile-time, but recent years have seen the emergence o ...

The hardware complexity of modern machines makes the design of adequate programming models crucial for jointly ensuring performance, portability, and productivity in high-performance computing (HPC). Sequential task-based programming models paired with adv ...

Formally verifying the correctness of software network functions (NFs) is necessary for network reliability, yet existing techniques require full source code and mandate the use of specific data structures. We describe an automated technique to verify NF b ...

Timely insights lead to business growth and scientific breakthroughs but require analytical engines that cope with the ever-increasing data processing needs. Analytical engines relied on rapid CPU improvements, yet the end of Dennard scaling stopped the fr ...

High-level synthesis (HLS) tools typically generate statically scheduled datapaths. Static scheduling implies that the resulting circuits have a hard time exploiting parallelism in code with potential memory dependences, with control dependences, or where ...

The concept of novelty is central to questions of creativity, innovation, and discovery. Despite the prominence in scientific inquiry and everyday discourse, there is a chronic ambiguity over its meaning and a surprising variety of empirical measures, whic ...

High-level synthesis is a mature Electronics Design Automation (EDA) technology for building hardware design in a short time. It produces automatically HDL code for FPGAs out of C/C++, bridging the gap from algorithm to hardware. Nevertheless, sometimes th ...

Approximate logic synthesis is an emerging field that tolerates errors in the synthesized logic circuits for better optimization quality. Indeed, in many computing problems, the requirement of preserving the exact functionality either results in unnecessar ...

Individual transistors based on emerging reconfigurable nanotechnologies exhibit electrical conduction for both types of charge carriers. These transistors (referred to as Reconfigurable Field-Effect Transistors (RFETs)) enable dynamic reconfiguration to d ...

The aim of this paper is to serve as a lightweight introduction to concurrency control for database theorists through a uniform presentation of the work on robustness against Multiversion Read Committed and Snapshot Isolation. ...

In this thesis, we present a theory of value for the design and analysis of service ecosystems. The theory is based on general systems thinking. The concept of a system is used for relating knowledge from different disciplines (such as software engineering ...

Execution Synthesis: A Technique for Automating the Debugging of Software

Chattez avec Graph Search

Oligolithic Cross-task Optimizations across Isolated Workloads

A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving

Highly Parallel RTL Simulation

Latency Interfaces for Systems Code

Imprecise Store Exceptions

One-shot Garbage Collection for In-memory OLTP through Temporality-aware Version Storage

ACTOR: Action-Guided Kernel Fuzzing

Arvin: Greybox Fuzzing Using Approximate Dynamic CFG Analysis

Building Chips Faster: Hardware-Compiler Co-Design for Accelerated RTL Simulation

DASS: Combining Dynamic & Static Scheduling in High-Level Synthesis

Decentralized in-order execution of a sequential task-based code for shared-memory architectures

Automated Verification of Network Function Binaries

Efficient Analytical Query Processing on CPU-GPU Hardware Platforms

From C/C plus plus Code to High-Performance Dataflow Circuits

Nothing New Under the Sun: Novelty Constructs and Measures in Social Studies

Optimizing Lattice-based Post-Quantum Cryptography Codes for High-Level Synthesis

Logic Synthesis From Incomplete Specifications Using Disjoint Support Decomposition

Utilizing XMG-based Synthesis to Preserve Self-Duality for RFET-Based Circuits

Concurrency control for database theorists

A Theory of Value for Service Ecosystems