Zobrazeno 1 - 10
of 439
pro vyhledávání: '"Yap, P. H."'
Software security continues to be a critical concern for programs implemented in low-level programming languages such as C and C++. Many defenses have been proposed in the current literature, each with different trade-offs including performance, comp
Externí odkaz:
http://arxiv.org/abs/2405.12513
Model counting is a fundamental problem which has been influential in many applications, from artificial intelligence to formal verification. Due to the intrinsic hardness of model counting, approximate techniques have been developed to solve real-wo
Externí odkaz:
http://arxiv.org/abs/2212.09390
Autor:
Yang, Kaiyuan, Huang, Houjing, Vandans, Olafs, Murali, Adithya, Tian, Fujia, Yap, Roland H. C., Dai, Liang
A central problem in computational biophysics is protein structure prediction, i.e., finding the optimal folding of a given amino acid sequence. This problem has been studied in a classical abstract model, the HP model, where the protein is modeled a
Externí odkaz:
http://arxiv.org/abs/2211.14939
Knowledge compilation concerns with the compilation of representation languages to target languages supporting a wide range of tractable operations arising from diverse areas of computer science. Tractable target compilation languages are usually ach
Externí odkaz:
http://arxiv.org/abs/2202.10025
Autor:
Verma, Sahil, Yap, Roland H. C.
Publikováno v:
ICTAI 2019
Symbolic execution is a powerful technique for bug finding and program testing. It is successful in finding bugs in real-world code. The core reasoning techniques use constraint solving, path exploration, and search, which are also the same technique
Externí odkaz:
http://arxiv.org/abs/2001.07914
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Xia, Wei, Yap, Roland H. C.
Effective solving of constraint problems often requires choosing good or specific search heuristics. However, choosing or designing a good search heuristic is non-trivial and is often a manual process. In this paper, rather than manually choosing/des
Externí odkaz:
http://arxiv.org/abs/1805.03876
Effective general-purpose search strategies are an important component in Constraint Programming. We introduce a new idea, namely, using correlations between variables to guide search. Variable correlations are measured and maintained by using domain
Externí odkaz:
http://arxiv.org/abs/1805.02205
Malformed data-structures can lead to runtime errors such as arbitrary memory access or corruption. Despite this, reasoning over data-structure properties for low-level heap manipulating programs remains challenging. In this paper we present a constr
Externí odkaz:
http://arxiv.org/abs/1804.09352
Autor:
Duck, Gregory J., Yap, Roland H. C.
The primary function of memory allocators is to allocate and deallocate chunks of memory primarily through the malloc API. Many memory allocators also implement other API extensions, such as deriving the size of an allocated object from the object's
Externí odkaz:
http://arxiv.org/abs/1804.04812