Roland H. C. Yap

Roland H. C. Yap

Auto-generated profile, based on publicly available information

Roland H. C. Yap

National University of Singapore, Singapore, Singapore

Research Focus & Metrics

Academic Career Length

40Years (1987-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 1992 in ACM Transactions on Programming Languages and Systems
Verified
Journal Article
Open access
PDF file
JJJoxan Jaffar
Joxan Jaffar
SMSpiro Michaylov
Spiro Michaylov
PSPeter J. Stuckey
Peter J. Stuckey
RYRoland H. C. Yap
Roland H. C. Yap
The CLP( ℛ ) programming language is defined, its underlying philosophy and programming methodology are discussed, important implementation issues are explored in detail, and finally, a prototype interpreter is described. CLP( ℛ ) is designed to be an instance of the Constraint Logic Programming Scheme, a family of rule-based constraint programming languages defined by Jaffar and Lassez. The domain of computation ℛ of this particular instance is the algebraic structure consisting of uninterpreted functors over real numbers. An important property of CLP( ℛ )is that the constraints are treated uniformly in the sense that they are used to specify the input parameters to a program, they are the only primitives used in the execution of a program, and they are used to describe the output of a program. Implementation of a CLP language, and of CLP( ℛ ) in particular, raises new problems in the design of a constraint-solver. For example, the constraint solver must be incremental in the sense that solving additional constraints must not entail the resolving of old constraints. In our system, constraints are filtered through an inference engine, an engine/solver interface, an equation solver and an inequality solver. This sequence of modules reflects a classification and prioritization of the classes of constraints. Modules solving higher priority constraints are isolated from the complexities of modules solving lower priority constraints. This multiple-phase solving of constraints, together with a set of associated algorithms, gives rise to a practical system.

1 July 2005 in Artificial Intelligence
Verified
Journal Article
Closed access
CBChristian Bessière
Christian Bessière
JRJean-Charles Régin
Jean-Charles Régin
RYRoland H.C. Yap
Roland H.C. Yap
YZYuanlin Zhang
Yuanlin Zhang

17 March 2016
Verified
Conference Paper
Open access
GDGregory J. Duck
Gregory J. Duck
RYRoland H. C. Yap
Roland H. C. Yap
Heap buffer overflow (underflow) errors are a common source of security vulnerabilities. One prevention mechanism is to add object bounds meta information and to instrument the program with explicit bounds checks for all memory access. The so-called \"fat pointers\" approach is one method for maintaining and propagating the meta information where native machine pointers are replaced with \"fat\" objects that explicitly store object bounds. Another approach is \"low fat pointers\", which encodes meta information within a native pointer itself, eliminating space overheads and also code compatibility issues. This paper presents a new low-fat pointer encoding that is fully compatible with existing libraries (e.g. pre-compiled libraries unaware of the encoding) and standard hardware (e.g. x86_64). We show that our approach has very low memory overhead, and competitive with existing state-of-the-art bounds instrumentation solutions.


1 September 1987 in IEEE Expert
Verified
Journal Article
Closed access
CLCatherine Lassez
Catherine Lassez
KMKen McAloon
Ken McAloon
RYRoland Yap
Roland Yap

1 January 2008
Verified
Book Chapter
Closed access
PDF file
KCKenil C. K. Cheng
Kenil C. K. Cheng
RYRoland H. C. Yap
Roland H. C. Yap