A new polynomial-time algorithm for linear programming
Combinatorica
The complexity of facets resolved
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bebop: A Symbolic Model Checker for Boolean Programs
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
APAQS '00 Proceedings of the The First Asia-Pacific Conference on Quality Software (APAQS'00)
The complexity of facets (and some facets of complexity)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Conflict Analysis in Search Algorithms for Satisfiability
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
A Path-Based Approach to the Detection of Infinite Looping
APAQS '01 Proceedings of the Second Asia-Pacific Conference on Quality Software
Effective redundant constraints for online scheduling
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Scalable analysis of linear systems using mathematical programming
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Synchronizing AMS Assertions with AMS Simulation: From Theory to Practice
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.00 |
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among these constraints first. This paper studies the problem of finding Boolean relations among a set of linear numerical constraints. The relations can be represented by rules. It is believed that we can not generate all the rules in polynomial-time. A search based algorithm with some heuristics to speed up the search process is proposed. All the techniques are implemented in a tool called MALL which can generate the rules automatically. Experimental results with various examples show that our method can generate enough rules in acceptable time. Our method can also handle other types of constraints if proper numeric solvers are available.