2604 search results - page 147 / 521 » General constant expressions for system programming language... |
161
Voted
ASPLOS
2008
ACM
15 years 5 months ago
2008
ACM
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
134
Voted
ATAL
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. In this paper, we consider the process algebra ACPL, which models the basics of agent communication. This algebra combines the informationprocessing aspects of Concurrent...
164
Voted
ICFP
2010
ACM
15 years 4 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
150
Voted
TAP
2010
Springer
15 years 1 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
172
Voted
SAS
1994
Springer
15 years 7 months ago
1994
Springer
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...