Witold Charatonik

57 papers A* 6A 5B 17C 3Journal 17Unranked 9
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Simple and Efficient Implementation of Strong Call by Need by an Abstract Machine.
CoRR
Malgorzata Biernacka, Witold Charatonik, Tomasz Drab
2022 J jnl
A simple and efficient implementation of strong call by need by an abstract machine.
Proc. ACM Program. Lang.
Malgorzata Biernacka, Witold Charatonik, Tomasz Drab
2022 B conf
The Zoo of Lambda-Calculus Reduction Strategies, And Coq.
ITP
Malgorzata Biernacka, Witold Charatonik, Tomasz Drab
2021 C conf
A Derived Reasonable Abstract Machine for Strong Call by Value.
PPDP
Malgorzata Biernacka, Witold Charatonik, Tomasz Drab
2021 J jnl
Strong Call by Value is Reasonable for Time.
CoRR
Malgorzata Biernacka, Witold Charatonik, Tomasz Drab
2020 B conf
An Abstract Machine for Strong Call by Value.
APLAS
Malgorzata Biernacka, Dariusz Biernacki, Witold Charatonik, Tomasz Drab
2020 J jnl
An Abstract Machine for Strong Call by Value.
CoRR
Malgorzata Biernacka, Dariusz Biernacki, Witold Charatonik, Tomasz Drab
2019 B conf
Deriving an Abstract Machine for Strong Call by Need.
FSCD
Malgorzata Biernacka, Witold Charatonik
2018 B conf
Two-variable First-Order Logic with Counting in Forests.
LPAR
Witold Charatonik, Yegor Guskov, Ian Pratt-Hartmann, Piotr Witkowski
2017 B conf
Extending Two-Variable Logic on Trees.
CSL
Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski
2017 B conf
Generalized Refocusing: From Hybrid Strategies to Abstract Machines.
FSCD
Malgorzata Biernacka, Witold Charatonik, Klara Zielinska
2017 — conf
Modulo Counting on Words and Trees.
FSTTCS
Bartosz Bednarczyk, Witold Charatonik
2017 J jnl
Modulo Counting on Words and Trees.
CoRR
Bartosz Bednarczyk, Witold Charatonik
2016 J jnl
Bounded Model Checking of Pointer Programs Revisited.
CoRR
Witold Charatonik, Piotr Witkowski
2016 J jnl
Complexity of Two-Variable Logic on Finite Trees.
ACM Trans. Comput. Log.
Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell
2016 J jnl
Extending Two-Variable Logic on Trees.
CoRR
Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski
2016 J jnl
Two-Variable Logic with Counting and Trees.
ACM Trans. Comput. Log.
Witold Charatonik, Piotr Witkowski
2016 J jnl
Two-variable Logic with Counting and a Linear Order.
Log. Methods Comput. Sci.
Witold Charatonik, Piotr Witkowski
2015 B conf
Two-variable Logic with Counting and a Linear Order.
CSL
Witold Charatonik, Piotr Witkowski
2014 — conf
Decidability of weak logics with deterministic transitive closure.
CSL-LICS
Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki
2013 — conf
Complexity of Two-Variable Logic on Finite Trees.
ICALP (2)
Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell
2013 J jnl
Parameterized complexity of basic decision problems for tree automata.
Int. J. Comput. Math.
Witold Charatonik, Agata Chorowska
2013 J jnl
Satisfiability of the Two-Variable Fragment of First-Order Logic over Trees
CoRR
Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki
2013 A* conf
Two-Variable Logic with Counting and Trees.
LICS
Witold Charatonik, Piotr Witkowski
2011 C conf
The Parameterized Complexity of Chosen Problems for Finite Automata on Trees.
LATA
Agata Barecka, Witold Charatonik
2010 — conf
On the Complexity of the Bernays-Schönfinkel Class with Datalog.
LPAR (Yogyakarta)
Witold Charatonik, Piotr Witkowski
2010 J jnl
Set constraints with projections.
J. ACM
Witold Charatonik, Leszek Pacholski
2009 B ed.
Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings
FCT
Miroslaw Kutylowski, Witold Charatonik, Maciej Gebala
2008 B conf
Quantified Positive Temporal Constraints.
CSL
Witold Charatonik, Michal Wrona
2008 B conf
Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates.
LPAR
Witold Charatonik, Michal Wrona
2007 — conf
2-SAT Problems in Some Multi-Valued Logics Based on Finite Lattices.
ISMVL
Witold Charatonik, Michal Wrona
2007 C conf
Regular directional types for logic programs.
PPDP
Witold Charatonik
2005 B conf
Bounded Model Checking of Pointer Programs.
CSL
Witold Charatonik, Lilia Georgieva, Patrick Maier
2003 J jnl
Model checking mobile ambients.
Theor. Comput. Sci.
Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot
2002 — conf
Atomic Set Constraints with Projection.
RTA
Witold Charatonik, Jean-Marc Talbot
2002 B conf
Compositional Termination Analysis of Symbolic Forward Analysis.
VMCAI
Witold Charatonik, Supratik Mukhopadhyay, Andreas Podelski
2002 B conf
Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP.
ICLP
Witold Charatonik, Supratik Mukhopadhyay, Andreas Podelski
2002 A conf
Finite-Control Mobile Ambients.
ESOP
Witold Charatonik, Andrew D. Gordon, Jean-Marc Talbot
2002 B conf
On Name Generation and Set-Based Analysis in the Dolev-Yao Model.
CONCUR
Roberto M. Amadio, Witold Charatonik
2002 J jnl
Set Constraints with Intersection.
Inf. Comput.
Witold Charatonik, Andreas Podelski
2001 B conf
The Complexity of Model Checking Mobile Ambients.
FoSSaCS
Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot
2001 B conf
The Decidability of Model Checking Mobile Ambients.
CSL
Witold Charatonik, Jean-Marc Talbot
2000 A conf
Directional Type Checking for Logic Programs: Beyond Discriminative Types.
ESOP
Witold Charatonik
2000 A* conf
Paths vs. Trees in Set-Based Program Analysis.
POPL
Witold Charatonik, Andreas Podelski, Jean-Marc Talbot
1999 A conf
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs.
ESOP
Andreas Podelski, Witold Charatonik, Martin Müller
1998 J jnl
An Undecidable Fragment of the Theory of Set Constraints.
Inf. Process. Lett.
Witold Charatonik
1998 — conf
Co-definite Set Constraints.
RTA
Witold Charatonik, Andreas Podelski
1998 B conf
Directional Type Inference for Logic Programs.
SAS
Witold Charatonik, Andreas Podelski
1998 J jnl
Set Constraints in Some Equational Theories.
Inf. Comput.
Witold Charatonik
1998 A conf
Set-Based Analysis of Reactive Infinite-State Systems.
TACAS
Witold Charatonik, Andreas Podelski
1998 A* conf
The Horn Mu-calculus.
LICS
Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz
1997 A* conf
Set Constraints with Intersection.
LICS
Witold Charatonik, Andreas Podelski
1996 A conf
The Independence Property of a Class of Set Constraints.
CP
Witold Charatonik, Andreas Podelski
1994 A* conf
Negative Set Constraints with Equality
LICS
Witold Charatonik, Leszek Pacholski
1994 — conf
Set Constraints in Some Equational Theories.
CCL
Witold Charatonik
1994 A* conf
Set constraints with projections are in NEXPTIME
FOCS
Witold Charatonik, Leszek Pacholski
1991 — conf
Word Equations with Two Variables.
IWWERT
Witold Charatonik, Leszek Pacholski