503 search results - page 70 / 101 » Interpolative Boolean Logic |
126
click to vote
RTSS
1997
IEEE
15 years 5 months ago
1997
IEEE
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
102
Voted
CADE
2006
Springer
15 years 4 months ago
2006
Springer
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
100
click to vote
ATVA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
121
Voted
ENTCS
2007
15 years 21 days ago
2007
The flow logic approach to static analysis amounts to specifying the admissibility of solutions to analysis problems; when specified using formulae in stratified alternation-fr...
109
Voted
TCS
2008
15 years 19 days ago
2008
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...