What is the name of the back-end for FoREnSiC?

FoREnSiC is short for “Formal Repair Environment for Simple C”, but it has already outgrown its name: it also detects and locates errors, and it applies also semi-formal and dynamic methods.

What is the definition of a problem?

Debugging incorrect programs is labor-intensive, frustrating, and costly, yet unavoidable in modern software and hardware development.

What was the funding for this work?

This work was supported in part by the European Commission through project DIAMOND (FP7-2009-IST-4-248613), and by the Austrian Science Fund (FWF) through the national research network RiSE (S11406-N23).

How many versions of the backend can be solved with the symbolic back-end?

The cutpoint-based back-end solves 29 versions, including 9 that cannot be solved with the simulation-based back-end and 11 that cannot be solved with the symbolic back-end.

How many versions of the symbolic back-end can be solved?

The simulation-based back-end fixes 26 versions, including 5 that cannot be solved with the symbolic back-end and 6 that cannot be solved with the cut-based back-end.

Open AccessBook Chapter10.1007/978-3-642-39611-3_24

FoREnSiC: an automatic debugging environment for C programs

Roderick Bloem, +8 more

- 06 Nov 2012

- pp 260-265

TL;DR: FoREnSiC, an open source environment for automatic error detection, localization and correction in C programs, is presented, which implements different automated debugging methods in a unified way covering the whole design flow from ESL to RTL.

Abstract: We present FoREnSiC, an open source environment for automatic error detection, localization and correction in C programs. The framework implements different automated debugging methods in a unified way covering the whole design flow from ESL to RTL. Currently, a scalable simulation-based back-end, a back-end based on symbolic execution, and a formal back-end exploiting functional equivalences between a C program and a hardware design are available. FoREnSiC is designed as an extensible framework. Its infrastructure, including a powerful front-end and interfaces to logic problem solvers, can be reused for implementing new program analysis or debugging methods. In addition to the infrastructure, the back-ends, and a few experimental results, we present an illustrative application scenario that shows FoREnSiC in use.

AI Agents for this Paper

Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps

Most frequently asked questions

1. What contributions have the authors mentioned in the paper "Forensic– an automatic debugging environment for c programs" ?

The authors present FoREnSiC, an open source environment for automatic error detection, localization and correction in C programs.. In addition to the infrastructure, the back-ends, and a few experimental results, the authors present an illustrative application scenario that shows FoREnSiC in use.

2. What have the authors stated for future works in "Forensic– an automatic debugging environment for c programs" ?

By this, FoREnSiC can alleviate and stimulate further research and development in the challenging fields of automated hardware and software verification and debugging.. Future work includes improving the back-ends regarding performance, the subset of C that can be handled, and their fault models.

3. What is the reason for the cut-based back-end?

The cut-based back-end implements a new verification, localization and repair method based on functional equivalences, so-called cutpoints, between two designs.

4. What is the first step of the repair engine?

the repair engine synthesizes new implementations of the faulty components using templates for expressions and iterative refinements which are guided by counterexamples [11].

Citations

Book Chapter•10.1007/978-3-642-39611-3_11

Repair with on-the-fly program analysis

Robert Könighofer, +1 more

- 06 Nov 2012

TL;DR: This paper presents a novel automatic repair approach for incorrect programs that applies formal methods and analyzes program behavior only on demand and argues that this is beneficial, especially if exhaustive program analysis is infeasible.

...read moreread less

•Book Chapter•10.1007/978-3-662-54577-5_17

Connecting Program Synthesis and Reachability: Automatic Program Repair Using Test-Input Generation

ThanhVu Nguyen, +3 more

- 24 Apr 2017

TL;DR: In this paper, it was shown that the template-based synthesis problem and reachability problem are equivalent, and the reductions between the two problems were shown to be equivalent, which establishes a link between them and allows for transfer of techniques and results between them.

...read moreread less

•Proceedings Article•10.5555/2616606.2617064

Effective post-silicon failure localization using dynamic program slicing

Ophir Friedler, +4 more

- 24 Mar 2014

TL;DR: A novel method is proposed that automates the architectural localization of post-silicon test-case failures by creating a resource dependency graph, determining a program slice of instructions that influence the faulty resources, and the reduction of the set of suspicious instructions by leveraging the knowledge of the correct resources.

