CSE-653: Seminar in Concurrency
Fall 2002
Papers for potential presentation:
Abstraction:
-
K.S. Namjoshi and R.P. Kurshan,
Syntactic Program Transformations for Automatic
Abstraction.
In CAV'00, LNCS volume 1855, 2000.
-
H. Saidi,
Model checking guided abstraction and analysis.
In SAS'00, LNCS volume 1824, 2000.
- S. Bensalem, Y. Lakhnech and S. Owre.
Computing Abstractions of Infinite State Systems
Compositionally and Automatically.
In CAV'98, LNCS volume 1427, 1998.
-
K. Baukus, Y. Lakhnech, K. Stahl, and M. Steffen.
Divide, abstract and model-check.
In 5th SPIN Workshop, LNCS volume 1680, 1999.
-
S. Graf and H. Saidi,
Construction of abstract state graphs of infinite systems with PVS.
In CAV'97, LNCS volumne 1254, 1997.
-
H. Saidi and N. Shankar.
Abstract and model check while you prove.
In CAV'99, LNCS volume 1633, 1999.
-
G.J. Holzmann,
Designing executable abstractions,
In Formal Methods in Software Practice, 1998.
-
P. A. Abdulla, A. Annichini, S. Bensalem, A. Bouajjani,
P. Habermehl, Y. Lakhnech,
Verification of Infinite-State Systems by Combining Abstraction
and Reachability Analysis.
In CAV'99, LNCS volume 1633, 1999.
Convergence Acceleration:
Assume/Guarantee Reasoning. Modular Model Checking:
Reasoning with unbounded channels:
-
P. A. Abdulla, A. Bouajjani, B. Jonsson,
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels.
In CAV'98, LNCS volume 1427, 1998.
-
D. Dams and R. Gerth,
The Bounded Retransmission Protocol Revisited,
Infinity'97,
ENTCS volume 9, 1997.
-
P. A. Abdulla, A. Annichini, and A. Bouajjani.
Algorithmic Verification of Lossy Channel Systems:
An Application to the Bounded Retransmission Protocol.
TACAS'99, LNCS volume 1579, 1999.
Systems with Arithmetic Constraints:
Model Extraction from Software:
Value Passing Systems:
C.R. Ramakrishnan