Sciweavers

1814 search results - page 311 / 363
» Extended First-Order Logic
Sort
View
CAV
2005
Springer
127views Hardware» more  CAV 2005»
15 years 3 months ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
SEMWEB
2005
Springer
15 years 3 months ago
On the Properties of Metamodeling in OWL
A common practice in conceptual modeling is to separate the conceptual from the data model. Although very intuitive, this approach is inadequate for many complex domains, in which...
Boris Motik
UC
2005
Springer
15 years 3 months ago
On Model-Checking of P Systems
Abstract. Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computin...
Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
UML
2005
Springer
15 years 3 months ago
Explicit Platform Models for MDA
The main drive for Model-Driven Architecture is that many software applications have to be deployed on a variety of platforms. The way MDA achieves this is by transforming a platfo...
Dennis Wagelaar, Viviane Jonckers
APLAS
2004
ACM
15 years 3 months ago
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
Koichi Kodama, Kohei Suenaga, Naoki Kobayashi