837 search results - page 11 / 168 » Proof Development with OMEGA |
90
Voted
RTA
2004
Springer
15 years 5 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...
116
Voted
ISOLA
2007
Springer
15 years 6 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: ...
125
Voted
TYPES
1993
Springer
15 years 4 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...
94
Voted
CSL
1999
Springer
15 years 20 hour 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.
93
Voted
CADE
2007
Springer
16 years 20 days 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.