Sciweavers

5550 search results - page 15 / 1110
» Different Approaches to Proof Systems
Sort
View
INFOCOM
2003
IEEE
15 years 3 months ago
Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks
— Mobile ad hoc networking has been an active research area for several years. How to stimulate cooperation among selfish mobile nodes, however, is not well addressed yet. In th...
Sheng Zhong, Jiang Chen, Yang Richard Yang
POPL
2006
ACM
15 years 10 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
AICOM
2010
127views more  AICOM 2010»
14 years 10 months ago
Interactive verification of concurrent systems using symbolic execution
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
Simon Bäumler, Michael Balser, Florian Nafz, ...
TYPES
1995
Springer
15 years 1 months ago
A Natural Deduction Approach to Dynamic Logic
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
Furio Honsell, Marino Miculan
ENTCS
2008
96views more  ENTCS 2008»
14 years 10 months ago
Maude as a Platform for Designing and Implementing Deep Inference Systems
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
Ozan Kahramanogullari