Sciweavers

90 search results - page 3 / 18
» Formalizing and Proving Semantic Relations between Specifica...
Sort
View
PLDI
2012
ACM
11 years 10 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
ENTCS
2008
79views more  ENTCS 2008»
13 years 7 months ago
Experimenting Formal Proofs of Petri Nets Refinements
Petri nets are a formalism for modelling and validating critical systems. Generally, the approach to specification starts from an abstract view of the system under study. Once val...
Christine Choppy, Micaela Mayero, Laure Petrucci
OTM
2005
Springer
14 years 29 days ago
Semantics of Agent-Based Service Delegation and Alignment
In this paper we will concentrate on the conceptual modeling and semantics of service delegation and alignment in information systems. In delegation, one typically has the situatio...
Herman Balsters, G. B. Huitema, Nicolae B. Szirbik
ICFP
2009
ACM
14 years 8 months ago
Biorthogonality, step-indexing and compiler correctness
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
Nick Benton, Chung-Kil Hur
BMCBI
2008
124views more  BMCBI 2008»
13 years 7 months ago
A relation based measure of semantic similarity for Gene Ontology annotations
Background: Various measures of semantic similarity of terms in bio-ontologies such as the Gene Ontology (GO) have been used to compare gene products. Such measures of similarity ...
Brendan Sheehan, Aaron J. Quigley, Benoit Gaudin, ...