1894 search results - page 137 / 379 » A TLA Proof System |
115
Voted
JAPLL
2006
15 years 3 months ago
2006
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...
118
Voted
FAC
1998
15 years 3 months ago
1998
In the process-algebraic veri cation of systems with three or more components put in parallel, alphabet axioms are considered to be very useful. These are rules that exploit the i...
167
click to vote
CC
2008
Springer
15 years 3 months ago
2008
Springer
In their seminal paper, Valiant, Skyum, Berkowitz and Rackoff proved that arithmetic circuits can be balanced [VSBR]. That is, [VSBR] showed that for every arithmetic circuit of ...
126
Voted
ICSE
2009
IEEE-ACM
15 years 1 months ago
2009
IEEE-ACM
Most system level software is written in C and executed concurrently. Because such software is often critical for system reliability, it is an ideal target for formal verification...
178
Voted
POPL
2011
ACM
14 years 6 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...