1894 search results - page 89 / 379 » A TLA Proof System |
114
click to vote
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
We describe Dynamic UNITY, a new formalism for the specification of dynamic distributed systems based on the UNITY formalism. This formalism allows for the specification and pro...
114
Voted
CADE
2007
Springer
16 years 1 months ago
2007
Springer
We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deduc...
102
click to vote
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
We provide in this article two characterisation results, describing exactly which terms verify the dinaturality diagram, in Church-style system F and in Curry-style system F. The ...
93
Voted
APAL
1999
15 years 13 days ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
103
Voted
CADE
1999
Springer
15 years 5 months ago
1999
Springer
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...