608 search results - page 19 / 122 » Tests, Proofs and Refinements |
JLP
2008
13 years 7 months ago
2008
Abstract. Retrenchment is a flexible model evolution formalism that arose as a reaction to the limitations imposed by refinement, and for which the proof obligations feature additi...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
State-of-the-art automated theorem provers (ATPs) are today able to solve relatively complicated mathematical problems. But as ATPs become stronger and more used by mathematicians...
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
The universal Horn theory of relational Kleene algebra with tests (RKAT) is of practical interest, particularly for program semantics. We develop an (infinitary) proof system, ba...
COCO
2003
Springer
14 years 28 days ago
2003
Springer
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...
ICSE
2000
IEEE-ACM
13 years 11 months ago
2000
IEEE-ACM
This paper presents a technique for incrementally constructing safety specifications, abstract algorithm descriptions, and simulation proofs showing that algorithms meet their spe...