Sciweavers

666 search results - page 53 / 134
» Inspector Methods for State Abstraction
Sort
View
ICTAC
2005
Springer
15 years 3 months ago
Symbolic Model Checking of Finite Precision Timed Automata
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
Rongjie Yan, Guangyuan Li, Zhisong Tang
FMCAD
2004
Springer
15 years 3 months ago
Integrating Reasoning About Ordinal Arithmetic into ACL2
Abstract. Termination poses one of the main challenges for mechanically verifying infinite state systems. In this paper, we develop a powerful and extensible framework based on th...
Panagiotis Manolios, Daron Vroon
IPPS
1998
IEEE
15 years 2 months ago
Deriving Efficient Cache Coherence Protocols through Refinement
Abstract. We address the problem of developing efficient cache coherence protocols implementing distributed shared memory (DSM) using message passing. A serious drawback of traditi...
Ratan Nalumasu, Ganesh Gopalakrishnan
DOOD
1997
Springer
134views Database» more  DOOD 1997»
15 years 1 months ago
Well-Founded Semantics for Deductive Object-Oriented Database Languages
Abstract. We present a well-founded semantics for deductive objectoriented database (dood) languages by applying the alternating- xpoint characterization of the well-founded model ...
Wolfgang May, Bertram Ludäscher, Georg Lausen
SPIN
2000
Springer
15 years 1 months ago
Communication Topology Analysis for Concurrent Programs
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
Matthieu Martel, Marc Gengler