Sciweavers

923 search results - page 113 / 185
» Proving the value of formal methods
Sort
View
SAS
2005
Springer
114views Formal Methods» more  SAS 2005»
15 years 11 months ago
Type-Safe Optimisation of Plugin Architectures
Programmers increasingly implement plugin architectures in type-safe object-oriented languages such as Java. A virtual machine can dynamically load class files containing plugins,...
Neal Glew, Jens Palsberg, Christian Grothoff
WWW
2005
ACM
16 years 7 months ago
PageRank as a function of the damping factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
BICOB
2010
Springer
15 years 11 months ago
Algebraic Theory of DNA Recombination
In this paper we investigate the structure and representation of n-ary algebras arising from DNA recombination, where n is a number of DNA segments participating in recombination. ...
Sergei R. Sverchkov
JUCS
2008
140views more  JUCS 2008»
15 years 6 months ago
The Computable Multi-Functions on Multi-represented Sets are Closed under Programming
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
Klaus Weihrauch
AOSD
2007
ACM
15 years 10 months ago
Open bisimulation for aspects
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
Radha Jagadeesan, Corin Pitcher, James Riely