32032 search results - page 44 / 6407 » Verified programming in Guru |
LPAR
2001
Springer
15 years 3 months ago
2001
Springer
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
86
Voted
CSL
2004
Springer
15 years 2 months ago
2004
Springer
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...
SNPD
2008
15 years 15 days ago
2008
For software executing several threads in parallel, testing is unreliable, as it cannot cover all thread schedules. Model checking, however, can cover all possible thread interlea...
SEFM
2005
IEEE
15 years 4 months ago
2005
IEEE
Memory consumption policies provide a means to control resource usage on constrained devices, and play an important role in ensuring the overall quality of software systems, and i...
SNPD
2008
15 years 15 days ago
2008
Testing cannot cover all execution schedules in concurrent software. Model checking, however, is capable of verifying the outcome of all possible executions. It has been applied s...