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 × Japan
1 × Latvia
1 × Portugal
1 × Spain
1 × The Netherlands
1 × United Kingdom
2 × Denmark
2 × Germany
2 × Poland
3 × France
3 × USA
4 × Italy
Collaborated with:
A.Podelski J.Talbot P.Witkowski S.Mukhopadhyay E.Kieronski A.D.Gordon A.Barecka M.Wrona L.Pacholski F.Mazowiecki L.Georgieva P.Maier M.Müller B.Bednarczyk S.Dal-Zilio D.A.McAllester D.Niwinski I.Walukiewicz S.Benaim M.Benedikt R.Lenhardt J.Worrell
Talks about:
logic (9) constraint (7) program (7) set (7) analysi (5) check (5) tree (5) variabl (4) model (4) type (4)

Person: Witold Charatonik

DBLP DBLP: Charatonik:Witold

Contributed to:

CSL 20152015
CSL-LICS 20142014
ICALP (2) 20132013
LICS 20132013
LATA 20112011
CSL 20082008
PPDP 20072007
CSL 20052005
ESOP 20022002
ICLP 20022002
RTA 20022002
VMCAI 20022002
CSL 20012001
FoSSaCS 20012001
ESOP 20002000
POPL 20002000
ESOP 19991999
LICS 19981998
RTA 19981998
SAS 19981998
TACAS 19981998
LICS 19971997
LICS 19941994
CSL 20172017

Wrote 24 papers:

CSL-2015-Charatonik0 #linear #logic #order
Two-variable Logic with Counting and a Linear Order (WC, PW), pp. 631–647.
LICS-CSL-2014-CharatonikKM #decidability #logic #transitive
Decidability of weak logics with deterministic transitive closure (WC, EK, FM), p. 10.
ICALP-v2-2013-BenaimBCKLMW #complexity #finite #logic
Complexity of Two-Variable Logic on Finite Trees (SB, MB, WC, EK, RL, FM, JW), pp. 74–88.
LICS-2013-CharatonikW #logic
Two-Variable Logic with Counting and Trees (WC, PW), pp. 73–82.
LATA-2011-BareckaC #automaton #complexity #finite #problem
The Parameterized Complexity of Chosen Problems for Finite Automata on Trees (AB, WC), pp. 129–141.
CSL-2008-CharatonikW #constraints #quantifier
Quantified Positive Temporal Constraints (WC, MW), pp. 94–108.
PPDP-2007-Charatonik #logic programming #source code
Regular directional types for logic programs (WC), p. 209.
CSL-2005-CharatonikGM #bound #model checking #pointer #source code
Bounded Model Checking of Pointer Programs (WC, LG, PM), pp. 397–412.
ESOP-2002-CharatonikGT #mobile
Finite-Control Mobile Ambients (WC, ADG, JMT), pp. 295–313.
ICLP-2002-CharatonikMP #constraints #infinity #model checking
Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP (WC, SM, AP), pp. 115–129.
RTA-2002-CharatonikT #constraints #set
Atomic Set Constraints with Projection (WC, JMT), pp. 311–325.
VMCAI-2002-CharatonikMP #analysis #composition #termination
Compositional Termination Analysis of Symbolic Forward Analysis (WC, SM, AP), pp. 109–125.
CSL-2001-CharatonikT #decidability #mobile #model checking
The Decidability of Model Checking Mobile Ambients (WC, JMT), pp. 339–354.
FoSSaCS-2001-CharatonikDGMT #complexity #mobile #model checking
The Complexity of Model Checking Mobile Ambients (WC, SDZ, ADG, SM, JMT), pp. 152–167.
ESOP-2000-Charatonik #logic programming #source code #type checking
Directional Type Checking for Logic Programs: Beyond Discriminative Types (WC), pp. 72–87.
POPL-2000-CharatonikPT #program analysis
Paths vs. Trees in Set-Based Program Analysis (WC, AP, JMT), pp. 330–337.
ESOP-1999-PodelskiCM #analysis #concurrent #constraints #logic programming #source code
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs (AP, WC, MM), pp. 177–192.
LICS-1998-CharatonikMNPW #calculus #μ-calculus
The Horn μ-calculus (WC, DAM, DN, AP, IW), pp. 58–69.
RTA-1998-CharatonikP #constraints #set
Co-definite Set Constraints (WC, AP), pp. 211–225.
SAS-1998-CharatonikP #logic programming #source code #type inference
Directional Type Inference for Logic Programs (WC, AP), pp. 278–294.
TACAS-1998-CharatonikP #analysis #infinity
Set-Based Analysis of Reactive Infinite-State Systems (WC, AP), pp. 358–375.
LICS-1997-CharatonikP #constraints #set
Set Constraints with Intersection (WC, AP), pp. 362–372.
LICS-1994-CharatonikP #constraints #set #similarity
Negative Set Constraints with Equality (WC, LP), pp. 128–136.
CSL-2017-BednarczykCK #logic
Extending Two-Variable Logic on Trees (BB, WC, EK), p. 20.

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.