Sciweavers

232 search results - page 36 / 47
» Symbolic Bounded Conformance Checking of Model Programs
Sort
View
TACAS
2005
Springer
124views Algorithms» more  TACAS 2005»
14 years 2 months ago
Dynamic Symmetry Reduction
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
E. Allen Emerson, Thomas Wahl
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
14 years 3 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...
POPL
2011
ACM
12 years 11 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
RTCSA
2006
IEEE
14 years 2 months ago
An RTOS API Translator for Model-Driven Embedded Software Development
In this paper, we present a model-driven approach to RTOS-based embedded software development and an automated tool that can produce RTOS-specific code. Our contributions are two ...
Ji Chan Maeng, Jong-Hyuk Kim, Minsoo Ryu
ICLP
2010
Springer
13 years 6 months ago
A Framework for Verification and Debugging of Resource Usage Properties: Resource Usage Verification
We present a framework for (static) verification of general resource usage program properties. The framework extends the criteria of correctness as the conformance of a program to ...
Pedro López-García, Luthfi Darmawan,...