Author image not provided
 Sławomir Lasota

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article5.30
Citation Count175
Publication count33
Publication years1997-2015
Available for download5
Average downloads per article166.40
Downloads (cumulative)832
Downloads (12 Months)72
Downloads (6 Weeks)14
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


33 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 33
Result page: 1 2

Sort by:

1
July 2015 LICS '15: Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 2,   Downloads (12 Months): 10,   Downloads (Overall): 25

Full text available: PDFPDF

2
June 2015 International Journal on Software Tools for Technology Transfer (STTT): Volume 17 Issue 3, June 2015
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

In this paper we focus on the task of rating solutions to a programming exercise. State-of-the-art rating methods generally examine each solution against an exhaustive set of test cases, typically designed manually. Hence an issue of completeness arises. We propose the application of bounded model checking to the automatic generation ...
Keywords: Automatic rating, Test case generation, Program equivalence checking, Bounded model checking

3 published by ACM
July 2014 CSL-LICS '14: 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)
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2,   Downloads (12 Months): 5,   Downloads (Overall): 58

Full text available: PDFPDF
We study deterministic computability over sets with atoms. We characterize those alphabets for which Turing machines with atoms determinize. To this end, the determinization problem is expressed as a Constraint Satisfaction Problem, and a characterization is obtained from deep results in CSP theory. As an application to Descriptive Complexity Theory, ...
Keywords: Turing machines, descriptive complexity theory, constraint satisfaction problems, sets with atoms

4
July 2014 Theory of Computing Systems: Volume 55 Issue 1, July 2014
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

We investigate normed commutative context-free processes (Basic Parallel Processes). We show that branching bisimilarity admits the bounded response property : in the Bisimulation Game, Duplicator always has a response leading to a process of size linearly bounded with respect to the Spoiler's process. The linear bound is effective, which leads ...
Keywords: Basic parallel processes, Branching bisimulation equivalence, Commutative context-free graphs, Equivalence checking

5
June 2013 LICS '13: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 7,   Downloads (12 Months): 16,   Downloads (Overall): 71

Full text available: PDFPDF
We study Turing machines over sets with atoms, also known as nominal sets. Our main result is that deterministic machines are weaker than nondeterministic ones; in particular, P6=NP in sets with atoms. Our main construction is closely related to the Cai-Fürer-Immerman graphs used in descriptive complexity theory.
Keywords: Sets with atoms, Turing machines

6
September 2012 RP'12: Proceedings of the 6th international conference on Reachability Problems
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Fraenkel-Mostowski sets (FM sets) are a variant of set theory, where sets can contain atoms. The existence of atoms is postulated as an axiom. The key role in the theory of FM sets is played by permutations of atoms.

7
September 2012 CONCUR'12: Proceedings of the 23rd international conference on Concurrency Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

This paper is about reachability analysis in a restricted subclass of multi-pushdown automata: we assume that the control states of an automaton are partially ordered, and all transitions of an automaton go downwards with respect to the order. We prove decidability of the reachability problem, and computability of the backward ...

8
July 2012 ICALP'12: Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 9

We use a variant of Fraenkel-Mostowski sets (known also as nominal sets) as a framework suitable for stating and proving the following two results on timed automata. The first result is a machine-independent characterization of languages of deterministic timed automata. As a second result we define a class of automata, ...

9 published by ACM
January 2012 ACM SIGPLAN Notices - POPL '12: Volume 47 Issue 1, January 2012
Publisher: ACM
Bibliometrics:
Citation Count: 17
Downloads (6 Weeks): 2,   Downloads (12 Months): 27,   Downloads (Overall): 279

Full text available: PDFPDF
Nominal sets are a different kind of set theory, with a more relaxed notion of finiteness. They offer an elegant formalism for describing lambda-terms modulo alpha-conversion, or automata on data words. This paper is an attempt at defining computation in nominal sets. We present a rudimentary programming language, called Nlambda. ...
Keywords: automata on data words, lambda-calculus, nominal sets
Also published in:
January 2012  POPL '12: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

10
September 2011 CONCUR'11: Proceedings of the 22nd international conference on Concurrency theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

We investigate normed commutative context-free processes (Basic Parallel Processes). We show that branching bisimilarity admits the small response property: in the Bisimulation Game, Duplicator always has a response leading to a process of size linearly bounded with respect to the Spoiler's process. The linear bound is effective, which leads to ...

