2604 search results - page 232 / 521 » General constant expressions for system programming language... |
127
click to vote
SIGSOFT
2007
ACM
16 years 4 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...
146
click to vote
APLAS
2004
ACM
15 years 9 months ago
2004
ACM
Developing computer systems that are both concurrent and evolving is challenging. To guarantee consistent access to resources by concurrent software components, some synchronizatio...
132
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
In the early days a policy was a set of simple rules with a clear intuitive motivation that could be formalised to good effect. However the world is becoming much more complex. S...
141
click to vote
HYBRID
2010
Springer
15 years 10 months ago
2010
Springer
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
259
click to vote
POPL
2003
ACM
16 years 4 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...