Sciweavers

126 search results - page 10 / 26
» An Extension to Pointer Logic for Verification
Sort
View
CONCUR
2009
Springer
13 years 11 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...
CI
2000
114views more  CI 2000»
13 years 7 months ago
A Guided Tour through Some Extensions of the Event Calculus
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
ENTCS
2008
109views more  ENTCS 2008»
13 years 8 months ago
Separation Logic for Multiple Inheritance
As an extension to Floyd-Hoare logic, separation logic has been used to facilitate reasoning about imperative programs manipulating shared mutable data structures. Recently, it ha...
Chenguang Luo, Shengchao Qin
TCS
2008
13 years 7 months ago
Verification of qualitative Z constraints
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...
Stéphane Demri, Régis Gascon
FOSSACS
2001
Springer
14 years 10 days ago
On Garbage and Program Logic
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...
Cristiano Calcagno, Peter W. O'Hearn