Sciweavers

4485 search results - page 247 / 897
» Equivalences on Observable Processes
Sort
View
POPL
2009
ACM
16 years 5 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
POPL
2008
ACM
16 years 4 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
CASCON
2004
127views Education» more  CASCON 2004»
15 years 5 months ago
A quantitative analysis of the performance impact of specialized bytecodes in java
Java is implemented by 201 bytecodes that serve the same purpose as assembler instructions while providing object-file platform independence. A collection of core bytecodes provid...
Ben Stephenson, Wade Holst
DLOG
2003
15 years 5 months ago
Implementing Matching in ALE--First Results
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
Sebastian Brandt
IJAR
2008
83views more  IJAR 2008»
15 years 4 months ago
Decision-theoretic specification of credal networks: A unified language for uncertain modeling with sets of Bayesian networks
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Credal nets appear to be power...
Alessandro Antonucci, Marco Zaffalon