HSF

swMATH9937MaRDI QIDQ21916FDOQ21916

Author name not available (Why is that?)

Cited In (10)

• Minimal-model-guided approaches to solving polynomial constraints and extensions
• Verifying Array Programs by Transforming Verification Conditions
• Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
• Incremental and modular context-sensitive analysis
• Specialization with constrained generalization for software model checking
• Tools and algorithms for the construction and analysis of systems. 18th international conference, TACAS 2012, held as part of the European joint conferences on theory and practice of software, ETAPS 2012, Tallinn, Estonia, March 24 -- April 1, 2012. Proceedings
• Solving non-linear Horn clauses using a linear Horn clause solver
• Efficient CTL verification via Horn constraints solving
• A constraint-based approach to solving games on infinite graphs
• Horn clause verification with convex polyhedral abstraction and tree automata-based refinement

This page was built for software: HSF