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 × Austria
1 × Croatia
1 × Denmark
1 × Finland
1 × France
1 × Germany
1 × Greece
1 × Hungary
1 × Italy
1 × Latvia
1 × New Zealand
1 × Poland
1 × Russia
1 × Switzerland
1 × The Netherlands
2 × Portugal
3 × United Kingdom
4 × USA
Collaborated with:
∅ A.Muscholl S.Salvati F.Herbreteau B.Srivathsan A.S.Murawski B.Genest H.Gimbert P.Parys S.Lasota E.Grädel P.S.Thiagarajan D.Niwinski M.Bojanczyk H.Straubing C.L.Ong S.Dziembowski M.Jurdzinski M.Fortin T.Knapik P.Urzyczyn W.Charatonik D.A.McAllester A.Podelski
Talks about:
automata (7) time (7) model (5) properti (4) complet (4) check (4) game (4) asynchron (3) order (3) logic (3)

Person: Igor Walukiewicz

DBLP DBLP: Walukiewicz:Igor

Facilitated 4 volumes:

ICALP (1) 2008Ed
ICALP (2) 2008Ed
ICALP (2) 2008Ed
FoSSaCS 2004Ed

Contributed to:

CSL 20152015
FoSSaCS 20152015
CAV 20132013
ICALP (2) 20132013
TLCA 20132013
LICS 20122012
ICALP (2) 20112011
CAV 20102010
ICALP (2) 20102010
ICALP (2) 20092009
LICS 20092009
FoSSaCS 20082008
FoSSaCS 20072007
FoSSaCS 20052005
ICALP 20052005
DLT 20042004
DLT 20042005
LICS 20042004
CSL 20032003
LICS 19991999
ICALP 19981998
LICS 19981998
LICS 19971997
CAV 19961996
LICS 19951995
CAV (2) 20172017

Wrote 29 papers:

CSL-2015-SalvatiW #behaviour #higher-order #source code
A Model for Behavioural Properties of Higher-order Programs (SS, IW), pp. 229–243.
FoSSaCS-2015-SalvatiW #type system
Typing Weak MSOL Properties (SS, IW), pp. 343–357.
CAV-2013-HerbreteauSW #abstraction #automaton #lazy evaluation
Lazy Abstractions for Timed Automata (FH, BS, IW), pp. 990–1005.
ICALP-v2-2013-GenestGMW #architecture #game studies
Asynchronous Games over Tree Architectures (BG, HG, AM, IW), pp. 275–286.
TLCA-2013-SalvatiW #modelling #recursion #using
Using Models to Model-Check Recursive Schemes (SS, IW), pp. 189–204.
LICS-2012-HerbreteauSW #abstraction #automaton
Better Abstractions for Timed Automata (FH, BS, IW), pp. 375–384.
ICALP-v2-2011-SalvatiW #higher-order
Krivine Machines and Higher-Order Schemes (SS, IW), pp. 162–173.
CAV-2010-HerbreteauSW #automaton #performance
Efficient Emptiness Check for Timed Büchi Automata (FH, BS, IW), pp. 148–161.
ICALP-v2-2010-GenestGMW #automaton
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata (BG, HG, AM, IW), pp. 52–63.
ICALP-v2-2009-ParysW #automaton
Weak Alternating Timed Automata (PP, IW), pp. 273–284.
LICS-2009-BojanczykSW #algebra #logic
Wreath Products of Forest Algebras, with Applications to Tree Logics (MB, HS, IW), pp. 255–263.
FoSSaCS-2008-Walukiewicz
Finding Your Way in a Forest: On Different Types of Trees and Their Properties (IW), pp. 1–4.
FoSSaCS-2007-MuschollW #bound #composition #web #web service
A Lower Bound on Web Services Composition (AM, IW), pp. 274–286.
FoSSaCS-2005-LasotaW #automaton
Alternating Timed Automata (SL, IW), pp. 250–265.
FoSSaCS-2005-MurawskiW #algol #decidability #higher-order
Third-Order Idealized Algol with Iteration Is Decidable (ASM, IW), pp. 202–218.
ICALP-2005-KnapikNUW #automaton
Unsafe Grammars and Panic Automata (TK, DN, PU, IW), pp. 1450–1461.
ICALP-2005-MurawskiOW #algol #equivalence #recursion
Idealized Algol with Ground Recursion, and DPDA Equivalence (ASM, CHLO, IW), pp. 917–929.
DLT-2004-MuschollW #ltl
An NP-Complete Fragment of LTL (AM, IW), pp. 334–344.
DLT-J-2004-MuschollW05 #ltl
An NP-complete fragment of LTL (AM, IW), pp. 743–753.
LICS-2004-Walukiewicz #game studies
A Landscape with Games in the Backgroun (IW), pp. 356–366.
CSL-2003-Walukiewicz #synthesis
Winning Strategies and Synthesis of Controllers (IW), p. 574.
LICS-1999-GradelW #fixpoint #logic
Guarded Fixed Point Logic (EG, IW), pp. 45–54.
ICALP-1998-Walukiewicz #complexity
Difficult Configurations — On the Complexity of LTrL (IW), pp. 140–151.
LICS-1998-CharatonikMNPW #calculus #μ-calculus
The Horn μ-calculus (WC, DAM, DN, AP, IW), pp. 58–69.
LICS-1997-DziembowskiJW #game studies #how #infinity #memory management #question
How Much Memory is Needed to Win Infinite Games? (SD, MJ, IW), pp. 99–110.
LICS-1997-ThiagarajanW #linear #logic
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces (PST, IW), pp. 183–194.
CAV-1996-Walukiewicz #automaton #game studies #model checking #process
Pushdown Processes: Games and Model Checking (IW), pp. 62–74.
LICS-1995-Walukiewicz #axiom #calculus #μ-calculus
Completeness of Kozen’s Axiomatisation of the Propositional μ-Calculus (IW), pp. 14–24.
CAV-2017-FortinMW #automaton #linear #model checking
Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems (MF, AM, IW), pp. 155–175.
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.