Sciweavers

6608 search results - page 23 / 1322
» On the Completeness of Model Checking
Sort
View
120
Voted
ICSM
2009
IEEE
15 years 7 months ago
Regression model checking
Model checking is a promising technique for verifying program behavior and is increasingly finding usage in industry. To date, however, researchers have primarily considered mode...
Guowei Yang, Matthew B. Dwyer, Gregg Rothermel
95
Voted
AAAI
2004
15 years 2 months ago
On Odd and Even Cycles in Normal Logic Programs
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...
Fangzhen Lin, Xishun Zhao
90
Voted
ICTAI
2005
IEEE
15 years 6 months ago
Reachability Analysis for Uncertain SSPs
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
Olivier Buffet
CONCUR
2004
Springer
15 years 6 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König
183
Voted
ICLP
2009
Springer
16 years 1 months ago
Incremental Answer Completion in the SLG-WAM
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
Alexandre Miguel Pinto, Luís Moniz Pereira,...