Sciweavers

443 search results - page 34 / 89
» Relations in Concurrency
Sort
View
TACS
1991
Springer
14 years 10 days ago
On Nets, Algebras and Modularity
We aim at a unified and coherent presentation of net models for concurrency like Petri nets and dataflow networks from the perspective of modularity and substitutivity. The major ...
Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
FASE
2010
Springer
14 years 3 months ago
Analyzing the Impact of Change in Multi-threaded Programs
We introduce a technique for debugging multi-threaded C programs and analyzing the impact of source code changes, and its implementation in the prototype tool Direct. Our approach ...
Krishnendu Chatterjee, Luca de Alfaro, Vishwanath ...
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
14 years 18 days ago
Timed Unfoldings for Networks of Timed Automata
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
ICSE
2010
IEEE-ACM
14 years 25 days ago
Code bubbles: rethinking the user interface paradigm of integrated development environments
Today’s integrated development environments (IDEs) are hampered by their dependence on files and file-based editing. We propose a novel user interface that is based on collectio...
Andrew Bragdon, Steven P. Reiss, Robert C. Zelezni...
WDAG
2009
Springer
77views Algorithms» more  WDAG 2009»
14 years 3 months ago
Nonblocking Algorithms and Backward Simulation
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
Simon Doherty, Mark Moir