20 search results - page 4 / 4 » Graph-based verification of static program constraints |
177
click to vote
POPL
2004
ACM
15 years 12 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
107
click to vote
SIGSOFT
2003
ACM
16 years 8 days ago
2003
ACM
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
CONCUR
2010
Springer
15 years 20 days ago
2010
Springer
Reliability is a critical issue in many multi-organizational distributed applications, be they web services, financial protocols, scientific computing infrastructure, and software ...
SIGSOFT
2007
ACM
16 years 9 days ago
2007
ACM
Atomicity is a desirable property that safeguards application consistency for service compositions. A service composition exhibiting this property could either complete or cancel ...
LCTRTS
2007
Springer
15 years 5 months ago
2007
Springer
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...