default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWitold Charatonik
Person information
- affiliation: University of Wroclaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j10]Malgorzata Biernacka
, Witold Charatonik, Tomasz Drab:
A simple and efficient implementation of strong call by need by an abstract machine. Proc. ACM Program. Lang. 6(ICFP): 109-136 (2022)- [c39]Malgorzata Biernacka, Witold Charatonik, Tomasz Drab:
The Zoo of Lambda-Calculus Reduction Strategies, And Coq. ITP 2022: 7:1-7:19 - 2021
- [c38]Malgorzata Biernacka, Witold Charatonik, Tomasz Drab:
A Derived Reasonable Abstract Machine for Strong Call by Value. PPDP 2021: 6:1-6:14 - [i6]Malgorzata Biernacka, Witold Charatonik, Tomasz Drab:
Strong Call by Value is Reasonable for Time. CoRR abs/2102.05985 (2021) - 2020
- [c37]Malgorzata Biernacka, Dariusz Biernacki, Witold Charatonik, Tomasz Drab:
An Abstract Machine for Strong Call by Value. APLAS 2020: 147-166 - [i5]Malgorzata Biernacka, Dariusz Biernacki, Witold Charatonik, Tomasz Drab:
An Abstract Machine for Strong Call by Value. CoRR abs/2009.06984 (2020)
2010 – 2019
- 2019
- [c36]Malgorzata Biernacka, Witold Charatonik:
Deriving an Abstract Machine for Strong Call by Need. FSCD 2019: 8:1-8:20 - 2018
- [c35]Witold Charatonik, Yegor Guskov, Ian Pratt-Hartmann, Piotr Witkowski:
Two-variable First-Order Logic with Counting in Forests. LPAR 2018: 214-232 - 2017
- [c34]Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski:
Extending Two-Variable Logic on Trees. CSL 2017: 11:1-11:20 - [c33]Bartosz Bednarczyk, Witold Charatonik:
Modulo Counting on Words and Trees. FSTTCS 2017: 12:1-12:16 - [c32]Malgorzata Biernacka, Witold Charatonik, Klara Zielinska:
Generalized Refocusing: From Hybrid Strategies to Abstract Machines. FSCD 2017: 10:1-10:17 - [i4]Bartosz Bednarczyk, Witold Charatonik:
Modulo Counting on Words and Trees. CoRR abs/1710.05582 (2017) - 2016
- [j9]Witold Charatonik, Piotr Witkowski:
Two-variable Logic with Counting and a Linear Order. Log. Methods Comput. Sci. 12(2) (2016) - [j8]Witold Charatonik, Piotr Witkowski:
Two-Variable Logic with Counting and Trees. ACM Trans. Comput. Log. 17(4): 31 (2016) - [j7]Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell:
Complexity of Two-Variable Logic on Finite Trees. ACM Trans. Comput. Log. 17(4): 32 (2016) - [i3]Witold Charatonik, Piotr Witkowski:
Bounded Model Checking of Pointer Programs Revisited. CoRR abs/1602.09061 (2016) - [i2]Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski:
Extending Two-Variable Logic on Trees. CoRR abs/1611.02112 (2016) - 2015
- [c31]Witold Charatonik, Piotr Witkowski:
Two-variable Logic with Counting and a Linear Order. CSL 2015: 631-647 - 2014
- [c30]Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki:
Decidability of weak logics with deterministic transitive closure. CSL-LICS 2014: 29:1-29:10 - 2013
- [j6]Witold Charatonik, Agata Chorowska:
Parameterized complexity of basic decision problems for tree automata. Int. J. Comput. Math. 90(6): 1150-1170 (2013) - [c29]Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell:
Complexity of Two-Variable Logic on Finite Trees. ICALP (2) 2013: 74-88 - [c28]Witold Charatonik, Piotr Witkowski:
Two-Variable Logic with Counting and Trees. LICS 2013: 73-82 - [i1]Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki:
Satisfiability of the Two-Variable Fragment of First-Order Logic over Trees. CoRR abs/1304.7204 (2013) - 2011
- [c27]Agata Barecka, Witold Charatonik:
The Parameterized Complexity of Chosen Problems for Finite Automata on Trees. LATA 2011: 129-141 - 2010
- [j5]Witold Charatonik, Leszek Pacholski:
Set constraints with projections. J. ACM 57(4): 23:1-23:37 (2010) - [c26]Witold Charatonik, Piotr Witkowski:
On the Complexity of the Bernays-Schönfinkel Class with Datalog. LPAR (Yogyakarta) 2010: 187-201
2000 – 2009
- 2009
- [e1]Miroslaw Kutylowski, Witold Charatonik, Maciej Gebala:
Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings. Lecture Notes in Computer Science 5699, Springer 2009, ISBN 978-3-642-03408-4 [contents] - 2008
- [c25]Witold Charatonik, Michal Wrona:
Quantified Positive Temporal Constraints. CSL 2008: 94-108 - [c24]Witold Charatonik, Michal Wrona:
Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates. LPAR 2008: 543-557 - 2007
- [c23]Witold Charatonik, Michal Wrona:
2-SAT Problems in Some Multi-Valued Logics Based on Finite Lattices. ISMVL 2007: 21 - [c22]Witold Charatonik:
Regular directional types for logic programs. PPDP 2007: 209 - 2005
- [c21]Witold Charatonik, Lilia Georgieva, Patrick Maier:
Bounded Model Checking of Pointer Programs. CSL 2005: 397-412 - 2003
- [j4]Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot:
Model checking mobile ambients. Theor. Comput. Sci. 308(1-3): 277-331 (2003) - 2002
- [j3]Witold Charatonik, Andreas Podelski:
Set Constraints with Intersection. Inf. Comput. 179(2): 213-229 (2002) - [c20]Roberto M. Amadio, Witold Charatonik:
On Name Generation and Set-Based Analysis in the Dolev-Yao Model. CONCUR 2002: 499-514 - [c19]Witold Charatonik, Andrew D. Gordon, Jean-Marc Talbot:
Finite-Control Mobile Ambients. ESOP 2002: 295-313 - [c18]Witold Charatonik, Supratik Mukhopadhyay, Andreas Podelski:
Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP. ICLP 2002: 115-129 - [c17]Witold Charatonik, Jean-Marc Talbot:
Atomic Set Constraints with Projection. RTA 2002: 311-325 - [c16]Witold Charatonik, Supratik Mukhopadhyay, Andreas Podelski:
Compositional Termination Analysis of Symbolic Forward Analysis. VMCAI 2002: 109-125 - 2001
- [c15]Witold Charatonik, Jean-Marc Talbot:
The Decidability of Model Checking Mobile Ambients. CSL 2001: 339-354 - [c14]Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot:
The Complexity of Model Checking Mobile Ambients. FoSSaCS 2001: 152-167 - 2000
- [c13]Witold Charatonik:
Directional Type Checking for Logic Programs: Beyond Discriminative Types. ESOP 2000: 72-87 - [c12]Witold Charatonik, Andreas Podelski, Jean-Marc Talbot:
Paths vs. Trees in Set-Based Program Analysis. POPL 2000: 330-337
1990 – 1999
- 1999
- [c11]Andreas Podelski, Witold Charatonik, Martin Müller:
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs. ESOP 1999: 177-192 - 1998
- [j2]Witold Charatonik:
Set Constraints in Some Equational Theories. Inf. Comput. 142(1): 40-75 (1998) - [j1]Witold Charatonik:
An Undecidable Fragment of the Theory of Set Constraints. Inf. Process. Lett. 68(3): 147-151 (1998) - [c10]Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz:
The Horn Mu-calculus. LICS 1998: 58-69 - [c9]Witold Charatonik, Andreas Podelski:
Co-definite Set Constraints. RTA 1998: 211-225 - [c8]Witold Charatonik, Andreas Podelski:
Directional Type Inference for Logic Programs. SAS 1998: 278-294 - [c7]Witold Charatonik, Andreas Podelski:
Set-Based Analysis of Reactive Infinite-State Systems. TACAS 1998: 358-375 - 1997
- [c6]Witold Charatonik, Andreas Podelski:
Set Constraints with Intersection. LICS 1997: 362-372 - 1996
- [c5]Witold Charatonik, Andreas Podelski:
The Independence Property of a Class of Set Constraints. CP 1996: 76-90 - 1994
- [c4]Witold Charatonik:
Set Constraints in Some Equational Theories. CCL 1994: 304-319 - [c3]Witold Charatonik, Leszek Pacholski:
Set constraints with projections are in NEXPTIME. FOCS 1994: 642-653 - [c2]Witold Charatonik, Leszek Pacholski:
Negative Set Constraints with Equality. LICS 1994: 128-136 - 1991
- [c1]Witold Charatonik, Leszek Pacholski:
Word Equations with Two Variables. IWWERT 1991: 43-56
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
