BibSLEIGH — Parosh_Aziz

Travelled to:

1 × Croatia
1 × Cyprus
1 × Denmark
1 × Estonia
1 × Finland
1 × Greece
1 × Israel
1 × Poland
1 × Switzerland
1 × Taiwan
1 × The Netherlands
11 × USA
2 × Canada
2 × Hungary
3 × Austria
3 × France
3 × Germany
3 × Italy
3 × Spain
4 × Portugal
5 × United Kingdom

Collaborated with:

B.Jonsson M.F.Atig A.Rezine A.Bouajjani L.Holík R.Mayr L.Kaati G.Delzanno Y.Chen J.Stenman J.d'Orso F.Haziza N.B.Henda C.Leonardsson M.Nilsson T.Vojnar J.Deneux A.Nylén L.V.Begin J.Högberg P.Mahata A.M.Rabinovich A.Annichini P.Rümmer S.Aronis K.F.Sagonas Tuan Phong Ngo N.T.Phong P.Krcál W.Yi L.Boasson S.P.Iyer P.Bjesse N.Eén C.Q.Trinh Rojin Rezvan J.Ouaknine J.Worrell A.Legay M.Kindahl D.Peled K.Cerans Y.Tsay Jatin Arora 0002 S.N.Krishna S.Dwarkadas A.Shriraman Y.Zhu J.Cederberg L.d.Alfaro S.Sandberg M.Saksena P.Hofman K.N.Kumar P.Totzke S.Bensalem P.Habermehl Y.Lakhnech Magnus Lång Konstantinos Sagonas L.Clemente C.Hong Bui Phi Diep

Talks about:

verif (15) system (12) automata (11) time (9) model (8) check (8) parameter (7) infinit (7) tree (7) under (6)

Person: Parosh Aziz Abdulla

DBLP: Abdulla:Parosh_Aziz

Facilitated 1 volumes:

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2009

2008

2007

2006

2007

2005

2004

2003

2002

2001

2000

1999

1998

1996

1994

2018

2016

2018

2019

2017

2019

2020

Wrote 63 papers:

