417 search results - page 81 / 84 » Results on Reasoning about Updates in Transaction Logic |
153
click to vote
SIGSOFT
2007
ACM
16 years 6 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
271
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
296
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
295
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected interactions between concurrent threads. Much previous work has focused on det...
292
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom...