Sciweavers

1096 search results - page 61 / 220
» Type inference for atomicity
Sort
View
CORR
2012
Springer
212views Education» more  CORR 2012»
12 years 5 months ago
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdot...
SPAA
1990
ACM
14 years 1 months ago
Wait-Free Data Structures in the Asynchronous PRAM Model
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
James Aspnes, Maurice Herlihy
BMCBI
2008
104views more  BMCBI 2008»
13 years 9 months ago
Analyzing the simplicial decomposition of spatial protein structures
Background: The fast growing Protein Data Bank contains the three-dimensional description of more than 45000 protein- and nucleic-acid structures today. The large majority of the ...
Rafael Ördög, Zoltan Szabadka, Vince Gro...
TII
2010
166views Education» more  TII 2010»
13 years 4 months ago
Source-to-Source Architecture Transformation for Performance Optimization in BIP
Behavior, Interaction, Priorities (BIP) is a component framework for constructing systems from a set of atomic components by using two kinds of composition operators: interactions ...
Marius Bozga, Mohamad Jaber, Joseph Sifakis
LFP
1990
102views more  LFP 1990»
13 years 10 months ago
A Semantic Basis for Quest
Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics ...
Luca Cardelli, Giuseppe Longo