837 search results - page 11 / 168 » Proof Development with OMEGA |
126
click to vote
RTA
2004
Springer
15 years 9 months ago
2004
Springer
Over the past decade, researchers have found context-sensitive term-rewriting semantics to be powerful and expressive tools for modeling programming languages, particularly in esta...
138
click to vote
ISOLA
2007
Springer
15 years 10 months ago
2007
Springer
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
166
click to vote
TYPES
1993
Springer
15 years 8 months ago
1993
Springer
Abstract. A data link protocol developed and used by Philips Electronics is modeled and veri ed using I/O automata theory. Correctness is computer-checked with the Coq proof develo...
127
Voted
CSL
1999
Springer
15 years 3 months ago
1999
Springer
We explain why the original proofs of P-Time completeness for Light Affine Logic and Light Linear Logic can not work, and we fully develop a working one.
127
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
We develop a formalization of the Size-Change Principle in Isabelle/HOL and use it to construct formally certified termination proofs for recursive functions automatically.