...read moreread less

•Book Chapter•10.1007/978-3-030-53291-8_33

Must Fault Localization for Program Repair

Bat-Chen Rothenberg, +1 more

- 21 Jul 2020

TL;DR: A new algorithm for fault localization is developed and it is proved that it is must with respect to commonly used schemes in automated program repair, and is incorporated into an existing mutation-based program repair algorithm.

...read moreread less

•Book Chapter•10.1007/978-3-319-13338-6_8

Automatic Error Localization for Software Using Deductive Verification

Robert Könighofer, +2 more

- 18 Nov 2014

TL;DR: This paper presents an automatic approach for identifying potential error locations in software, based on a deductive verification engine, which detects errors in functions annotated with pre- and post-conditions.

...read moreread less

...

Expand

References

Book Chapter•10.1007/978-3-540-24605-3_37

An Extensible SAT-solver

Niklas Een, +1 more

- 05 May 2003

TL;DR: This article presents a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff, and includes among other things a mechanism for adding arbitrary boolean constraints.

...read moreread less

3.4K

Journal Article•10.1016/0004-3702(87)90062-2

A theory of diagnosis from first principles

Raymond Reiter

- 01 Oct 1987

- Artificial Intelligence

TL;DR: The theory accommodates diagnostic reasoning in a wide variety of practical settings, including digital and analogue circuits, medicine, and database updates, and reveals close connections between diagnostic reasoning and nonmonotonic reasoning.

...read moreread less

3.2K

•Proceedings Article•10.1145/1101908.1101949

Empirical evaluation of the tarantula automatic fault-localization technique

James A. Jones, +1 more

- 07 Nov 2005

TL;DR: The studies show that, on the same set of subjects, the Tarantula technique consistently outperforms the other four techniques in terms of effectiveness in fault localization, and is comparable in efficiency to the least expensive of the other five techniques.

...read moreread less

1.2K

Proceedings Article•10.1145/1168857.1168907

Combinatorial sketching for finite programs

Armando Solar-Lezama, +4 more

- 20 Oct 2006

TL;DR: SKETCH is a language for finite programs with linguistic support for sketching and its combinatorial synthesizer is complete for the class of finite programs, guaranteed to complete any sketch in theory, and in practice has scaled to realistic programming problems.

...read moreread less

857

•Proceedings Article•10.1145/775832.775928

Behavioral consistency of C and Verilog programs using bounded model checking

Edmund M. Clarke, +2 more

- 02 Jun 2003

TL;DR: This work presents an algorithm that checks behavioral consistency between an ANSI-C program and a circuit given in Verilog using Bounded Model Checking and describes experimental results on various reactive circuits and programs.

...read moreread less

331

FoREnSiC: an automatic debugging environment for C programs

Chat with Paper

AI Agents for this Paper

Most frequently asked questions

1. What contributions have the authors mentioned in the paper "Forensic– an automatic debugging environment for c programs" ?

2. What have the authors stated for future works in "Forensic– an automatic debugging environment for c programs" ?

3. What is the reason for the cut-based back-end?

4. What is the first step of the repair engine?

5. What is the name of the back-end for FoREnSiC?

6. What is the definition of a problem?

7. What was the funding for this work?

8. How many versions of the backend can be solved with the symbolic back-end?

9. What is the main purpose of FoREnSiC?

10. How many versions of the symbolic back-end can be solved?

Figures

Citations

Repair with on-the-fly program analysis

Connecting Program Synthesis and Reachability: Automatic Program Repair Using Test-Input Generation

Effective post-silicon failure localization using dynamic program slicing

Must Fault Localization for Program Repair

Automatic Error Localization for Software Using Deductive Verification

References

An Extensible SAT-solver

A theory of diagnosis from first principles

Empirical evaluation of the tarantula automatic fault-localization technique

Combinatorial sketching for finite programs

Behavioral consistency of C and Verilog programs using bounded model checking

Related Papers (5)

Automated error localization and correction for imperative programs

Cause clue clauses: error localization using maximum satisfiability

Using Mutation to Automatically Suggest Fixes for Faulty Programs

A Scalable Formal Debugging Approach with Auto-Correction Capability Based on Static Slicing and Dynamic Ranking for RTL Datapath Designs

A formal approach to debug polynomial datapath designs