A practical technique for bounding the time between events in concurrent real-time systems
ISSTA '93 Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis
An empirical evaluation of three methods for deadlock analysis of Ada tasking programs
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Automated Derivation of Time Bounds in Uniprocessor Concurrent Systems
IEEE Transactions on Software Engineering
Towards scalable compositional analysis
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
Using integer programming to verify general safety and liveness properties
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Evaluating Deadlock Detection Methods for Concurrent Software
IEEE Transactions on Software Engineering
Comparing Finite-State Verification Techniques for Concurrent Software
Comparing Finite-State Verification Techniques for Concurrent Software
| Hi-index | 0.00 |
The Inequality Necessary Condition Analyzer (INCA) is a finite-state verification tool that has been able to check properties of some very large concurrent systems. INCA checks a property of a concurrent system by generating a system of inequalities that must have integer solutions if the property can be violated. There may, however, be integer solutions to the inequalities that do not correspond to an execution violating the property. INCA thus accepts the possibility of an inconclusive result in exchange for greater tractability. We describe here a method for eliminating one of the two main sources of these inconclusive results.