Sciweavers

288 search results - page 19 / 58
» Interactive Termination Proofs Using Termination Cores
Sort
View
WSC
2008
15 years 8 months ago
Vesicle-synapsin interactions modeled with Cell-DEVS
Interactions between synaptic vesicles and synapsin in a presynaptic nerve terminal were modeled using the CellDEVS formalism. Vesicles and synapsins move randomly within the pres...
Rhys Goldstein, Gabriel A. Wainer, James J. Cheeth...
KBSE
1999
IEEE
15 years 10 months ago
An ML Editor Based on Proofs-As-Programs
CYNTHIA is a novel editor for the functional programming language ML in which each function definition is represented as the proof of a simple specification. Users of CYNTHIA edit...
Jon Whittle, Alan Bundy, Richard J. Boulton, Helen...
FC
2005
Springer
80views Cryptology» more  FC 2005»
15 years 11 months ago
A User-Friendly Approach to Human Authentication of Messages
Abstract. Users are often forced to trust potentially malicious terminals when trying to interact with a remote secure system. This paper presents an approach for ensuring the inte...
Jeff King, André L. M. dos Santos
WOLLIC
2009
Springer
16 years 18 days ago
Deep Inference in Bi-intuitionistic Logic
Bi-intuitionistic logic is the extension of intuitionistic logic with exclusion, a connective dual to implication. Cut-elimination in biintuitionistic logic is complicated due to t...
Linda Postniece
ENTCS
2002
66views more  ENTCS 2002»
15 years 5 months ago
Strongly Normalising Cut-Elimination with Strict Intersection Types
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
Steffen van Bakel