3658 search results - page 547 / 732 » The logic of proofs, semantically |
162
click to vote
AGP
1998
IEEE
15 years 10 months ago
1998
IEEE
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
179
click to vote
CONCUR
2000
Springer
15 years 10 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
177
click to vote
AMAST
2008
Springer
15 years 8 months ago
2008
Springer
The Hoare approach to program verification relies on the construction and discharge of verification conditions (VCs) but offers no support to trace, analyze, and understand the VCs...
166
click to vote
FM
2008
Springer
15 years 8 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
137
click to vote
AIPS
1996
15 years 7 months ago
1996
Weintroduce a method of deduction-based refinement planning where prefabricated general solutions are adapted to special problems. Refmementproceeds by stepwise transforming nonco...