7557 search results - page 206 / 1512 » Modeling Timed Concurrent Systems |
167
click to vote
LPAR
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
224
click to vote
CAV
2005
Springer
16 years 23 hour ago
2005
Springer
Abstract. We propose a new technique for the static analysis of concurrent programs comprised of multiple threads. In general, the problem is known to be undecidable even for progr...
197
click to vote
ATVA
2004
Springer
15 years 12 months ago
2004
Springer
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
173
click to vote
SE
2008
15 years 8 months ago
2008
Abstract: Modern software development approaches, especially the model-driven approaches, heavily rely on the use of models during the whole development process. With the increasin...
168
click to vote
CC
2010
Springer
16 years 1 months ago
2010
Springer
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...