Sciweavers

1722 search results - page 197 / 345
» Ontology Formalism Transformation
Sort
View
LPAR
2004
Springer
15 years 12 months ago
Knowledge-Based Synthesis of Distributed Systems Using Event Structures
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
Mark Bickford, Robert L. Constable, Joseph Y. Halp...
FM
1999
Springer
104views Formal Methods» more  FM 1999»
15 years 10 months ago
On Excusable and Inexcusable Failures
Abstract. The classical concepts of partial and total correctness identify all types of runtime errors and divergence. We argue that the associated notions of translation correctne...
Markus Müller-Olm, Andreas Wolf
SAS
2000
Springer
15 years 10 months ago
Flattening Is an Improvement
d Abstract) James Riely1 and Jan Prins2 1 DePaul University 2 University of North Carolina at Chapel Hill Abstract. Flattening is a program transformation that eliminates nested pa...
James Riely, Jan Prins
DSVIS
1995
Springer
15 years 10 months ago
On the Expression of Interaction Properties within an Interactor Model
This paper introduces a formal model for the description of interactive systems based on the interactor model of [15, 17]. Similarly to that model, it is intended to be used constr...
Panos Markopoulos
EWCBR
2008
Springer
15 years 8 months ago
Conservative Adaptation in Metric Spaces
Conservative adaptation consists in a minimal change on a source case to be consistent with the target case, given the domain knowledge. It has been formalised in a previous work t...
Julien Cojan, Jean Lieber