Sciweavers

277 search results - page 5 / 56
» Precise reasoning for programs using containers
Sort
View
ECRTS
2010
IEEE
13 years 7 months ago
Precise and Efficient FIFO-Replacement Analysis Based on Static Phase Detection
Schedulability analysis for hard real-time systems requires bounds on the execution times of its tasks. To obtain useful bounds in the presence of caches, static timing analyses mu...
Daniel Grund, Jan Reineke
SCP
2002
98views more  SCP 2002»
13 years 5 months ago
Reasoning about real-time repetitions: terminating and nonterminating
It is common for a real-time system to contain a nonterminating process monitoring an input and controlling an output. Hence, a real-time program development method needs to suppo...
Ian J. Hayes
ECOOP
2010
Springer
13 years 11 months ago
Reasoning about the Implementation of Concurrency Abstractions on x86-TSO
ncy Abstractions on x86-TSO Scott Owens University of Cambridge Abstract. With the rise of multi-core processors, shared-memory concurrency has become a widespread feature of compu...
Scott Owens
NFM
2011
252views Formal Methods» more  NFM 2011»
13 years 1 months ago
Call Invariants
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
Shuvendu K. Lahiri, Shaz Qadeer
SIGSOFT
2010
ACM
13 years 3 months ago
Staged concurrent program analysis
Concurrent program verification is challenging because it involves exploring a large number of possible thread interleavings together with complex sequential reasoning. As a resul...
Nishant Sinha, Chao Wang