#### Filter Results:

- Full text PDF available (37)

#### Publication Year

2000

2015

- This year (0)
- Last 5 years (4)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

Recently symbolic execution (SE) [15] has been successfully proven to be an alternative to CEGAR for program verification offering the following benefits among others [12, 18]: (1) it does notâ€¦ (More)

We consider the problem of exploring the search tree of a CLP goal in pursuit of a target property. Essential to such a process is a method of tabling to prevent duplicate exploration. Typically,â€¦ (More)

- Joxan Jaffar, Andrew E. Santosa, Roland H. C. Yap, Kenny Q. Zhu
- 16th IEEE International Conference on Tools withâ€¦
- 2004

We present a framework for the parallelization of depth-first combinatorial search algorithms on a network of computers. Our architecture is intended for a distributed setting and uses a workâ€¦ (More)

- Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
- 25th IEEE International Real-Time Systemsâ€¦
- 2004

Constraint logic programming (CLP) has been used to model programs and transition systems for the purpose of verification problems. In particular, it has been used to model timed safety automataâ€¦ (More)

- Joxan Jaffar, Jorge A. Navas, Andrew E. Santosa
- ArXiv
- 2011

In previous work, we presented a symbolic execution method which starts with a concrete model of the program but progressively abstracts away details only when these are known to be irrelevant usingâ€¦ (More)

- Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
- AAAI
- 2008

We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if the latterâ€™s contextâ€¦ (More)

Symbolic execution with interpolation is emerging as an alternative to CEGAR for software verification. The performance of both methods relies critically on interpolation in order to obtain the mostâ€¦ (More)

Recursively defined properties are ubiquitous. We present a proof method for establishing entailment G |= H of such properties G and H over a set of common variables. The main contribution is aâ€¦ (More)

- Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
- ICLP
- 2005

We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its basic level, thisâ€¦ (More)

- Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
- VMCAI
- 2006

We present an implementation of symbolic reachability analysis with the features of compositionality, and intermittent abstraction, in the sense of pefrorming approximation only at selected programâ€¦ (More)