Filters








381 Hits in 3.2 sec

Automated Debugging Using Path-Based Weakest Preconditions [chapter]

Haifeng He, Neelam Gupta
2004 Lecture Notes in Computer Science  
Our approach combines ideas from software testing and weakest preconditions used in correctness proof methods to locate a likely erroneous statement.  ...  Software debugging is the activity of locating and correcting erroneous statements in programs.  ...  In this paper, we define a notion of path-based weakest precondition for statements along a path in a program.  ... 
doi:10.1007/978-3-540-24721-0_20 fatcat:lrqzt7hprvc5zggnqfdinx2zgu

Automated Debugging for Arbitrarily Long Executions

Cristian Zamfir, Baris Kasikci, Johannes Kinder, Edouard Bugnion, George Candea
2013 USENIX Workshop on Hot Topics in Operating Systems  
In this paper we argue that automated postmortem debugging of failures is feasible for real, inproduction systems with no runtime recording.  ...  We argue that the RES approach could be used to (1) automatically classify bug reports based on their root cause, (2) automatically identify coredumps for which hardware errors (e.g., bad memory), not  ...  Prior work based on static analysis can compute backward program slices [20, 26] or derive weakest preconditions [7, 10] for given vulnerabilities.  ... 
dblp:conf/hotos/ZamfirKKBC13 fatcat:2odwu4suxzgmzetzoktfwlal7i

Whodunit? Causal Analysis for Counterexamples [chapter]

Chao Wang, Zijiang Yang, Franjo Ivančić, Aarti Gupta
2006 Lecture Notes in Computer Science  
The procedure uses an efficient weakest pre-condition algorithm carried out on a single concrete execution path, which is significantly more scalable than other model checking based approaches.  ...  In this paper, we provide an automated procedure to zoom in to potential software defects by analyzing a single concrete counterexample.  ...  Instead, we use a path-based syntactic-level weakest precondition computation algorithm to aid the analysis.  ... 
doi:10.1007/11901914_9 fatcat:txhziw2jfveljc2qocqpctrtcm

A Synergistic Analysis Method for Explaining Failed Regression Tests

Qiuping Yi, Zijiang Yang, Jian Liu, Chen Zhao, Chao Wang
2015 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering  
We propose a new automated debugging method for regression testing based on a synergistic application of both dynamic and semantic analysis.  ...  We have implemented our new method in a software tool based on the LLVM compiler and the KLEE symbolic virtual machine.  ...  Our semantic analysis is based on computing the weakest precondition of ¬ρ along the faulty execution path.  ... 
doi:10.1109/icse.2015.46 dblp:conf/icse/YiYLZW15 fatcat:7jm6s6vjqre3jmntw74mja5e34

A visual interactive debugger based on symbolic execution

Reiner Hähnle, Marcus Baum, Richard Bubel, Marcel Rothe
2010 Proceedings of the IEEE/ACM international conference on Automated software engineering - ASE '10  
It allows to start debugging of source code at any code location without the need to write a fixture as well as to visualize all possible symbolic execution paths and all symbolic states up to a finite  ...  We present the concepts, usage, and prototypic implementation of a new kind of visual debugging tool based on symbolic execution of Java source code called visual symbolic state debugger.  ...  Using first-order theorem proving we can even realize semantic backward slicing, i.e., automatic identification of the program point leading to a violation of a given property by weakest precondition computation  ... 
doi:10.1145/1858996.1859022 dblp:conf/kbse/HahnleBBR10 fatcat:lnuw6kky4ng47iasw43ncets5m

Path-Based Program Repair

Heinz Riener, Rüdiger Ehlers, Görschwin Fey
2015 Electronic Proceedings in Theoretical Computer Science  
We propose a path-based approach to program repair for imperative programs.  ...  Initial results for small programs indicate that the approach is useful for debugging programs in practice.  ...  Since loops are already unrolled, no loop invariants have to be found, and thus computing strongest postconditions and weakest preconditions along control-flow paths is decidable if the logic in use admits  ... 
doi:10.4204/eptcs.178.3 fatcat:q4czrgm23bgidpxdxl245fylxa

Golden implementation driven software debugging

Ansuman Banerjee, Abhik Roychoudhury, Johannes A. Harlie, Zhenkai Liang
2010 Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering - FSE '10  
In this paper, we investigate the possibility of using the golden implementation as a reference model in software debugging.  ...  During dynamic slicing we also perform a stepby-step weakest precondition computation of the observable error with respect to the statements in the dynamic slice.  ...  To exploit the golden implementation in software debugging, the debugging method should be based on semantic analysis.  ... 
doi:10.1145/1882291.1882319 dblp:conf/sigsoft/BanerjeeRHL10 fatcat:n7tay6xaw5hoppnjydddh5nppq

Recent advances on trusted computing in China

Wei Dong, LiQian Chen
2012 Chinese Science Bulletin  
On this basis, they presented a conservative variant of weakest precondition to specify the over-approximated weakest precondition via variable abstraction. Chen et al.  ...  Testing and debugging continue to be important means for improving software trustworthiness. To build a semantic framework for automated debugging, Li et al.  ... 
doi:10.1007/s11434-012-5550-z fatcat:nyevowgxtnfyjmhghtwjw5wuuy

