1894 search results - page 156 / 379 » A TLA Proof System |
124
Voted
ICFEM
2009
Springer
15 years 10 months ago
2009
Springer
It is believed that reusability in formal development should reduce the time and cost of formal modelling within a production environment. Along with the ability to reuse formal mo...
135
Voted
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
118
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
136
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: ...
134
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...