Sciweavers

9 search results - page 2 / 2
» Boom: Taking Boolean Program Model Checking One Step Further
Sort
View
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
13 years 11 months ago
Dynamic Path Reduction for Software Model Checking
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...
CONCUR
2000
Springer
13 years 9 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
ACMSE
2006
ACM
13 years 11 months ago
Extensions to and optimization of a mobile computational system for internet programming
elow are abstracts of student-faculty collaborative work presented at regional, national, and international conferences. Gregory Adkins, Elizabeth Carter, Amanda Micai, and Sarah M...
Sarah Monisha Pulimood, Gregory Adkins, Elizabeth ...
CP
2001
Springer
13 years 9 months ago
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
Peter van Beek, Kent D. Wilken