Sciweavers

17 search results - page 2 / 4
» lfcs 2007
Sort
View
LFCS
2007
Springer
13 years 12 months ago
A Temporal Dynamic Logic for Verifying Hybrid System Invariants
We combine first-order dynamic logic for reasoning about possible behaviour of hybrid systems with temporal logic for reasoning about the temporal behaviour during their operation...
André Platzer
LFCS
2007
Springer
13 years 12 months ago
Reasoning About Sequences of Memory States
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
Rémi Brochenin, Stéphane Demri, &Eac...
LFCS
2007
Springer
13 years 12 months ago
A Decidable Temporal Logic of Repeating Values
Various logical formalisms with the freeze quantifier have been recently considered to model computer systems even though this is a powerful mechanism that often leads to undecida...
Stéphane Demri, Deepak D'Souza, Régi...
LFCS
2007
Springer
13 years 12 months ago
Density Elimination and Rational Completeness for First-Order Logics
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
Agata Ciabattoni, George Metcalfe
LFCS
2007
Springer
13 years 12 months ago
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” whic...
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier