A Path Traversal Conditions solver

Christophe Meudec

A Path Traversal Conditions solver

Research output: Non-textual form › Software

Abstract

A Path Traversal Conditions solver to analyse imperative programs. It can solve constraints expressed using traditional programming language constructs. It is useful for symbolic execution, static analysis of code etc.

Original language	English (Ireland)
Media of output	Online
Publication status	Published - Mar 2001

Keywords

Symbolic execution
Constraint logic programming
Prolog

Access to Document

https://github.com/echancrure/PTC-SolverLicence: CC BY-SA

Cite this

@misc{14825432af6445fa8f4aec4899994d2d,

title = "A Path Traversal Conditions solver",

abstract = "A Path Traversal Conditions solver to analyse imperative programs. It can solve constraints expressed using traditional programming language constructs. It is useful for symbolic execution, static analysis of code etc.",

keywords = "Symbolic execution, Constraint logic programming, Prolog",

author = "Christophe Meudec",

year = "2001",

month = mar,

language = "English (Ireland)",

}

TY - ADVS

T1 - A Path Traversal Conditions solver

A2 - Meudec, Christophe

PY - 2001/3

Y1 - 2001/3

N2 - A Path Traversal Conditions solver to analyse imperative programs. It can solve constraints expressed using traditional programming language constructs. It is useful for symbolic execution, static analysis of code etc.

AB - A Path Traversal Conditions solver to analyse imperative programs. It can solve constraints expressed using traditional programming language constructs. It is useful for symbolic execution, static analysis of code etc.

KW - Symbolic execution

KW - Constraint logic programming

KW - Prolog

M3 - Software

ER -

A Path Traversal Conditions solver

Abstract

Keywords

Access to Document

Fingerprint

Cite this