Witold Charatonik

According to our database1, Witold Charatonik authored at least 49 papers between 1991 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Deriving an Abstract Machine for Strong Call by Need.
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

2018
Two-variable First-Order Logic with Counting in Forests.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

2017
Modulo Counting on Words and Trees.
CoRR, 2017

Generalized Refocusing: From Hybrid Strategies to Abstract Machines.
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

Modulo Counting on Words and Trees.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Extending Two-Variable Logic on Trees.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016
Two-Variable Logic with Counting and Trees.
ACM Trans. Comput. Log., 2016

Complexity of Two-Variable Logic on Finite Trees.
ACM Trans. Comput. Log., 2016

Two-variable Logic with Counting and a Linear Order.
Logical Methods in Computer Science, 2016

Bounded Model Checking of Pointer Programs Revisited.
CoRR, 2016

Extending Two-Variable Logic on Trees.
CoRR, 2016

2015
Two-variable Logic with Counting and a Linear Order.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014
Decidability of weak logics with deterministic transitive closure.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Parameterized complexity of basic decision problems for tree automata.
Int. J. Comput. Math., 2013

Satisfiability of the Two-Variable Fragment of First-Order Logic over Trees
CoRR, 2013

Two-Variable Logic with Counting and Trees.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Complexity of Two-Variable Logic on Finite Trees.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2011
The Parameterized Complexity of Chosen Problems for Finite Automata on Trees.
Proceedings of the Language and Automata Theory and Applications, 2011

2010
Set constraints with projections.
J. ACM, 2010

On the Complexity of the Bernays-Schönfinkel Class with Datalog.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2008
Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates.
Proceedings of the Logic for Programming, 2008

Quantified Positive Temporal Constraints.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007
Regular directional types for logic programs.
Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2007

2-SAT Problems in Some Multi-Valued Logics Based on Finite Lattices.
Proceedings of the 37th International Symposium on Multiple-Valued Logic, 2007

2005
Bounded Model Checking of Pointer Programs.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2003
Model checking mobile ambients.
Theor. Comput. Sci., 2003

2002
Set Constraints with Intersection.
Inf. Comput., 2002

Compositional Termination Analysis of Symbolic Forward Analysis.
Proceedings of the Verification, 2002

Atomic Set Constraints with Projection.
Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP.
Proceedings of the Logic Programming, 18th International Conference, 2002

Finite-Control Mobile Ambients.
Proceedings of the Programming Languages and Systems, 2002

On Name Generation and Set-Based Analysis in the Dolev-Yao Model.
Proceedings of the CONCUR 2002, 2002

2001
The Complexity of Model Checking Mobile Ambients.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

The Decidability of Model Checking Mobile Ambients.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000
Paths vs. Trees in Set-Based Program Analysis.
Proceedings of the POPL 2000, 2000

Directional Type Checking for Logic Programs: Beyond Discriminative Types.
Proceedings of the Programming Languages and Systems, 2000

1999
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs.
Proceedings of the Programming Languages and Systems, 1999

1998
An Undecidable Fragment of the Theory of Set Constraints.
Inf. Process. Lett., 1998

Set Constraints in Some Equational Theories.
Inf. Comput., 1998

Set-Based Analysis of Reactive Infinite-State Systems.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1998

Directional Type Inference for Logic Programs.
Proceedings of the Static Analysis, 5th International Symposium, 1998

Co-definite Set Constraints.
Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

The Horn Mu-calculus.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997
Set Constraints with Intersection.
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

1996
The Independence Property of a Class of Set Constraints.
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

1994
Negative Set Constraints with Equality
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

Set constraints with projections are in NEXPTIME
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Set Constraints in Some Equational Theories.
Proceedings of the Constraints in Computational Logics, First International Conference, 1994

1991
Word Equations with Two Variables.
Proceedings of the Word Equations and Related Topics, Second International Workshop, 1991


  Loading...