200 search results - page 1 / 40 » Invariant Logics |
CADE
2008
Springer
13 years 6 months ago
2008
Springer
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...
MLQ
2002
13 years 4 months ago
2002
A modal logic is called invariant if for all automorphisms of NExt K, () = . An invariant logic is therefore uniquely determined by its surrounding in the lattice. It will be est...
JANCL
2008
13 years 4 months ago
2008
Consider any logical system, what is its natural repertoire of logical operations? This question has been raised in particular for first-order logic and its extensions with genera...
LFCS
2007
Springer
13 years 11 months ago
2007
Springer
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...
DATE
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper focuses on inductive invariants in unbounded model checking to improve efficiency and scalability. First of all, it introduces optimized techniques to speedup the comp...