Sciweavers

141 search results - page 10 / 29
» Automatically Proving Concurrent Programs Correct
Sort
View
VMCAI
2009
Springer
14 years 2 months ago
Finding Concurrency-Related Bugs Using Random Isolation
This paper describes the methods used in Empire, a tool to detect concurrency-related bugs, namely atomic-set serializability violations in Java programs. The correctness criterion...
Nicholas Kidd, Thomas W. Reps, Julian Dolby, Manda...
POPL
2008
ACM
14 years 8 months ago
Semantics of transactional memory and automatic mutual exclusion
Software Transactional Memory (STM) is an attractive basis for the development of language features for concurrent programming. However, the semantics of these features can be del...
Andrew Birrell, Martín Abadi, Michael Isard...
ICLP
1997
Springer
13 years 11 months ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv
ASPLOS
2012
ACM
12 years 3 months ago
Data races vs. data race bugs: telling the difference with portend
Even though most data races are harmless, the harmful ones are at the heart of some of the worst concurrency bugs. Alas, spotting just the harmful data races in programs is like ï...
Baris Kasikci, Cristian Zamfir, George Candea
FASE
1999
Springer
13 years 12 months ago
JTN: A Java-Targeted Graphic Formal Notation for Reactive and Concurrent Systems
JTN is a formal graphic notation for Java-targeted design speci cations, that are speci cations of systems that will be implemented using Java. JTN is aimed to be a part of a more ...
Eva Coscia, Gianna Reggio