Sciweavers

131 search results - page 11 / 27
» Proof systems that take advice
Sort
View
IFIP
2004
Springer
14 years 3 months ago
Ensuring Termination by Typability
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...
Yuxin Deng, Davide Sangiorgi
FIDJI
2004
Springer
14 years 3 months ago
A JMM-Faithful Non-interference Calculus for Java
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...
Vladimir Klebanov
BIRTHDAY
2006
Springer
14 years 1 months ago
Proving Behavioral Refinements of COL-specifications
The COL institution (constructor-based observational logic) has been introduced as a formal framework to specify both generationand observation-oriented properties of software syst...
Michel Bidoit, Rolf Hennicker
FLOPS
2008
Springer
13 years 11 months ago
Certified Exact Real Arithmetic Using Co-induction in Arbitrary Integer Base
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 ...
Nicolas Julien
WADT
1998
Springer
14 years 2 months ago
Hierarchical Heterogeneous Specifications
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...
Sophie Coudert, Gilles Bernot, Pascale Le Gall