3573 search results - page 138 / 715 » Reasoning about Codata |
105
Voted
DATE
2006
IEEE
15 years 9 months ago
2006
IEEE
Concurrent programs are difficult to write, reason about, re-use, and maintain. In particular, for system-level ions that use a shared memory abstraction for thread or process syn...
110
click to vote
AIEDAM
2006
15 years 3 months ago
2006
Design involves reasoning about descriptions of design artefacts, reasoning about design requirements and reasoning about design process objectives (such as keeping to deadlines an...
117
click to vote
IGPL
2006
15 years 3 months ago
2006
Very recently, a (fuzzy modal) logic to reason about coherent conditional probability, in the sense of de Finetti, has been introduced by the authors. Under this approach, a condi...
123
click to vote
LICS
1996
IEEE
15 years 7 months ago
1996
IEEE
We consider a parallel Algol-like language, combining procedures with shared-variable parallelism. Procedures permit encapsulation of common parallel programming idioms. Local var...
219
Voted
POPL
2007
ACM
16 years 3 months ago
2007
ACM
The predominant thread-based approach to concurrent programming is bug-prone, difficult to reason about, and does not scale well to large numbers of processors. Sieves provide a s...