518 search results - page 42 / 104 » Automating Proofs in Category Theory |
106
click to vote
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
CSL
2004
Springer
15 years 5 months ago
2004
Springer
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
204
click to vote
POPL
2008
ACM
16 years 5 days ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
GLVLSI
2007
IEEE
15 years 6 months ago
2007
IEEE
Threshold logic is gaining prominence as an alternative to Boolean logic. The main reason for this trend is the availability of devices that implement these circuits efficiently (...
115
click to vote
JACM
2002
14 years 11 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...