CAV-2015-AbdullaACHRRS #constraints #named #smt #string: Norn: An SMT Solver for String Constraints (PAA, MFA, YFC, LH, AR, PR, JS), pp. 462–469.
ESOP-2015-AbdullaAP #performance: The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO (PAA, MFA, NTP), pp. 308–332.
TACAS-2015-AbdullaAAJLS #model checking: Stateless Model Checking for TSO and PSO (PAA, SA, MFA, BJ, CL, KFS), pp. 353–367.
CAV-2014-AbdullaACHRRS #constraints #string #verification: String Constraints for Verification (PAA, MFA, YFC, LH, AR, PR, JS), pp. 150–166.
LATA-2014-AbdullaAS #automaton #reachability: Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata (PAA, MFA, JS), pp. 62–75.
LICS-CSL-2014-AbdullaAHMKT #energy #game studies #infinity: Infinite-state energy games (PAA, MFA, PH, RM, KNK, PT), p. 10.
POPL-2014-AbdullaAJS #partial order #reduction: Optimal dynamic partial order reduction (PAA, SA, BJ, KFS), pp. 373–384.
SAS-2014-AbdullaHH #exclamation #verification: Block Me If You Can! — Context-Sensitive Parameterized Verification (PAA, FH, LH), pp. 1–17.
DATE-2013-AbdullaDRSZ #hybrid #liveness #memory management #safety #transaction #verification: Verifying safety and liveness for the FlexTM hybrid transactional memory (PAA, SD, AR, AS, YZ), pp. 785–790.
TACAS-2013-AbdullaACLR #automation #precise: Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO (PAA, MFA, YFC, CL, AR), pp. 530–536.
TACAS-2013-AbdullaHHJR #concurrent #data type #specification #verification: An Integrated Specification and Verification Technique for Highly Concurrent Data Structures (PAA, FH, LH, BJ, AR), pp. 324–338.
VMCAI-2013-AbdullaHH: All for the Price of Few (PAA, FH, LH), pp. 476–495.
LATA-2012-AbdullaAS #automaton #low cost #problem #reachability: The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems (PAA, MFA, JS), pp. 58–69.
LICS-2012-AbdullaAS #automaton: Dense-Timed Pushdown Automata (PAA, MFA, JS), pp. 35–44.
SAS-2012-AbdullaACLR #abstraction #automation #integer #source code: Automatic Fence Insertion in Integer Programs via Predicate Abstraction (PAA, MFA, YFC, CL, AR), pp. 164–180.
TACAS-2012-AbdullaACLR: Counter-Example Guided Fence Insertion under TSO (PAA, MFA, YFC, CL, AR), pp. 204–219.
LICS-2011-AbdullaM #petri net: Computing Optimal Coverability Costs in Priced Timed Petri Nets (PAA, RM), pp. 399–408.
CAV-2010-AbdullaCCHHMV #automaton #simulation #testing: Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing (PAA, YFC, LC, LH, CDH, RM, TV), pp. 132–147.
TACAS-2010-AbdullaCHMV #anti #simulation: When Simulation Meets Antichains (PAA, YFC, LH, RM, TV), pp. 158–174.
FoSSaCS-2009-AbdullaM #low cost #petri net #reachability: Minimal Cost Reachability/Coverability in Priced Timed Petri Nets (PAA, RM), pp. 348–363.
LATA-2009-AbdullaDB #comparison #petri net: A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations (PAA, GD, LVB), pp. 71–82.
CAV-2008-AbdullaBCHR #abstraction #memory management #source code: Monotonic Abstraction for Programs with Dynamic Memory Heaps (PAA, AB, JC, FH, AR), pp. 341–354.
CIAA-2008-AbdullaBHKV #automaton #bisimulation: Composed Bisimulation for Tree Automata (PAA, AB, LH, LK, TV), pp. 212–222.
CIAA-J-2008-AbdullaBHKV09 #automaton #bisimulation: Composed Bisimulation for Tree Automata (PAA, AB, LH, LK, TV), pp. 685–700.
FoSSaCS-2008-AbdullaHAMS #game studies #probability: Stochastic Games with Lossy Channels (PAA, NBH, LdA, RM, SS), pp. 35–49.
TACAS-2008-AbdullaBHKV #automaton #simulation: Computing Simulations over Tree Automata (PAA, AB, LH, LK, TV), pp. 93–108.
VMCAI-2008-AbdullaHDR: Handling Parameterized Systems with Non-atomic Global Conditions (PAA, NBH, GD, AR), pp. 22–36.
CAV-2007-AbdullaDR #infinity #process #verification: Parameterized Verification of Infinite-State Processes with Global Conditions (PAA, GD, AR), pp. 145–157.
CSL-2007-AbdullaDB #power of: Comparing the Expressive Power of Well-Structured Transition Systems (PAA, GD, LVB), pp. 99–114.
FoSSaCS-2007-AbdullaKY #automaton: Sampled Universality of Timed Automata (PAA, PK, WY), pp. 2–16.
TACAS-2007-AbdullaDHR #model checking #performance #transducer #verification: Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems) (PAA, GD, NBH, AR), pp. 721–736.
CIAA-2006-AbdullaKH #automaton #bisimulation: Bisimulation Minimization of Tree Automata (PAA, LK, JH), pp. 173–185.
CIAA-J-2006-AbdullaHK07 #automaton #bisimulation: Bisimulation Minimization of Tree Automata (PAA, JH, LK), pp. 699–713.
CIAA-2005-AbdullaDKN #automaton #nondeterminism #scalability: Minimization of Non-deterministic Automata with Large Alphabets (PAA, JD, LK, MN), pp. 31–42.
ICALP-2005-AbdullaDOW #automaton #complexity #decidability: Decidability and Complexity Results for Timed Automata via Channel Machines (PAA, JD, JO, JW), pp. 1089–1101.
LICS-2005-AbdullaHM #finite #infinity #markov #verification: Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property (PAA, NBH, RM), pp. 127–136.
TACAS-2005-AbdullaLdR #transducer: Simulation-Based Iteration of Tree Transducers (PAA, AL, Jd, AR), pp. 30–44.
CAV-2004-AbdullaJNdS #ltl #model checking: Regular Model Checking for LTL(MSO) (PAA, BJ, MN, Jd, MS), pp. 348–360.
LICS-2004-AbdullaDM #multi #network: Multi-Clock Timed Networks (PAA, JD, PM), pp. 345–354.
CAV-2003-AbdullaJNd #algorithm #model checking: Algorithmic Improvements in Regular Model Checking (PAA, BJ, MN, Jd), pp. 236–248.
CSL-2003-AbdullaBd #game studies: Deciding Monotonic Games (PAA, AB, Jd), pp. 1–14.
FoSSaCS-2003-AbdullaR #communication #probability #verification: Verification of Probabilistic Systems with Faulty Communication (PAA, AMR), pp. 39–53.
CAV-2002-AbdullaJMd #model checking: Regular Tree Model Checking (PAA, BJ, PM, Jd), pp. 555–568.
ICALP-2001-AbdullaBB #effectiveness #queue: Effective Lossy Queue Languages (PAA, LB, AB), pp. 639–651.
CAV-2000-AbdullaIN #bound #petri net: Unfoldings of Unbounded Petri Nets (PAA, SPI, AN), pp. 495–507.
CAV-2000-AbdullaJ #infinity #tutorial #verification: Invited Tutorial: Verification of Infinite-State and Parameterized Systems (PAA, BJ), p. 4.
LICS-2000-AbdullaN #infinity #performance #verification: Better is Better than Well: On Efficient Verification of Infinite-State Systems (PAA, AN), pp. 132–140.
TACAS-2000-AbdullaBE #analysis #reachability: Symbolic Reachability Analysis Based on SAT-Solvers (PAA, PB, NE), pp. 411–425.
CAV-1999-AbdullaABBHL #abstraction #analysis #infinity #reachability #verification: Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis (PAA, AA, SB, AB, PH, YL), pp. 146–159.
CAV-1999-AbdullaBJN #verification: Handling Global Conditions in Parameterized System Verification (PAA, AB, BJ, MN), pp. 134–145.
TACAS-1999-AbdullaAB #bound #protocol #verification: Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol (PAA, AA, AB), pp. 208–222.
CAV-1998-AbdullaBJ #analysis #bound #on the fly: On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels (PAA, AB, BJ), pp. 305–318.
CAV-1998-AbdullaJKP #approach #partial order #reduction #verification: A General Approach to Partial Order Reductions in Symbolic Verification (PAA, BJ, MK, DP), pp. 379–390.
TACAS-1998-AbdullaJ #network #process #verification: Verifying Networks of Timed Processes (PAA, BJ), pp. 298–312.
LICS-1996-AbdullaCJT #decidability #infinity #theorem: General Decidability Theorems for Infinite-State Systems (PAA, KC, BJ, YKT), pp. 313–321.
ICALP-1994-AbdullaJ #decidability #problem #source code #verification: Undecidable Verification Problems for Programs with Unreliable Channels (PAA, BJ), pp. 316–327.
ESOP-2018-AbdullaJT #abstraction #analysis #concurrent: Fragment Abstraction for Concurrent Shape Analysis (PAA, BJ, CQT), pp. 442–471.
CAV-2016-AbdullaAJL #model checking: Stateless Model Checking for POWER (PAA, MFA, BJ, CL), pp. 134–156.
OOPSLA-2018-AbdullaAJN #model checking #semantics: Optimal stateless model checking under the release-acquire semantics (PAA, MFA, BJ, TPN), p. 29.
OOPSLA-2019-AbdullaAJLNS #consistency #equivalence #model checking: Optimal stateless model checking for reads-from equivalence under sequential consistency (PAA, MFA, BJ, ML, TPN, KS), p. 29.
PLDI-2017-AbdullaACDHRR #analysis #constraints #framework #performance #string: Flatten and conquer: a framework for efficient analysis of string constraints (PAA, MFA, YFC, BPD, LH, AR, PR), pp. 602–617.
PLDI-2019-AbdullaAAK #semantics #source code #verification: Verification of programs under the release-acquire semantics (PAA, JA0, MFA, SNK), pp. 1117–1132.
POPL-2020-AbdullaAR #verification: Parameterized verification under TSO is PSPACE-complete (PAA, MFA, RR), p. 29.