Sciweavers

1864 search results - page 137 / 373
» Formal topology and domains
Sort
View
KBSE
1998
IEEE
15 years 10 months ago
Explaining Synthesized Software
Motivated by NASA's need for high-assurance software, NASA Ames' Amphion project has developed a generic program generation system based on deductive synthesis. Amphion ...
Jeffrey Van Baalen, Peter Robinson, Michael R. Low...
FM
2009
Springer
104views Formal Methods» more  FM 2009»
16 years 1 months ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene
CDC
2008
IEEE
215views Control Systems» more  CDC 2008»
16 years 28 days ago
A coverage algorithm for a class of non-convex regions
— The paper describes a framework for solving the coverage problem for a class of non-convex domains. In [1] we have shown how a diffeomorphism can be used to transform a non-con...
Carlos H. Caicedo-Nunez, Milos Zefran
PPDP
2004
Springer
15 years 11 months ago
A lazy narrowing calculus for declarative constraint programming
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...
Francisco Javier López-Fraguas, Mario Rodr&...
INLG
2010
Springer
15 years 4 months ago
Grouping Axioms for More Coherent Ontology Descriptions
Ontologies and datasets for the Semantic Web are encoded in OWL formalisms that are not easily comprehended by people. To make ontologies accessible to human domain experts, sever...
Sandra Williams, Richard Power