Sciweavers

13383 search results - page 168 / 2677
» Abstractions from proofs
Sort
View
KRDB
2001
110views Database» more  KRDB 2001»
15 years 8 months ago
Path Constraints from a Modal Logic Point of View
We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding...
Natasha Alechina, Stéphane Demri, Maarten d...
LICS
2008
IEEE
16 years 27 days ago
From Axioms to Analytic Rules in Nonclassical Logics
We introduce a systematic procedure to transform large classes of (Hilbert) axioms into equivalent inference rules in sequent and hypersequent calculi. This allows for the automat...
Agata Ciabattoni, Nikolaos Galatos, Kazushige Teru...
NIPS
2004
15 years 8 months ago
A Generalized Bradley-Terry Model: From Group Competition to Individual Skill
The Bradley-Terry model for paired comparison has been popular in many areas. We propose a generalized version in which paired individual comparisons are extended to paired team c...
Tzu-Kuo Huang, Chih-Jen Lin, Ruby C. Weng
IJISEC
2007
61views more  IJISEC 2007»
15 years 6 months ago
Identity-based key agreement protocols from pairings
In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, the security of this ty...
Liqun Chen, Zhaohui Cheng, Nigel P. Smart
ESOP
2005
Springer
16 years 1 days ago
Asserting Bytecode Safety
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
Martin Wildmoser, Tobias Nipkow