Sciweavers

1076 search results - page 15 / 216
» Operations on proofs and labels
Sort
View
LICS
2010
IEEE
13 years 6 months ago
Weak Equivalences in Psi-Calculi
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
Magnus Johansson, Jesper Bengtson, Joachim Parrow,...
WCE
2007
13 years 8 months ago
A Comparison of Mann and Ishikawa iterations of quasi-contraction operators
—It is generally conjectured that the Mann iteration converges faster than the Ishikawa iteration for any operator defined on an arbitrary closed convex subset of a Banach space...
Johnson O. Olaleru
CHARME
2003
Springer
100views Hardware» more  CHARME 2003»
14 years 22 days ago
Inductive Assertions and Operational Semantics
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
J. Strother Moore
IANDC
2006
121views more  IANDC 2006»
13 years 7 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
TYPES
2007
Springer
14 years 1 months ago
A Declarative Language for the Coq Proof Assistant
This paper presents a new proof language for the Coq proof assistant. This language uses the declarative style. It aims at providing a simple, natural and robust alternative to the...
Pierre Corbineau