5 search results - page 1 / 1 » Lazy Theorem Proving for Bounded Model Checking over Infinit... |
CADE
2002
Springer
14 years 4 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
ENTCS
2006
13 years 4 months ago
2006
We propose a format of predicate diagrams for the verification of real-time systems. We consider systems that are defined as extended timed graphs, a format that combines timed au...
SEFM
2009
IEEE
13 years 11 months ago
2009
IEEE
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...