Sciweavers

555 search results - page 53 / 111
» Complexity of Operations on Cofinite Languages
Sort
View
ECOOP
2008
Springer
13 years 9 months ago
A Model for Java with Wildcards
Wildcards are a complex and subtle part of the Java type system, present since version 5.0. Although there have been various formalisations and partial type soundness results conce...
Nicholas R. Cameron, Sophia Drossopoulou, Erik Ern...
ESOP
2008
Springer
13 years 9 months ago
Semi-persistent Data Structures
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
Sylvain Conchon, Jean-Christophe Filliâtre
IPPS
2009
IEEE
14 years 2 months ago
Fast development of dense linear algebra codes on graphics processors
—We present an application programming interface (API) for the C programming language that facilitates the development of dense linear algebra algorithms on graphics processors a...
M. Jesús Zafont, Alberto F. Martín, ...
FM
2009
Springer
104views Formal Methods» more  FM 2009»
14 years 2 months ago
A Metric Encoding for Bounded Model Checking
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
SEW
2006
IEEE
14 years 1 months ago
Integrating Probability with Time and Shared-Variable Concurrency
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
Huibiao Zhu, Shengchao Qin, Jifeng He, Jonathan P....