Symbolic execution

Known as: Symbolic evaluation 
In computer science, symbolic execution (also symbolic evaluation) is a means of analyzing a program to determine what inputs cause each part of a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1972-2018
05010015019722018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
The last few years have seen a resurgence of interest in the use of symbolic execution—a program analysis technique… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • table 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Symbolic Pathfinder (SPF) combines symbolic execution with model checking and constraint solving for automated test case… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Mixed concrete and symbolic execution is an important technique for finding and understanding software bugs, including security… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Detecting and characterizing the effects of software changes is a fundamental component of software maintenance. Version… (More)
  • figure 1
  • figure 2
  • figure 4
  • table 1
  • table 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We discuss how to perform symbolic execution of large programs in a manner that is both compositional (hence more scalable) and… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software… (More)
  • figure 1
  • table 2
  • table 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Modern software systems, which often are concurrent and manipulate complex data structures must be extremely reliable. We present… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1989
Highly Cited
1989
This paper presents an original method to compare two synchronous sequential machines. The method consists in a breadth first… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1976
Highly Cited
1976
This paper describes the symbolic execution of programs. Instead of supplying the normal inputs to a program (e.g. numbers) one… (More)
Is this relevant?