Sciweavers

508 search results - page 10 / 102
» A logical account of pspace
Sort
View
FOIKS
2006
Springer
13 years 11 months ago
Consistency Checking Algorithms for Restricted UML Class Diagrams
Abstract. Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical inconsistency easily. This p...
Ken Kaneiwa, Ken Satoh
TCS
2010
13 years 5 months ago
On the complexities of consistency checking for restricted UML class diagrams
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This paper focus...
Ken Kaneiwa, Ken Satoh
FORMATS
2004
Springer
14 years 26 days ago
Model-Checking for Weighted Timed Automata
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...
Thomas Brihaye, Véronique Bruyère, J...
ENTCS
2002
71views more  ENTCS 2002»
13 years 7 months ago
A Simplified Account of the Metatheory of Linear LF
We present a variant of the linear logical framework LLF that avoids the restriction l-typed terms be in pre-canonical form and adds -abstraction at the level of families. We aban...
Joseph Vanderwaart, Karl Crary
FORMATS
2008
Springer
13 years 9 months ago
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
The common metric temporal logics for continuous time were shown to be insufficient, when it was proved in [7, 12] that they cannot express a modality suggested by Pnueli. Moreover...
Alexander Rabinovich