1895 search results - page 341 / 379 » Using ATL for Checking Models |
131
click to vote
ISSTA
2006
ACM
15 years 6 months ago
2006
ACM
We present initial work on perturbation techniques that cause the manifestation of timing-related bugs in distributed memory Message Passing Interface (MPI)-based applications. Th...
101
click to vote
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
103
Voted
WECWIS
2005
IEEE
15 years 6 months ago
2005
IEEE
Flexible workflow systems are needed for processes that need consistency as well as flexibility (e.g., personalized client interactions). A methodology for designing flexible serv...
103
Voted
ATVA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
118
click to vote
EMSOFT
2005
Springer
15 years 6 months ago
2005
Springer
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...