Sciweavers

481 search results - page 55 / 97
» Model Checking Abstract State Machines and Beyond
Sort
View
POPL
2007
ACM
16 years 4 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might
RTCSA
1999
IEEE
15 years 8 months ago
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
Zhe Dang, Richard A. Kemmerer
CAV
2009
Springer
184views Hardware» more  CAV 2009»
16 years 4 months ago
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
Vineet Kahlon, Chao Wang, Aarti Gupta
STTT
2010
120views more  STTT 2010»
14 years 11 months ago
Solving the ignoring problem for partial order reduction
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
Sami Evangelista, Christophe Pajault
BIRTHDAY
2009
Springer
15 years 5 months ago
An ASM-Characterization of a Class of Distributed Algorithms
Conventional computation models restrict to particular data structures to represent states of a computation, e.g. natural numbers, s, stacks, etc. Gurevich's Abstract State Ma...
Andreas Glausch, Wolfgang Reisig