A SURVEY ON ALGORITHMS FOR SOLVING LINEAR INTEGER TYPE CONSTRAINTS

Bibliographic Details
Main Author:	NAYAK, VARUN R.
Language:	English
Published:	University of Cincinnati / OhioLINK 2002
Subjects:	Computer Science constraint solving simplex integer programming linear programming Xanadu
Online Access:	http://rave.ohiolink.edu/etdc/view?acc_num=ucin1022176838

id	ndltd-OhioLink-oai-etd.ohiolink.edu-ucin1022176838
record_format	oai_dc
spelling	ndltd-OhioLink-oai-etd.ohiolink.edu-ucin10221768382021-08-03T06:08:34Z A SURVEY ON ALGORITHMS FOR SOLVING LINEAR INTEGER TYPE CONSTRAINTS NAYAK, VARUN R. Computer Science constraint solving simplex integer programming linear programming Xanadu We study the problem of solving linear integer constraints generated from type- checking in a dependently typed setting. Xanadu is such a dependently typed imper- ative programming language. The primary motivation for developing such a depen- dently typed imperative programming language was to study the use of dependent types in practical imperative programming at both source level and assembly level. We focus our study on the problem of proving the feasibility of linear integer type constraints that are generated during type-checking of Xanadu. We have employed linear programming techniques to prove the satisfiability of these constraints. This is an integer programming problem which in itself is an NP hard problem. We have studied a two phase approach to prove the satisfiability of the generated linear integer type contraints. The first phase involves searching for a rational solution to the given constraint set. If no such solution exists then there cannot be an integer solution to the given constraint set. The second phase involves looking for an integer solution if there exists a real solution. A lot of real time linear integer type constraints were tested and studied. The results of this study are presented here. We are also convinced that the solving of these type constraints may aid in eliminating dead code, another very important application of constraint solving. 2002-06-11 English text University of Cincinnati / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=ucin1022176838 http://rave.ohiolink.edu/etdc/view?acc_num=ucin1022176838 unrestricted This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws.
collection	NDLTD
language	English
sources	NDLTD
topic	Computer Science constraint solving simplex integer programming linear programming Xanadu
spellingShingle	Computer Science constraint solving simplex integer programming linear programming Xanadu NAYAK, VARUN R. A SURVEY ON ALGORITHMS FOR SOLVING LINEAR INTEGER TYPE CONSTRAINTS
author	NAYAK, VARUN R.
author_facet	NAYAK, VARUN R.
author_sort	NAYAK, VARUN R.
title	A SURVEY ON ALGORITHMS FOR SOLVING LINEAR INTEGER TYPE CONSTRAINTS
title_short	A SURVEY ON ALGORITHMS FOR SOLVING LINEAR INTEGER TYPE CONSTRAINTS
title_full	A SURVEY ON ALGORITHMS FOR SOLVING LINEAR INTEGER TYPE CONSTRAINTS
title_fullStr	A SURVEY ON ALGORITHMS FOR SOLVING LINEAR INTEGER TYPE CONSTRAINTS
title_full_unstemmed	A SURVEY ON ALGORITHMS FOR SOLVING LINEAR INTEGER TYPE CONSTRAINTS
title_sort	survey on algorithms for solving linear integer type constraints
publisher	University of Cincinnati / OhioLINK
publishDate	2002
url	http://rave.ohiolink.edu/etdc/view?acc_num=ucin1022176838
work_keys_str_mv	AT nayakvarunr asurveyonalgorithmsforsolvinglinearintegertypeconstraints AT nayakvarunr surveyonalgorithmsforsolvinglinearintegertypeconstraints
_version_	1719431610679427072

A SURVEY ON ALGORITHMS FOR SOLVING LINEAR INTEGER TYPE CONSTRAINTS

Similar Items