Sciweavers

6608 search results - page 20 / 1322
» On the Completeness of Model Checking
Sort
View
DBPL
2007
Springer
101views Database» more  DBPL 2007»
13 years 11 months ago
Efficient Inclusion for a Class of XML Types with Interleaving and Counting
Inclusion between XML types is important but expensive, and is much more expensive when unordered types are considered. We prove here that inclusion for XML types with interleavin...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
ICSE
2001
IEEE-ACM
13 years 12 months ago
A Scalable Formal Method for Design and Automatic Checking of User Interfaces
The paper addresses the formal specification, design and implementation of the behavioral component of graphical user interfaces. The complex sequences of visual events and action...
Jean Berstel, Stefano Crespi-Reghizzi, Gilles Rous...
ROOM
2000
13 years 8 months ago
Checking the Consistency of UML Class Diagrams Using Larch Prover
The Unified Modeling Language (UML) has been designed to be a full standard notation for Object-Oriented Modelling. UML is a rather complete set of notations, but it lacks of form...
Pascal André, Annya Romanczuk, Jean-Claude ...
DLOG
2009
13 years 5 months ago
Model-Based Most Specific Concepts in Some Inexpressive Description Logics
Abstract. Model-based most specific concepts are a non-standard reasoning service in Description Logics. They have turned out to be useful in knowledge base completion for ontologi...
Felix Distel
LICS
2009
IEEE
14 years 2 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...