Sciweavers

60 search results - page 8 / 12
» Reasoning About Sequences of Memory States
Sort
View
LICS
2007
IEEE
14 years 1 months ago
Local Action and Abstract Separation Logic
tion and Abstract Separation Logic Cristiano Calcagno Imperial College, London Peter W. O’Hearn Queen Mary, University of London Hongseok Yang Queen Mary, University of London S...
Cristiano Calcagno, Peter W. O'Hearn, Hongseok Yan...
CAV
2004
Springer
93views Hardware» more  CAV 2004»
14 years 26 days ago
Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures
—We introduce a new BDD-like data structure called Hybrid-Restriction Diagrams (HRDs) for the representation and manipulation of linear hybrid automata (LHA) state-spaces and pre...
Farn Wang
LICS
2000
IEEE
13 years 12 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger
TIME
1999
IEEE
13 years 11 months ago
TALplanner: An Empirical Investigation of a Temporal Logic-Based Forward Chaining Planner
We present a new forward chaining planner, TALplanner, based on ideas developed by Bacchus [5] and Kabanza [11], where domain-dependent search control knowledge represented as tem...
Patrick Doherty, Jonas Kvarnström
SAS
1997
Springer
162views Formal Methods» more  SAS 1997»
13 years 11 months ago
Exact Flow Analysis
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
Christian Mossin