11
June 2011 LICS '11: Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 19

Our motivating question is a My hill-Nerode theorem for infinite alphabets. We consider several kinds of those: alphabets whose letters can be compared only for equality, but also ones with more structure, such as a total order or a partial order. We develop a framework for studying such alphabets, where ...
Keywords: automata theory, nominal sets, regisrer automatat, finite memory automata, data languages

12
May 2011 Information and Computation: Volume 209 Issue 5, May, 2011
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 2

Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent similarity between the two classes, different algorithmic techniques were used in each case. We provide one polynomial-time algorithm that works in a superclass of both normed BPA ...

13
July 2010 LICS '10: Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 7

We define a new kind of automata recognizing properties of data words or data trees and prove that the automata capture all queries definable in Regular XPath. We show that the automata-theoretic approach may be applied to answer decidability and expressibility questions for XPath. Finally, we use the newly introduced ...
Keywords: Regular XPath, data automata, register automata

14
January 2010 Information and Computation: Volume 208 Issue 1, January, 2010
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 1

We show polynomial time algorithms for deciding hereditary history preserving bisimilarity (in O(n^3logn)) and history preserving bisimilarity (in O(n^6)) on the class Basic Parallel Processes. The latter algorithm also decides a number of other non-interleaving behavioural equivalences (e.g., distributed bisimilarity) which are known to coincide with history preserving bisimilarity on ...
Keywords: Basic Parallel processes, Equivalence checking, History preserving bisimilarity, Non-interleaving equivalences, Bisimulation equivalence, Hereditary history preserving bisimilarity, Labelled event structures, Verification

15
September 2009 CONCUR 2009: Proceedings of the 20th International Conference on Concurrency Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent similarity between the two classes, different techniques were used in each case. We provide one polynomial-time algorithm that works in a superclass of both normed BPA and ...

16
July 2009 Electronic Notes in Theoretical Computer Science (ENTCS): Volume 239, July, 2009
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 6

We propose a decision procedure for a general class of normed commutative process rewrite systems and their induced bisimulation equivalences. Our technique is inspired by the polynomial-time algorithm for strong bisimilarity on normed Basic Parallel Processes (BPP), developed by Hirshfeld, Jerrum and Moller. As part of our framework we present ...
Keywords: branching bisimulation, distributed bisimulation, unique decomposition, Basic Parallel Processes, Bisimulation equivalence, weak bisimulation

17
July 2009 Information Processing Letters: Volume 109 Issue 15, July, 2009
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0

We investigate the simulation preorder between finite-state systems and a simple subclass of BPP-nets (communication-free nets). We show EXPSPACE lower bounds for the simulation problems, in both directions, as well as for the simulation equivalence. Our results improve PSPACE and co-NP lower bounds for the simulation between finite-state systems and ...
Keywords: Simulation preorder and equivalence, BPP-net, Concurrency, Petri net, Trace preorder and equivalence

18
December 2008 Mathematical Structures in Computer Science: Volume 18 Issue 6, December 2008
Publisher: Cambridge University Press
Bibliometrics:
Citation Count: 5

Logical relations and their generalisations are a fundamental tool in proving properties of lambda calculi, for example, for yielding sound principles for observational equivalence. We propose a natural notion of logical relations that is able to deal with the monadic types of Moggi's computational lambda calculus. The treatment is categorical, ...

19 published by ACM
April 2008 ACM Transactions on Computational Logic (TOCL): Volume 9 Issue 2, March 2008
Publisher: ACM
Bibliometrics:
Citation Count: 21
Downloads (6 Weeks): 1,   Downloads (12 Months): 7,   Downloads (Overall): 391

Full text available: PDFPDF
A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages that is closed under boolean operations and which has an effective presentation. We prove that the complexity ...
Keywords: Alternation, emptyness problem, timed automata

20
October 2007 Theoretical Computer Science: Volume 386 Issue 3, October 2007
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 3

Category theory has been successfully employed to structure the confusing set-up of models and equivalences for concurrency: Winskel and Nielsen have related the standard models via adjunctions and (co)reflections while Joyal et al. have defined an abstract notion of equivalence, known as open map bisimilarity. One model has not been ...
Keywords: Event structures, History preserving bisimulation, Causal trees



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us