Integrated and Tool-Supported Teaching of Testing, Debugging, and Verification [chapter]

Wolfgang Ahrendt, Richard Bubel, Reiner Hähnle
2009 Lecture Notes in Computer Science  
This paper reports about the design, implementation, and experiences with a non-traditional formal methods course called "Testing, Debugging, and Verification".  ...  Special thanks go to Joanna Chimiak-Opoka for using KeY-Hoare in her lecture as well as providing examples and continuous feedback that was an invaluable help and motivation to improve the KeY-Hoare tool  ...  -The calculus is computational and resembles in this aspect Dijkstra's weakest precondition calculus.  ... 
doi:10.1007/978-3-642-04912-5_9 fatcat:llzt4yowerbp7myyvmkl2i67oy

Ahead of time static analysis for automatic generation of debugging interfaces to the Linux kernel

Tegawendé F. Bissyandé, Laurent Réveillère, Julia L. Lawall, Gilles Muller
2014 Automated Software Engineering : An International Journal  
Based on this information, developers of kernel services can then use Diagnosys to generate a debugging interface specialized to their code.  ...  Our experiments show that the generated debugging interface provides useful log information and incurs a low performance penalty.  ...  Automatic generation of a debugging interface using DIGen based on the inferred preconditions. This phase is carried out by each service developer for each specific service under development.  ... 
doi:10.1007/s10515-014-0152-4 fatcat:snxdvn4ebneejoxmmpzkip272u

Verified symbolic execution with Kripke specification monads (and no meta-programming)

Steven Keuchel, Sander Huyghebaert, Georgy Lukyanov, Dominique Devriese
2022 Proceedings of the ACM on Programming Languages (PACMPL)  
This symbolic monad lives in a universe that is Kripke-indexed by variables in scope and a path condition.  ...  Verifying soundness of symbolic execution-based program verifiers is a significant challenge.  ...  Ideally, we want to detect during the calculation of the weakest precondition when the execution paths become infeasible and discard this path entirely.  ... 
doi:10.1145/3547628 fatcat:sq7lori7wfebrpbrv3mzmbiifm

The SANTE Tool: Value Analysis, Program Slicing and Test Generation for C Program Debugging [chapter]

Omar Chebaro, Nikolai Kosmatov, Alain Giorgetti, Jacques Julliand
2011 Lecture Notes in Computer Science  
Alarmguided test generation is then used to analyze the simplified program(s) in order to confirm or reject alarms.  ...  FRAMA-C is distributed as open source with various plug-ins (i.e. value analysis, dependency analysis, program slicing, weakest precondition, ...).  ...  Automated software validation is aimed at reducing this cost.  ... 
doi:10.1007/978-3-642-21768-5_7 fatcat:3s3ue3xcx5bzfbgz6a6mno76qm

Reproducing and debugging field failures in house

Wei Jin
2013 2013 35th International Conference on Software Engineering (ICSE)  
Our initial results are promising and provide evidence that our approach is able to reproduce failures using limited field execution information and help debugging.  ...  This approach can synthesize several executions similar to an observed field execution to help reproduce the observed field behaviors, and use these executions, in conjunction with several debugging techniques  ...  A third family of automated debugging techniques are formula-based fault localization techniques (e.g., [14] , [19] ).  ... 
doi:10.1109/icse.2013.6606738 dblp:conf/icse/Jin04 fatcat:qdwf7gmpbzd5pcfx25yggruzr4

Diagnosys: automatic generation of a debugging interface to the Linux kernel

Tegawendé F. Bissyandé, Laurent Réveillère, Julia L. Lawall, Gilles Muller
2012 Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering - ASE 2012  
Based on this information, service developers can then use Diagnosys to generate a debugging interface specialized to their code.  ...  Our experiments show that the generated debugging interface provides useful log information and incurs a low performance penalty.  ...  , 2) automatic generation of a debugging interface using DIGen based on the inferred preconditions, and 3) testing service code with the support of the debugging interface.  ... 
doi:10.1145/2351676.2351686 dblp:conf/kbse/BissyandeRLM12 fatcat:imqhyroztrh5hncicbvonchk7m

KATCH: high-coverage testing of software patches

Paul Dan Marinescu, Cristian Cadar
2013 Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2013  
In this paper, we address this problem using a technique for automatically testing code patches.  ...  Our technique combines symbolic execution with several novel heuristics based on static and dynamic program analysis which allow it to quickly reach the code of the patch.  ...  In the context of automated debugging, execution synthesis [44] and Bu-gRedux [23] attempt to solve a similar problem: generating an input or a path starting from a set of 'waypoints' through which  ... 
doi:10.1145/2491411.2491438 dblp:conf/sigsoft/MarinescuC13 fatcat:725vtvsozzbhtpkozhx4t6jvvy
« Previous Showing results 1 — 15 out of 381 results