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...
In this paper, we propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequence-indexed linear-time temp...
Theoremsin automated theorem proving are usually proved by logical formal proofs. However,there is a subset of problems which humanscan prove in a different wayby the use of geome...
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
Nels E. Beckman, Aditya V. Nori, Sriram K. Rajaman...
We consider the problem of determining the maximum number of moves required to sort a permutation of [n] using cut-and-paste operations, in which a segment is cut out and then pas...
Daniel W. Cranston, Ivan Hal Sudborough, Douglas B...