Sciweavers

2702 search results - page 293 / 541
» Practically Applicable Formal Methods
Sort
View
114
Voted
CCS
2007
ACM
15 years 9 months ago
Universally composable and forward-secure RFID authentication and authenticated key exchange
Recently, a universally composable framework for RFID authentication protocols providing availability, anonymity, and authenticity was proposed. In this paper we extend that frame...
Tri Van Le, Mike Burmester, Breno de Medeiros
KI
2007
Springer
15 years 8 months ago
Extending Markov Logic to Model Probability Distributions in Relational Domains
Abstract. Markov logic, as a highly expressive representation formalism that essentially combines the semantics of probabilistic graphical models with the full power of first-orde...
Dominik Jain, Bernhard Kirchlechner, Michael Beetz
118
Voted
DLT
2004
15 years 4 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
133
Voted
DAC
2007
ACM
16 years 3 months ago
Global Critical Path: A Tool for System-Level Timing Analysis
An effective method for focusing optimization effort on the most important parts of a design is to examine those elements on the critical path. Traditionally, the critical path is...
Girish Venkataramani, Mihai Budiu, Tiberiu Chelcea...
106
Voted
CAV
2009
Springer
181views Hardware» more  CAV 2009»
16 years 3 months ago
Size-Change Termination, Monotonicity Constraints and Ranking Functions
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
Amir M. Ben-Amram