Sciweavers

171 search results - page 5 / 35
» CoSP: a general framework for computational soundness proofs
Sort
View
SAS
2007
Springer
140views Formal Methods» more  SAS 2007»
15 years 5 months ago
Formalised Inductive Reasoning in the Logic of Bunched Implications
We present a framework for inductive definitions in the logic of bunched implications, BI, and formulate two sequent calculus proof systems for inductive reasoning in this framewo...
James Brotherston
110
Voted
FSTTCS
2005
Springer
15 years 5 months ago
Quantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
Ugo Dal Lago, Martin Hofmann
JIIS
2008
104views more  JIIS 2008»
14 years 11 months ago
A framework for checking proofs naturally
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
Masahiko Sato
ESORICS
2007
Springer
15 years 5 months ago
Adaptive Soundness of Static Equivalence
Abstract. We define a framework to reason about implementations of equational theories in the presence of an adaptive adversary. We particularly focus on soundess of static equiva...
Steve Kremer, Laurent Mazaré
PRESENCE
1998
112views more  PRESENCE 1998»
14 years 11 months ago
The Sounds of Physical Shapes
We propose a general framework for the simulation of sounds produced by colliding physical objects in a virtual reality environment. The framework is based on the vibration dynami...
Kees van den Doel, Dinesh K. Pai