Sciweavers

556 search results - page 111 / 112
» Checking Interval Properties of Computations
Sort
View
POPL
2009
ACM
15 years 12 months ago
The semantics of progress in lock-based transactional memory
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
Rachid Guerraoui, Michal Kapalka
PLDI
2006
ACM
15 years 5 months ago
Refactoring programs to secure information flows
Adding a sound information flow security policy to an existing program is a difficult task that requires major analysis of and changes to the program. In this paper we show how ...
Scott F. Smith, Mark Thober
ICFEM
2005
Springer
15 years 4 months ago
An Evidential Tool Bus
Abstract. Theorem provers, model checkers, static analyzers, test generators. . . all of these and many other kinds of formal methods tools can contribute to the analysis and devel...
John M. Rushby
EMSOFT
2001
Springer
15 years 3 months ago
Interface Theories for Component-Based Design
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...
Luca de Alfaro, Thomas A. Henzinger
CORR
2004
Springer
124views Education» more  CORR 2004»
14 years 11 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini