default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoxan Jaffar
Person information
- affiliation: National University of Singapore (NUS)
SPARQL queries 
🛈 Please note that only 74% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c71]Arpita Dutta
, Rasool Maghareh, Joxan Jaffar, Sangharatna Godboley, Xiao Liang Yu:
TracerX: Pruning Dynamic Symbolic Execution with Deletion and Weakest Precondition Interpolation (Competition Contribution). FASE 2024: 320-325- 2021
- [c70]Sangharatna Godboley, Joxan Jaffar, Rasool Maghareh, Arpita Dutta:
Toward optimal mc/dc test case generation. ISSTA 2021: 505-516 - 2020
- [j20]Minh-Thai Trinh, Duc-Hiep Chu, Joxan Jaffar:
Inter-theory dependency analysis for SMT string solvers. Proc. ACM Program. Lang. 4(OOPSLA): 192:1-192:27 (2020) - [c69]Joxan Jaffar, Rasool Maghareh, Sangharatna Godboley, Xuan-Linh Ha:
TracerX: Dynamic Symbolic Execution with Interpolation (Competition Contribution). FASE 2020: 530-534 - [i7]Joxan Jaffar, Rasool Maghareh, Sangharatna Godboley, Xuan-Linh Ha:
TracerX: Dynamic Symbolic Execution with Interpolation. CoRR abs/2012.00556 (2020)
2010 – 2019
- 2019
- [c68]Joxan Jaffar, Sangharatna Godboley, Rasool Maghareh:
Optimal MC/DC test case generation. ICSE (Companion Volume) 2019: 288-289 - 2018
- [j19]Gregory J. Duck, Joxan Jaffar, Roland H. C. Yap:
Shape Neutral Analysis of Graph-based Data-structures. Theory Pract. Log. Program. 18(3-4): 470-483 (2018) - [i6]Gregory J. Duck, Joxan Jaffar, Roland H. C. Yap:
Shape Neutral Analysis of Graph-based Data-structures. CoRR abs/1804.09352 (2018) - 2017
- [c67]Minh-Thai Trinh, Duc-Hiep Chu, Joxan Jaffar:
Model Counting for Recursively-Defined Strings. CAV (2) 2017: 399-418 - 2016
- [c66]Minh-Thai Trinh, Duc-Hiep Chu, Joxan Jaffar:
Progressive Reasoning over Recursively-Defined Strings. CAV (1) 2016: 218-240 - [c65]Duc-Hiep Chu, Joxan Jaffar, Rasool Maghareh:
Symbolic execution for memory consumption analysis. LCTES 2016: 62-71 - [c64]Duc-Hiep Chu, Joxan Jaffar, Rasool Maghareh:
Precise Cache Timing Analysis via Symbolic Execution. RTAS 2016: 293-304 - [i5]Duc-Hiep Chu, Joxan Jaffar, Vijayaraghavan Murali:
Incremental Quantitative Analysis on Dynamic Costs. CoRR abs/1607.02238 (2016) - 2015
- [c63]Duc-Hiep Chu, Joxan Jaffar, Minh-Thai Trinh:
Automatic induction proofs of data-structures in imperative programs. PLDI 2015: 457-466 - [i4]Duc-Hiep Chu, Joxan Jaffar:
Local Reasoning with First-Class Heaps, and a New Frame Rule. CoRR abs/1511.07267 (2015) - 2014
- [c62]Minh-Thai Trinh, Duc-Hiep Chu, Joxan Jaffar:
S3: A Symbolic String Solver for Vulnerability Detection in Web Applications. CCS 2014: 1232-1243 - [c61]Duc-Hiep Chu, Joxan Jaffar:
A Framework to Synergize Partial Order Reduction with State Interpolation. Haifa Verification Conference 2014: 171-187 - [c60]Duc-Hiep Chu, Joxan Jaffar, Vijayaraghavan Murali:
Lazy Symbolic Execution for Enhanced Learning. RV 2014: 323-339 - [c59]Joxan Jaffar, Vijayaraghavan Murali:
A path-sensitively sliced control flow graph. SIGSOFT FSE 2014: 133-143 - [i3]Duc-Hiep Chu, Joxan Jaffar, Minh-Thai Trinh:
Automating Proofs of Data-Structure Properties in Imperative Programs. CoRR abs/1407.6124 (2014) - [i2]Duc-Hiep Chu, Joxan Jaffar:
A Framework to Synergize Partial Order Reduction with State Interpolation. CoRR abs/1408.0957 (2014) - 2013
- [c58]Gregory J. Duck, Joxan Jaffar, Nicolas C. H. Koh:
Constraint-Based Program Reasoning with Heaps and Separation. CP 2013: 282-298 - [c57]Duc-Hiep Chu, Joxan Jaffar:
Path-sensitive resource analysis compliant with assertions. EMSOFT 2013: 15:1-15:10 - [c56]Joxan Jaffar, Vijayaraghavan Murali, Jorge A. Navas:
Boosting concolic testing via interpolation. ESEC/SIGSOFT FSE 2013: 48-58 - 2012
- [c55]Duc-Hiep Chu, Joxan Jaffar:
A Complete Method for Symmetry Reduction in Safety Verification. CAV 2012: 616-633 - [c54]Joxan Jaffar, Vijayaraghavan Murali, Jorge A. Navas, Andrew E. Santosa:
TRACER: A Symbolic Execution Tool for Verification. CAV 2012: 758-766 - [c53]Joxan Jaffar, Vijayaraghavan Murali, Jorge A. Navas, Andrew E. Santosa:
Path-Sensitive Backward Slicing. SAS 2012: 231-247 - 2011
- [c52]Duc-Hiep Chu, Joxan Jaffar:
Symbolic simulation on complicated loops for WCET path analysis. EMSOFT 2011: 319-328 - [c51]Joxan Jaffar, Jorge A. Navas, Andrew E. Santosa:
Unbounded Symbolic Execution for Program Verification. RV 2011: 396-411 - [i1]Joxan Jaffar, Jorge A. Navas, Andrew E. Santosa:
Symbolic Execution for Verification. CoRR abs/1103.2027 (2011) - 2010
- [c50]Joxan Jaffar, Jorge A. Navas, Andrew E. Santosa:
Abstraction Learning. ATVA 2010: 17
2000 – 2009
- 2009
- [c49]Joxan Jaffar, Andrew E. Santosa, Razvan Voicu:
An Interpolation Method for CLP Traversal. CP 2009: 454-469 - [c48]Joxan Jaffar, Andrew E. Santosa:
Recursive Abstractions for Parameterized Systems. FM 2009: 72-88 - 2008
- [c47]Joxan Jaffar, Andrew E. Santosa, Razvan Voicu:
Efficient Memoization for Dynamic Programming with Ad-Hoc Constraints. AAAI 2008: 297-303 - [c46]Joxan Jaffar:
Constraint Logic Programming for program analysis. ACSC 2008: 3 - [c45]Joxan Jaffar, Andrew E. Santosa, Razvan Voicu:
A Coinduction Rule for Entailment of Recursively Defined Properties. CP 2008: 493-508 - 2007
- [c44]Joxan Jaffar, Roland H. C. Yap, Kenny Qili Zhu:
Generalized Committed Choice. COORDINATION 2007: 191-210 - 2006
- [c43]Joxan Jaffar, Roland H. C. Yap, Kenny Qili Zhu:
Indexing for Dynamic Abstract Regions. ICDE 2006: 12 - [c42]Hui Wu, Joxan Jaffar, Jingling Xue:
Instruction Scheduling with Release Times and Deadlines on ILP Processors. RTCSA 2006: 51-60 - [c41]Joxan Jaffar, Andrew E. Santosa, Razvan Voicu:
A CLP Method for Compositional and Intermittent Predicate Abstraction. VMCAI 2006: 17-32 - [c40]Joxan Jaffar, Andrew E. Santosa, Razvan Voicu:
Relative Safety. VMCAI 2006: 282-297 - 2005
- [c39]Joxan Jaffar, Roland H. C. Yap, Kenny Qili Zhu:
Coordination of Many Agents. ICLP 2005: 98-112 - [c38]Joxan Jaffar, Andrew E. Santosa, Razvan Voicu:
Modeling Systems in CLP. ICLP 2005: 412-413 - 2004
- [c37]Joxan Jaffar:
A CLP Approach to Modelling Systems. APLAS 2004: 1 - [c36]Joxan Jaffar:
A CLP Approach to Modelling Systems. ICFEM 2004: 14 - [c35]Joxan Jaffar, Andrew E. Santosa, Roland H. C. Yap, Kenny Qili Zhu:
Scalable Distributed Depth-First Search with Greedy Work Stealing. ICTAI 2004: 98-103 - [c34]Joxan Jaffar, Andrew E. Santosa, Razvan Voicu:
A CLP Proof Method for Timed Automata. RTSS 2004: 175-186 - 2002
- [j18]Joxan Jaffar, Michael J. Maher:
Guest Editorial. Constraints An Int. J. 7(3-4): 227-228 (2002) - [j17]Hui Wu, Wei-Ngan Chin, Joxan Jaffar:
An Efficient Distributed Deadlock Avoidance Algorithm for the AND Model. IEEE Trans. Software Eng. 28(1): 18-29 (2002) - [c33]Hui Wu, Joxan Jaffar:
Two processor scheduling with real release times and deadlines. SPAA 2002: 127-132 - 2001
- [c32]Hui Wu, Joxan Jaffar:
An Efficient Algorithm for Scheduling Instructions with Deadline Constraints on ILP Processors. RTSS 2001: 235-242 - 2000
- [c31]Hui Wu, Joxan Jaffar, Roland H. C. Yap:
A Fast Algorithm for Scheduling Instructions with Deadline Constraints on RISC Processors. IEEE PACT 2000: 281-290 - [c30]Nevin Heintze, Joxan Jaffar, Razvan Voicu:
Conditional Analysis and Verification. APLAS 2000: 33-49 - [c29]Hui Wu, Joxan Jaffar:
An Efficient Algorithm for Scheduling Instructions with Deadline Constraints on ILP Machines. APLAS 2000: 167-178 - [c28]Hui Wu, Joxan Jaffar, Roland H. C. Yap:
Instruction Scheduling with Timing Constraints on a Single RISC Processor with 0/1 Latencies. CP 2000: 457-469 - [c27]Nevin Heintze, Joxan Jaffar, Razvan Voicu:
A Framework for Combining Analysis and Verification. POPL 2000: 26-39
1990 – 1999
- 1999
- [c26]Yuanlin Zhang, Roland H. C. Yap, Joxan Jaffar:
Functional Elimination and 0/1/All Constraints. AAAI/IAAI 1999: 175-180 - [c25]Joxan Jaffar, Michael J. Maher, Gustaf Neumann:
An Architecture and Prototype Implementation of a System for Individualized Workflows in Medical Information Systems. HICSS 1999 - [e3]Joxan Jaffar:
Principles and Practice of Constraint Programming - CP'99, 5th International Conference, Alexandria, Virginia, USA, October 11-14, 1999, Proceedings. Lecture Notes in Computer Science 1713, Springer 1999, ISBN 3-540-66626-5 [contents] - 1998
- [j16]Joxan Jaffar, Michael J. Maher, Kim Marriott, Peter J. Stuckey:
The Semantics of Constraint Logic Programs. J. Log. Program. 37(1-3): 1-46 (1998) - [c24]Joxan Jaffar, Roland H. C. Yap:
Open Constraint Programming. CP 1998: 1 - [e2]Joxan Jaffar:
Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, Manchester, UK, June 15-19, 1998. MIT Press 1998, ISBN 0-262-60031-5 [contents] - 1997
- [j15]Joxan Jaffar, Roland H. C. Yap:
Constraint Programming 2000: A Position Paper. Constraints An Int. J. 2(1): 71-73 (1997) - [j14]Alexander Brodsky, Joxan Jaffar, Michael J. Maher:
Toward Practical Query Evaluation for Constraint Databases. Constraints An Int. J. 2(3/4): 279-304 (1997) - [c23]Joxan Jaffar, Bing Liu, Roland H. C. Yap:
Forward and Backward Chaining in Constraint Programming (Abstract). LPNMR 1997: 1 - 1996
- [j13]Joxan Jaffar, Roland H. C. Yap:
Constraint Programming 2000. ACM Comput. Surv. 28(4es): 65 (1996) - [c22]Bing Liu, Joxan Jaffar:
Using Constraints to Model Disjunctions in Rule-Based Reasoning. AAAI/IAAI, Vol. 2 1996: 1248-1255 - [e1]Joxan Jaffar, Roland H. C. Yap:
Concurrency and Parallelism, Programming, Networking, and Security: Second Asian Computing Science Conference, ASIAN '96, Singapore, December 2-5, 1996, Proceedings. Lecture Notes in Computer Science 1179, Springer 1996, ISBN 3-540-62031-1 [contents] - 1995
- [c21]Nevin Heintze, Joxan Jaffar:
A Generic Algorithm for CLP Analysis. ICLP 1995: 49-63 - [c20]Joxan Jaffar, Michael J. Maher, Gustaf Neumann:
Logic Programming and Object Modelling: A Case Study (Abstract). ILPS 1995: 48 - 1994
- [j12]Joxan Jaffar, Michael J. Maher:
Constraint Logic Programming: A Survey. J. Log. Program. 19/20: 503-581 (1994) - [c19]Joxan Jaffar, Michael J. Maher, Peter J. Stuckey, Roland H. C. Yap:
Beyond Finite Domains. PPCP 1994: 86-94 - [c18]Nevin Heintze, Joxan Jaffar:
Set Constraints and Set-Based Analysis. PPCP 1994: 281-298 - 1993
- [j11]Joxan Jaffar, Michael J. Maher, Peter J. Stuckey, Roland H. C. Yap:
Projecting CLP (R) Constraints. New Gener. Comput. 11(3): 449-469 (1993) - [c17]Alexander Brodsky, Joxan Jaffar, Michael J. Maher:
Toward Practical Constraint Databases. VLDB 1993: 567-580 - 1992
- [j10]Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, Roland H. C. Yap:
The CLP(R) Language and System. ACM Trans. Program. Lang. Syst. 14(3): 339-395 (1992) - [c16]Joxan Jaffar, Michael J. Maher, Peter J. Stuckey, Roland H. C. Yap:
Output in CLP. FGCS 1992: 987-995 - [c15]Nevin Heintze, Joxan Jaffar:
An Engine for Logic Program Analysis. LICS 1992: 318-328 - [c14]Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, Roland H. C. Yap:
An Abstract Machine for CLP(R). PLDI 1992: 128-139 - [p2]Nevin Heintze, Joxan Jaffar:
Semantic Types for Logic Programs. Types in Logic Programming 1992: 141-155 - 1991
- [c13]Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, Roland H. C. Yap:
The CLP(R) language and system: an overview. Compcon 1991: 376-381 - [c12]Joxan Jaffar, Spiro Michaylov, Roland H. C. Yap:
A Methodology for Managing Hard Constraints in CLP Systems. PLDI 1991: 306-316 - 1990
- [j9]Joxan Jaffar:
Minimal and Complete Word Unification. J. ACM 37(1): 47-85 (1990) - [c11]Nevin Heintze, Joxan Jaffar:
A Decision Procedure for a Class of Set Constraints (Extended Abstract). LICS 1990: 42-51 - [c10]Nevin Heintze, Joxan Jaffar:
A Finite Presentation Theorem for Approximating Logic Programs. POPL 1990: 197-209
1980 – 1989
- 1987
- [j8]James Harland, Joxan Jaffar:
On Parallel Unification for Prolog. New Gener. Comput. 5(3): 259-279 (1987) - [c9]Joxan Jaffar, Spiro Michaylov:
Methodology and Implementation of a CLP System. ICLP 1987: 196-218 - [c8]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
PROLOG - II as an instance of the logic programming language scheme. Formal Description of Programming Concepts 1987: 275-298 - [c7]Joxan Jaffar, Jean-Louis Lassez:
From Unification to Constraints. LP 1987: 1-18 - [c6]Joxan Jaffar, Jean-Louis Lassez:
Constraint Logic Programming. POPL 1987: 111-119 - 1986
- [j7]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
Comments on "General Failure of Logic Programs". J. Log. Program. 3(2): 115-118 (1986) - [j6]Joxan Jaffar, Peter J. Stuckey:
Canonical Logic Programs. J. Log. Program. 3(2): 143-155 (1986) - [j5]Joxan Jaffar, Peter J. Stuckey:
Semantics of Infinite Tree Logic Programming. Theor. Comput. Sci. 46(3): 141-158 (1986) - [c5]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
Invited Talk: Some Issues and Trends in the Semantics of Logic Programming. ICLP 1986: 223-241 - [c4]Joxan Jaffar, Peter J. Stuckey:
Logic Program Semantics for Programming with Equations. ICLP 1986: 313-326 - [p1]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
Logic Programming Language Scheme. Logic Programming: Functions, Relations, and Equations 1986: 441-467 - 1984
- [j4]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
A Theory of Complete Logic Programs with Equality. J. Log. Program. 1(3): 211-223 (1984) - [j3]Joxan Jaffar:
Efficient Unification over Infinite Terms. New Gener. Comput. 2(3): 207-219 (1984) - [c3]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
A Theory of Complete Logic Programs with Equality. FGCS 1984: 175-184 - 1983
- [j2]Prabhaker Mateti, Joxan Jaffar:
A Correctness Proof of an Indenting Program. Softw. Pract. Exp. 13(3): 199-226 (1983) - [c2]Joxan Jaffar, Jean-Louis Lassez, John W. Lloyd:
Completeness of the Negation as Failure Rule. IJCAI 1983: 500-506 - 1982
- [c1]Joxan Jaffar, Jean-Louis Lassez:
Reasoning about Array Segments. ECAI 1982: 62-66 - 1981
- [j1]Joxan Jaffar:
Presburger Arithmetic With Array Segments. Inf. Process. Lett. 12(2): 79-82 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
