Sciweavers

1722 search results - page 298 / 345
» Ontology Formalism Transformation
Sort
View
FMSP
2000
ACM
177views Formal Methods» more  FMSP 2000»
14 years 2 months ago
DSD: A schema language for XML
XML (eXtensible Markup Language) is a linear syntax for trees, which has gathered a remarkable amount of interest in industry. The acceptance of XML opens new venues for the appli...
Nils Klarlund, Anders Møller, Michael I. Sc...
PLDI
2010
ACM
14 years 2 months ago
Bringing Extensibility to Verified Compilers
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
Zachary Tatlock, Sorin Lerner
MBEES
2010
13 years 8 months ago
Test Case Integration: From Components to Systems
In a component-based development approach system integration generally implies the packaging and deployment of a group of software components on hardware units, possibly hiding th...
Bernhard Schätz, Christian Pfaller
PPDP
2007
Springer
14 years 4 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
BIRTHDAY
2005
Springer
14 years 3 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau