62 search results - page 11 / 13 » Boolean Abstraction for Temporal Logic Satisfiability |
115
click to vote
DLT
2010
14 years 11 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
PLDI
2009
ACM
15 years 4 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
LOGCOM
2010
14 years 8 months ago
2010
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
ATVA
2007
Springer
15 years 3 months ago
2007
Springer
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
105
click to vote
CAV
2008
Springer
14 years 11 months ago
2008
Springer
We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementa...