Sciweavers

12 search results - page 2 / 3
» Sound reasoning about unchecked exceptions
Sort
View
ICSE
2011
IEEE-ACM
14 years 3 months ago
Inference of field initialization
A raw object is partially initialized, with only some fields set to legal values. It may violate its object invariants, such as that a given field is non-null. Programs often ma...
Fausto Spoto, Michael D. Ernst
99
Voted
ATAL
2001
Springer
15 years 4 months ago
Commitment Machines
We develop an approach in which we model communication protocols via commitment machines. Commitment machines supply a content to protocol states and actions in terms of the social...
Pinar Yolum, Munindar P. Singh
85
Voted
DLOG
2008
15 years 2 months ago
SRIQ and SROIQ are Harder than SHOIQ
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...
Yevgeny Kazakov
88
Voted
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
15 years 8 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
15 years 8 months ago
Towards type-theoretic semantics for transactional concurrency
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett