1894 search results - page 109 / 379 » A TLA Proof System |
124
Voted
MFCS
2010
Springer
15 years 2 months ago
2010
Springer
We provide a strong normalization result for MLF , a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calc...
111
Voted
AUTOMATICA
2007
15 years 3 months ago
2007
We discuss notions of detectability for stochastic linear control systems of Itˆo type. A natural concept of detectability requires a non-zero output, if the state process is uns...
119
click to vote
FUIN
2010
15 years 2 months ago
2010
In this paper we will provide a detailed proof of the solvability of the halting and reachability problem for binary 2-tag systems. We will furthermore prove that an important sub...
159
Voted
ESSLLI
2009
Springer
15 years 1 months ago
2009
Springer
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...
109
Voted
SP
2008
IEEE
15 years 10 months ago
2008
IEEE
Civitas is the first electronic voting system that is coercion-resistant, universally and voter verifiable, and suitable for remote voting. This paper describes the design and i...