David Deharbe, Silvio Ranise  Home/Search
Context Related
| loria.fr/~ranise/pubs/sefm03.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: loria.fr/~ranise/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Software bugs are very difficult to detect even in small units of code. Several techniques to debug or prove correct such units are based on the generation of a set of formulae whose unsatisfiability reveals the presence of an error. These techniques assume the availability of a theorem prover capable of automatically discharging the resulting proof obligations. Building such a tool is a difficult, long, and error-prone activity. In this paper, we describe techniques to build provers which are... (Update)
Cited by: More
Multi-Prover Veri - Cation Of Programs (Correct)
ArgoLib Version 1.00 - Maric, Janicic (2003) (Correct)
Automated Provers doing (Higher-Order) Proof search: A Case.. - Mehta, Ranise (2004) (Correct)
Active bibliography (related documents): More All
0.9: BDD-Driven First-Order Satisfiability Procedures - Déharbe, Ranise (Correct)
0.2: Combining Non-Stably Infinite, Non-First Order Theories - Fontaine, Gribomont (2004) (Correct)
0.2: High-Performance Deduction for Verification: A Case.. - Armando, Bonacina.. (2002) (Correct)
Similar documents based on text: More All
0.4: Building Convex Hulls by Combining - Sat Solving And (2003) (Correct)
0.3: Symbolic Model Checking With Fewer Fixpoint Computations - Déharbe, Moreira (Correct)
0.3: SMMM - A Secure Multimedia Mail System - de Moura, Filho, Batista, Soares (Correct)
Related documents from co-citation: More All
2: Proving pointer programs in higher-order logic - Mehta, Nipkow - 2003
2: Integrating Decision Procedures into Heuristic Theorem Provers: A Case Study of .. - Boyer, Moore - 1985
BibTeX entry: (Update)
D. Deharbe and S. Ranise. Light-Weight Theorem Proving for Debugging and Verifying Units of Code. In Proc. of the International Conference on Software Engineering and Formal Methods (SEFM03), Brisbane, Australia, September 2003. IEEE Computer Society Press. http://citeseer.ist.psu.edu/deharbe03lightweight.html More
@misc{ deharbe03lightweight,
author = "D. Deharbe and S. Ranise",
title = "Light-Weight Theorem Proving for Debugging and Verifying Units of Code",
text = "D. Deharbe and S. Ranise. Light-Weight Theorem Proving for Debugging and
Verifying Units of Code. In Proc. of the International Conference on Software
Engineering and Formal Methods (SEFM03), Brisbane, Australia, September
2003. IEEE Computer Society Press.",
year = "2003",
url = "citeseer.ist.psu.edu/deharbe03lightweight.html" }
Citations (may not include all citations):1726 Graph-Based Algorithms for Boolean Function Manipulation - Bryant - 1984
370 A Mathematical Introduction to Logic (context) - Enderton - 1972
275 Dynamic variable ordering for ordered binary decision diagra.. (context) - Rudell - 1993
154 Simplification by cooperating decision procedures (context) - Nelson, Oppen - 1979
140 Extended Static Checking for Java - Flanagan, Leino et al. - 2002
108 Automatically Validating Temporal Safety Properties of Inter.. - Ball, Rajamani - 2001
59 A static analyzer for finding dynamic programming errors - Bush, Pincus et al. - 2000
49 Symbolic Execution and Program Testing (context) - King - 1976
37 Paramodulation-based theorem proving - Nieuwenhuis, Rubio - 2001
36 Finding Bugs with a Constraint Solver (context) - Jackson, Vaziri - 2000
24 Theorem-proving with Resolution and Superposition (context) - Rusinowitch - 1991
22 Checking Satisfiability of First-Order Formulas by Increment.. - Barrett, Dill et al. - 2002
20 Verifying Reachability Invariants of Linked Structures (context) - Nelson - 1983
16 Techniques for Program Verification (context) - Nelson - 1981
12 Using specifications to check source code - Evans - 1994
11 a brainiac theorem prover (context) - Schulz - 2002
11 Introduction to the OBDD Algorithm for the ATP Community - Moore - 1994
10 process mutual exclusion algorithm using abstraction (context) - Jensen, Lynch et al. - 1998
7 Assignment commands with array references (context) - Downey, Sethi - 1978
6 Lemmas on Demand for Satisfiability Solvers - de Moura, Ruess - 2002
4 A Rewriting Approach to Satisfiability Procedures (context) - Armando, Ranise et al. - 2003
4 Conditional expressions with equality tests (context) - Sethi - 1978
2 chapter A Basis of a Mathematical Theory of Computation (context) - McCarthy, Formal - 1963
1 High-Performance Deduction for Verification: A Case Study in.. - Armando, Bonacina et al.
1 Building Satisfiability Procedures for Verification: The Cas.. (context) - Imine, Ranise - 2003
1 Bdd-driven first-order satisfiability procedures (context) - Deharbe, Ranise - 2002
1 Small clause normal form (context) - Weidenbach, Nonnengart - 2001
1 Applying light-weight theorem proving to debugging and verif.. (context) - Ranise, Deharbe - 2003
Documents on the same site (http://www.loria.fr/~ranise/papers.html): More
Proving and Debugging Set-Based Specifications - Couchot Dadeau Eharbe (Correct)
A Superposition Based Methodology to Design.. - Armando, Ranise.. (2001) (Correct)
Rewrite and Decision Procedure Laboratory: Combining.. - Armando, Compagna.. (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC