3658 search results - page 355 / 732 » The logic of proofs, semantically |
211
click to vote
TPHOL
2005
IEEE
16 years 14 days ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
169
click to vote
ATAL
2005
Springer
16 years 13 days ago
2005
Springer
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
210
click to vote
ENTCS
2007
15 years 6 months ago
2007
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
218
click to vote
HASKELL
2005
ACM
16 years 14 days ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
201
click to vote
ENTCS
2008
15 years 7 months ago
2008
Current object-oriented approaches to distributed programs may be criticized in several respects. First, method calls are generally synchronous, which leads to much waiting in dis...