681 search results - page 46 / 137 » A Logic for True Concurrency |
111
click to vote
ICFP
2004
ACM
15 years 9 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
109
click to vote
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
POPL
2010
ACM
15 years 7 months ago
2010
ACM
Concurrent programming errors arise when threads share data incorrectly. Programmers often avoid these errors by using synchronization to enforce a simple ownership policy: data i...
ASIACRYPT
2001
Springer
15 years 2 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
LCTRTS
2010
Springer
14 years 7 months ago
2010
Springer
Concurrent Action-Oriented Specifications (CAOS) model the behavior of a synchronous hardware circuit as asynchronous guarded at an abstraction level higher than the Register Tran...