Sciweavers

575 search results - page 81 / 115
» Formal Coverification of Embedded Systems Using Model Checki...
Sort
View
FORMATS
2009
Springer
14 years 2 months ago
On the Supports of Recognizable Timed Series
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and intr...
Karin Quaas
ENTCS
2006
168views more  ENTCS 2006»
13 years 7 months ago
Case Study: Model Transformations for Time-triggered Languages
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
Tivadar Szemethy
PPDP
2007
Springer
14 years 1 months ago
Mechanized metatheory model-checking
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
James Cheney, Alberto Momigliano
CONTEXT
2003
Springer
14 years 19 days ago
On the Difference between Bridge Rules and Lifting Axioms
Abstract. In a previous paper, we proposed a first formal and conceptual comparison between the two most important formalizations of context in AI: Propositional Logic of Context ...
Paolo Bouquet, Luciano Serafini
CAV
2004
Springer
96views Hardware» more  CAV 2004»
14 years 24 days ago
Widening Arithmetic Automata
Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Gi...
Constantinos Bartzis, Tevfik Bultan