Travelled to:
1 × Germany
1 × Israel
2 × Italy
3 × USA
Collaborated with:
∅ S.Graf N.Shankar S.Bensalem Y.Lakhnech A.Tiwari H.Rueß M.Fredrikson R.Joiner S.Jha T.W.Reps P.A.Porras V.Yegneswaran
Talks about:
invari (5) abstract (4) system (3) prove (3) techniqu (2) generat (2) concurr (2) automat (2) analysi (2) model (2)
Person: Hassen Saïdi
DBLP: Sa=iuml=di:Hassen
Contributed to:
Wrote 10 papers:
- CAV-2012-FredriksonJJRPSY #abstraction #performance #policy #refinement #runtime #using
- Efficient Runtime Policy Enforcement Using Counterexample-Guided Abstraction Refinement (MF, RJ, SJ, TWR, PAP, HS, VY), pp. 548–563.
- TACAS-2001-TiwariRSS #generative #invariant
- A Technique for Invariant Generation (AT, HR, HS, NS), pp. 113–127.
- SAS-2000-Saidi #abstraction #analysis #model checking
- Model Checking Guided Abstraction and Analysis (HS), pp. 377–396.
- ASE-1999-Saidi #analysis #composition #concurrent #incremental
- Modular and Incremental Analysis of Concurrent Software Systems (HS), pp. 92–101.
- CAV-1999-SaidiS
- Abstract and Model Check While You Prove (HS, NS), pp. 443–454.
- CAV-1997-GrafS #graph
- Construction of Abstract State Graphs with PVS (SG, HS), pp. 72–83.
- CAV-1997-Saidi #automation #deduction #invariant #verification
- The Invariant Checker: Automated Deductive Verification of Reactive Systems (HS), pp. 436–439.
- CAV-1996-BensalemLS #automation #generative #invariant
- Powerful Techniques for the Automatic Generation of Invariants (SB, YL, HS), pp. 323–335.
- CAV-1996-GrafS #invariant #proving #theorem proving #using #verification
- Verifying Invariants Using theorem Proving (SG, HS), pp. 196–207.
- TACAS-1996-Saidi #automation #concurrent #proving
- A Tool for Proving Invariance Properties of Concurrent Systems Automatically (HS), pp. 412–416.