Sciweavers

32 search results - page 7 / 7
» Automated Assume-Guarantee Reasoning by Abstraction Refineme...
Sort
View
CADE
2007
Springer
14 years 5 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
POPL
2010
ACM
14 years 2 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies