Interprocedural analysis based on guarded array regions
Compiler optimizations for scalable parallel systems
Compiler optimizations for scalable parallel systems
Interprocedural Symbolic Evaluation of Ada Programs with Aliases
Ada-Europe '99 Proceedings of the 1999 Ada-Europe International Conference on Reliable Software Technologies
A Symbolic Simulator for Microprogram Development
IEEE Transactions on Computers
Applying static analysis for automated extraction of database interactions in web applications
Information and Software Technology
Program analysis for bug detection using parfait: invited talk
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Symbolic execution in algorithm design
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Ada-Europe'03 Proceedings of the 8th Ada-Europe international conference on Reliable software technologies
Eliminating redundant range checks in GNAT using symbolic evaluation
Ada-Europe'03 Proceedings of the 8th Ada-Europe international conference on Reliable software technologies
Advanced symbolic analysis for compilers: new techniques and algorithms for symbolic program analysis and optimization
Coverage criteria for state based specifications
Formal methods and testing
Labeling library functions in stripped binaries
Proceedings of the 10th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools
Automated verification and testing of user-interactive undo features in database applications
Software Testing, Verification & Reliability
Layout-oblivious compiler optimization for matrix computations
ACM Transactions on Architecture and Code Optimization (TACO) - Special Issue on High-Performance Embedded Architectures and Compilers
AskSheet: efficient human computation for decision making with spreadsheets
Proceedings of the 17th ACM conference on Computer supported cooperative work & social computing
| Hi-index | 0.01 |
Symbolic evaluation is a form of static program analysis in which symbolic expressions are used to denote the values of program variables and computations. It does not require the user to specify which path at a conditional branch to follow nor how many cycles of a loop to consider. Instead, a symbolic evaluator uses conditional expressions to represent the uncertainty that arises from branching and develops and attempts to solve recurrence relations that describe the behavior of loop variables.