29 research outputs found
Proving termination of programs automatically with AProVE
AProVE is a system for automatic termination and complexity proofs of Java, C, Haskell, Prolog, and term rewrite systems (TRSs). To analyze programs in high-level languages, AProVE automatically converts them to TRSs. Then, a wide range of techniques is employed to prove termination and to infer complexity bounds for the resulting TRSs. The generated proofs can be exported to check their correctness using automatic certifiers. For use in software construction, we present an AProVE plug-in for the popular Eclipse software development environment
From SICs and MUBs to Eddington
This is a survey of some very old knowledge about Mutually Unbiased Bases
(MUB) and Symmetric Informationally Complete POVMs (SIC). In prime dimensions
the former are closely tied to an elliptic normal curve symmetric under the
Heisenberg group, while the latter are believed to be orbits under the
Heisenberg group in all dimensions. In dimensions 3 and 4 the SICs are
understandable in terms of elliptic curves, but a general statement escapes us.
The geometry of the SICs in 3 and 4 dimensions is discussed in some detail.Comment: 12 pages; from the Festschrift for Tony Sudber