Sciweavers

1615 search results - page 4 / 323
» Distributed Forward Checking
Sort
View
PADO
2001
Springer
15 years 6 months ago
Deriving Pre-conditions for Array Bound Check Elimination
Abstract. We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant ch...
Wei-Ngan Chin, Siau-Cheng Khoo, Dana N. Xu
FORMATS
2005
Springer
15 years 7 months ago
Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems
Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability...
Patricia Bouyer, François Laroussinie, Pier...
ATVA
2005
Springer
131views Hardware» more  ATVA 2005»
15 years 7 months ago
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
Fuzhi Wang, Marta Z. Kwiatkowska
84
Voted
ISHPC
1997
Springer
15 years 6 months ago
Improving the Performance of Automated Forward Deduction System EnCal
Kazunori Nishi, Jingde Cheng, Kazuo Ushijima