1894 search results - page 91 / 379 » A TLA Proof System |
106
click to vote
TLCA
2007
Springer
15 years 6 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
114
Voted
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
102
click to vote
FASE
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Coalgebra has in recent years been recognized as the framework of choice for the treatment of reactive systems at an appropriate level of generality. Proofs about the rea...
111
Voted
CAV
2001
Springer
15 years 5 months ago
2001
Springer
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
131
Voted
CADE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Heterogeneous specification becomes more and more important because complex systems are often specified using multiple viewpoints, involving multiple formalisms. Moreover...