122 search results - page 13 / 25 » Bounded Model Checking of Pointer Programs |
PPPJ
2006
ACM
14 years 2 months ago
2006
ACM
Development of high quality code is extremely di cult. Tools that help maintaining the proper quality of code produced by programmers can be very useful: they may increase the qua...
FUIN
2000
13 years 8 months ago
2000
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
ISSTA
2004
ACM
14 years 2 months ago
2004
ACM
The use of XML as the de facto data exchange standard has allowed integration of heterogeneous web based software systems regardless of implementation platforms and programming la...
IFM
2009
Springer
14 years 3 months ago
2009
Springer
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...
IFM
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...