361 search results - page 61 / 73 » Analytic Methods for the Logic of Proofs |
TPHOL
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
CONCUR
2000
Springer
14 years 1 days 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...
AIPS
1996
13 years 9 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...
APAL
2008
13 years 8 months ago
2008
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
ENTCS
2008
13 years 8 months ago
2008
RZ is a tool which translates axiomatizations of mathematical structures to program specifications using the realizability interpretation of logic. This helps programmers correctl...