888 search results - page 2 / 178 » The Power of Temporal Proofs |
69
Voted
CADE
2002
Springer
15 years 10 months ago
2002
Springer
BIRTHDAY
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
LISA
2007
14 years 12 months ago
2007
Network patterns are based on generic algorithms that execute on tree-based overlays. A set of such patterns has been developed at KTH to support distributed monitoring in network...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin exte...
CADE
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...