146 search results - page 15 / 30 » Local Reasoning about Programs that Alter Data Structures |
CP
2004
Springer
15 years 1 months ago
2004
Springer
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...
SEFM
2005
IEEE
15 years 3 months ago
2005
IEEE
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
CAV
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
78
Voted
CAV
2008
Springer
14 years 11 months ago
2008
Springer
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...