Sciweavers

846 search results - page 46 / 170
» The Use of Z
Sort
View
JBI
2011
283views Bioinformatics» more  JBI 2011»
13 years 2 months ago
Cross-product extensions of the Gene Ontology
The Gene Ontology is being normalized and extended to include computable logical definitions. These definitions are partitioned into mutually exclusive cross-product sets, many of...
Christopher J. Mungall, Michael Bada, Tanya Z. Ber...
IMC
2005
ACM
14 years 1 months ago
Multi-Hop Probing Asymptotics in Available Bandwidth Estimation: Stochastic Analysis
— This paper analyzes the asymptotic behavior of packet-train probing over a multi-hop network path P carrying arbitrarily routed bursty cross-traffic flows. We examine the sta...
Xiliang Liu, Kaliappa Nadar Ravindran, Dmitri Logu...
ENTCS
2008
99views more  ENTCS 2008»
13 years 8 months ago
ArcAngelC: a Refinement Tactic Language for Circus
Circus is a refinement language, in which specifications define both data and behavioural aspects of concurrent systems using a combination of Z and CSP. Its refinement theory and...
M. V. M. Oliveira, A. L. C. Cavalcanti
CPP
2011
98views more  CPP 2011»
12 years 7 months ago
Automatically Verifying Typing Constraints for a Data Processing Language
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
Michael Backes, Catalin Hritcu, Thorsten Tarrach
LOGCOM
2010
152views more  LOGCOM 2010»
13 years 2 months ago
Constructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
Manuela Busaniche, Roberto Cignoli