4460 search results - page 387 / 892 » Formal methods for interactive systems |
173
click to vote
FORMATS
2004
Springer
16 years 5 days ago
2004
Springer
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
192
click to vote
CPM
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
322
click to vote
NFM
2011
15 years 1 months ago
2011
Synthesis of finite-state machines from linear-time temporal logic (LTL) formulas is an important formal specification debugging technique for reactive systems and can quickly ge...
143
click to vote
FMCAD
2009
Springer
16 years 1 months ago
2009
Springer
stractions for Floating-Point Arithmetic Angelo Brillout Computer Systems Institute, ETH Zurich Daniel Kroening and Thomas Wahl Oxford University Computing Laboratory Abstract—Fl...
176
click to vote
TLDI
2003
ACM
16 years 1 days ago
2003
ACM
We develop a logic for reasoning about adjacency and separation of memory blocks, as well as aliasing of pointers. We provide a memory model for our logic and present a sound set ...