BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Czech Republic
1 × France
1 × Greece
1 × Iceland
1 × Ireland
1 × Japan
1 × Latvia
1 × Russia
1 × Switzerland
2 × Italy
2 × Poland
2 × Portugal
2 × Spain
2 × United Kingdom
5 × USA
Collaborated with:
M.Yannakakis R.Alur A.Stewart T.Wilke D.Wojtczak N.Immerman M.Y.Vardi P.Madhusudan P.Godefroid R.A.Schuller M.H.Smith G.J.Holzmann T.Brázdil V.Brozek A.Kucera M.Z.Kwiatkowska S.Chaudhuri S.L.Torre D.Peled M.Arenas P.Barceló L.Libkin
Talks about:
recurs (9) logic (8) stochast (6) tempor (6) game (6) probabilist (5) polynomi (5) process (5) state (5) algorithm (4)

Person: Kousha Etessami

DBLP DBLP: Etessami:Kousha

Facilitated 1 volumes:

CAV 2005Ed

Contributed to:

ICALP (2) 20152015
CAV 20132013
ICALP (2) 20132013
LATA 20132013
ICALP (1) 20122012
STOC 20122012
ICALP (2) 20112011
VMCAI 20092009
ICALP (1) 20082008
LICS 20072007
TACAS 20072007
ICALP (2) 20062006
ICALP 20052005
TACAS 20052005
TACAS 20042004
VMCAI 20042004
CAV 20012001
ICALP 20012001
RE 20012001
ICSE 20002000
CAV 19991999
ICALP 19991999
PODS 19981998
LICS 19971997
LICS 19961996
LICS 19951995

Wrote 29 papers:

ICALP-v2-2015-EtessamiSY #branch #equation #fixpoint #markov #polynomial #probability #process #reachability
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes (KE, AS, MY), pp. 184–196.
CAV-2013-StewartEY #automaton #bound #model checking #polynomial #probability
Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata (AS, KE, MY), pp. 495–510.
ICALP-v2-2013-EtessamiSY #context-free grammar #probability #regular expression
Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method (KE, AS, MY), pp. 199–211.
LATA-2013-Etessami #algorithm #infinity #probability #recursion #verification
Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems (KE), p. 12.
ICALP-v1-2012-EtessamiSY #algorithm #branch #equation #markov #polynomial #probability #process
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (KE, AS, MY), pp. 314–326.
STOC-2012-EtessamiSY #algorithm #branch #context-free grammar #multi #polynomial #probability #process
Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars (KE, AS, MY), pp. 579–588.
ICALP-v2-2011-BrazdilBEK #approximate #game studies #probability #termination
Approximating the Termination Value of One-Counter MDPs and Stochastic Games (TB, VB, KE, AK), pp. 332–343.
VMCAI-2009-EtessamiG #programming #transaction
An Abort-Aware Model of Transactional Programming (KE, PG), pp. 59–73.
ICALP-A-2008-EtessamiWY #game studies #probability #recursion
Recursive Stochastic Games with Positive Rewards (KE, DW, MY), pp. 711–723.
LICS-2007-AlurABEIL #first-order #logic #word
First-Order and Temporal Logics for Nested Words (RA, MA, PB, KE, NI, LL), pp. 151–160.
TACAS-2007-EtessamiKVY #markov #model checking #multi #process
Multi-objective Model Checking of Markov Decision Processes (KE, MZK, MYV, MY), pp. 50–65.
TACAS-2007-WojtczakE
PReMo : An Analyzer for P robabilistic Re cursive Mo dels (DW, KE), pp. 66–71.
ICALP-v2-2006-EtessamiY #concurrent #game studies #probability #recursion
Recursive Concurrent Stochastic Games (KE, MY), pp. 324–335.
ICALP-2005-EtessamiY #game studies #markov #probability #process #recursion
Recursive Markov Decision Processes and Recursive Stochastic Games (KE, MY), pp. 891–903.
TACAS-2005-AlurCEM #detection #on the fly #reachability #recursion #state machine
On-the-Fly Reachability and Cycle Detection for Recursive State Machines (RA, SC, KE, PM), pp. 61–76.
TACAS-2005-EtessamiY #algorithm #probability #recursion #state machine #verification
Algorithmic Verification of Recursive Probabilistic State Machines (KE, MY), pp. 253–270.
TACAS-2004-AlurEM #logic
A Temporal Logic of Nested Calls and Returns (RA, KE, PM), pp. 467–481.
VMCAI-2004-Etessami #analysis #data flow #equation #game studies #graph #recursion #using
Analysis of Recursive Game Graphs Using Data Flow Equations (KE), pp. 282–296.
CAV-2001-AlurEY #analysis #recursion #state machine
Analysis of Recursive State Machines (RA, KE, MY), pp. 207–220.
ICALP-2001-AlurEY #graph #verification
Realizability and Verification of MSC Graphs (RA, KE, MY), pp. 797–808.
ICALP-2001-EtessamiWS #automaton #game studies #reduction #simulation
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata (KE, TW, RAS), pp. 694–707.
RE-2001-SmithHE #constraints #editing #logic #requirements #source code #visual notation
Events and Constraints: A Graphical Editor for Capturing Logic Requirements of Programs (MHS, GJH, KE), pp. 14–22.
ICSE-2000-AlurEY #sequence chart
Inference of message sequence charts (RA, KE, MY), pp. 304–313.
CAV-1999-Etessami #automaton #invariant #logic
Stutter-Invariant Languages, ω-Automata, and Temporal Logic (KE), pp. 236–248.
ICALP-1999-AlurTEP #logic #parametricity
Parametric Temporal Logic for “Model Measuring” (RA, KE, SLT, DP), pp. 159–168.
PODS-1998-Etessami #first-order #morphism
Dynamic Tree Isomorphism via First-Order Updates (KE), pp. 235–243.
LICS-1997-EtessamiVW #first-order #logic
First-Order Logic with Two Variables and Unary Temporal Logic (KE, MYV, TW), pp. 228–235.
LICS-1996-EtessamiW #logic
An Until Hierarchy for Temporal Logic (KE, TW), pp. 108–117.
LICS-1995-EtessamiI #transitive
Tree Canonization and Transitive Closure (KE, NI), pp. 331–341.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.