131 search results - page 11 / 27 » Proof systems that take advice |
164
Voted
IFIP
2004
Springer
15 years 12 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
266
click to vote
FIDJI
2004
Springer
15 years 12 months ago
2004
Springer
We present a calculus for establishing non-interference of several Java threads running in parallel. The proof system is built atop an implemented sequential Java Dynamic Logic cal...
129
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
The COL institution (constructor-based observational logic) has been introduced as a formal framework to specify both generationand observation-oriented properties of software syst...
169
click to vote
FLOPS
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we describe some certified algorithms for exact real arithmetic based on co-recursion. Our work is based on previous experiences using redundant digits of base 2 but ...
134
click to vote
WADT
1998
Springer
15 years 10 months ago
1998
Springer
We propose a definition of hierarchical heterogeneous formal specifications, where each module is specified according to its own homogeneous logic. We focus on the specification st...