128 search results - page 17 / 26 » Verifying Process Algebra Proofs in Type Theory |
161
click to vote
ICFP
2004
ACM
16 years 3 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
144
Voted
NN
2000
Springer
15 years 3 months ago
2000
Springer
A neural network model that can simulate the learning of some simple proportional analogies is presented. These analogies include, for example, (a) red-square:red-circle yellow-sq...
182
Voted
ICWS
2004
IEEE
15 years 5 months ago
2004
IEEE
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses Semantic Web service language (DAML-S) f...
129
Voted
POPL
2010
ACM
16 years 1 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
167
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...