Jarkko Kari, Irek Ulidowski. Proceedings of Reversible Computation - 10th International
Conference, RC 2018, Leicester, UK, September 12-14, 2018. LNCS, volume 11106.
Springer, 2018.
Irek Ulidowski, Iain Phillips and Shoji Yuen. Reversing Event Structures.
New Generation Computing 36(3), 281-306. 2018.
doi:10.1007/s00354-018-0040-8.
James Hoey, Irek Ulidowski, Shoji Yuen.
Reversing Imperative Programs with Blocks and Procedures.
Proceedings Combined 25th International Workshop on Expressiveness
in Concurrency and 15th Workshop on Structural Operational Semantics,
EXPRESS/SOS 2018.
EPTCS, volume 276, 2018, pp. 69--86.
doi:10.4204/EPTCS.276.7.
Stefan Kuhn, Irek Ulidowski.
Local reversibility in a Calculus of Covalent Bonding. Journal of Science of
Computer Programming 151:18-47. 2018
James Hoey, Irek Ulidowski, Shoji Yuen.
Reversing Imperative Parallel Programs.
Proceedings Combined 24th International Workshop on Expressiveness
in Concurrency and 14th Workshop on Structural Operational Semantics,
EXPRESS/SOS 2017.
EPTCS, volume 255, 2017, pp. 51--66.
doi:10.4204/EPTCS.255.4.
Daniel Morrison and Irek Ulidowski, Direction-reversible self-timed cellular automata for
Delay-Insensitive circuits. Journal of Cellular Automata 12(1-2):101-120. 2016.
Stefan Kuhn and Irek Ulidowski, A calculus for local reversibility. Proceedings, Reversible Computation 2016, LNCS 9720, pp. 20-35. Springer 2016.
doi:10.1017/10.1007/978-3-319-40578-0_2
Iain Phillips and Irek Ulidowski,
Reversibility and asymmetric conflict in event structures.
Journal of Logical and Algebraic Methods in Programming. 2015.
doi:10.1016/j.jlamp.2015.07.004
Stefan Kuhn and Irek Ulidowski, Towards Modelling of Local Reversibility.
Proceedings, Reversible Computation 2015, LNCS 9138, pp. 279-284. Springer 2015.
Daniel Morrison and Irek Ulidowski, Direction-reversible self-timed cellular automata for
Delay-Insensitive circuits. Proceedings, ACRI 2014, LNCS, pp. 367-377. Springer 2014.
Irek Ulidowski, Iain Phillips and Shoji Yuen, Concurrency and reversibility.
Proceedings, Reversible Computation 2014, LNCS 8507, pp. 1-14. Springer 2014.
Daniel Morrison and Irek Ulidowski, Arbitration and reversibility of parallel Delay-Insensitive
modules. Proceedings, Reversible Computation 2014, LNCS 8507, pp. 67-81. Springer 2014.
Iain Phillips and Irek Ulidowski,
An Event Identifier Logic.
Mathematical Structures in Computer Science. 2014.
doi:10.1017/S0960129513000510
Iain Phillips and Irek Ulidowski,
Reversibility and asymmetric conflict in event structures.
Proceedings of CONCUR 2013, LNCS, volume 8052, pp. 303-318.
Springer, 2013.
doi:10.1007/978-3-642-40184-8_22
Iain Phillips, Irek Ulidowski and Shoji Yuen,
Modelling of bonding with processes and events.
Proceedings, Reversible Computation 2013,
LNCS, volume 7948, pp. 141-154. Springer, 2013.
Daniel Morrison and Irek Ulidowski,
Reversible delay-insensitive ditsributed memory modules.
Proceedings, Reversible Computation 2013, LNCS, volume 7948, pp. 11-24. Springer, 2013.
Maciej Koutny and Irek Ulidowski. Proceedings of the 23rd International Conference on
Concurrency Theory CONCUR 2012. LNCS, volume 7454. Springer, 2012.
Iain Phillips and Irek Ulidowski,
A Hierarchy of Reverse Bisimulations on Stable Configuration Structures.
Mathematical Structures in Computer Science,
22, pp 333-372, 2012. doi:
10.1017/S0960129511000429.
Rolf Drechsler, Irek Ulidowski and Robert Wille, Special Issue on Reversible Computation.
Multiple-Valued Logic and Soft Computing (MVL) 18(1), 2012.
Iain Phillips and Irek Ulidowski,
A Logic with Reverse Modalities for Hierarchy-preserving Bisimulations.
Proceedings, 18th International Workshop on
Expressiveness of Concurrency, EXPRESS'11, Aachen, Germany, September 2011.
EPTCS, volume 64, 2011, pp. 104-118.
doi:10.4204/EPTCS.64.8.
Irek Ulidowski,
Proceedings of the 1st Workshop on Reversible Computation
(RC 2009). ENTCS 253(6), 2010.
I. Phillips and I. Ulidowski,
Reverse Bisimulations on Stable Configuration Structures.
Proceedings of the 6th Workshop on Structural Operational Semantics
(SOS 2009).
EPTCS, volume 18, 2010, pp. 62-76.
doi:10.4204/EPTCS.18.5.
2017
Irek Ulidowski and Shoji Yuen,
Generating priority rewrite systems for OSOS process languages.
Information and Computation 207(2), pp 120-145, 2009.
doi:
10.1016/j.ic.2008.10.002.
Mohammad Reza Mousavi, Iain Phillips, Michel A. Reniers, Irek Ulidowski,
Semantics and expressiveness of Ordered SOS.
Information and Computation, 207(2), pp 85-119, 2009.
doi:
10.1016/j.ic.2007.11.008.
M. Mousavi , I. Phillips, M.A. Reniers and I. Ulidowski,
The Meaning of Ordered SOS.
In S. Arun-Kumar and Naveen Garg, editors,
Proceedings of the 26th International Conference on Foundations of Software Technology
and Theoretical Computer Science FSTTCS 2006, Kolkata,
India, December 2006. Springer, LNCS 4337.
[bibtex].
I. Phillips and I. Ulidowski,
Reversing Algebraic Process Calculi.
In L. Aceto and A. Ingolfsdottir, editors, Proceedings of
the 9th International Conference on Foundations of Software Science and Computation Structures
FOSSACS 2006, Vienna, Austria, 2006. Springer, LNCS 3921.
[bibtex]Technical Report CS-06-01,
Department of Computer Science, University of Leicester, 2006.
I. Ulidowski, Priority Rewrite Systems for OSOS Process Languages.
In R. Amadio and D. Lugiez, editors, Proceedings of
the 14th International Conference on Concurrency Theory CONCUR
2003, Marseille, France, 2003. Springer, LNCS 2761.
[bibtex]
I. Ulidowski, Refusal Simulation and Interactive Games.
In H. Kirchner and C. Ringeissen, editors, Proceedings of the 9th
International Conference on Algebraic Methodology and Software
Technology AMAST 2002, Saint-Gilles-les-Bains, Reunion
Island, France, 2002. Springer, LNCS 2422.
[bibtex]
I. Ulidowski and S. Yuen,
Process Languages for Rooted Weak Preorders.
Technical Report 2002/11, Department of Mathematics and Computer Science,
University of Leicester, 2002.
I. Ulidowski and S. Yuen, Timed Properties for Process
Languages with Time. Proceedings of RIEC International
Symposium Rewriting in Proof and Computation, Sendai,
Japan, 2001.
I. Ulidowski and S. Yuen, General
Process Languages with Time. Technical Report 2000/41,
Department of Mathematics and Computer Science, University of
Leicester, 2000.
I. Ulidowski and S. Yuen, Process
Languages for Rooted Eager Bisimulation. In C. Palamidessi,
editor, Proceedings of the 11th International Conference on
Concurrency Theory CONCUR 2000, University Park,
Pennsylvania, 2000. Springer, LNCS 1877.
[bibtex]
I. Ulidowski and I. Phillips, Ordered SOS Rules and Process
Languages for Branching and Eager Bisimulations. Technical
Report 1999/15, Department of Mathematics and Computer Science,
University of Leicester, 1999.
I. Ulidowski, Finite Axiom Systems for Testing Preorder and
De Simone Process Languages. Technical Report 1999/8,
Department of Mathematics and Computer Science, University of
Leicester, 1999.
K. Subieta, J. Leszczylowski and I. Ulidowski, Processing
Semi-Structured Data in Object Bases. ICS PAS Report 852,
Institute of Computer Science, Polish Academy of Sciences,
1998.
I. Ulidowski and S. Yuen, Extending
Process Languages with Time. In M. Johnson, editor,
Proceedings of the 6th International Conference on Algebraic
Methodology and Software Technology AMAST'97, Sydney, Australia, 1997.
Springer, LNCS 1349.
[bibtex]
I. Ulidowski and I. Phillips,
Formats of Ordered SOS Rules with Silent Actions. In M. Bidoit and
M. Dauchet, editors, Proceedings of the 7th International
Conference on Theory and Practice of Software Development
TAPSOFT'97, Lille, France, 1997. Springer, LNCS 1214.
[bibtex]
I. Ulidowski, Concurrency Theory and Applications '96.
Proceedings of the 4th International RIMS Workshop, Kyoto
University, 1997.
I. Phillips and I. Ulidowski, Ordered
SOS Rules and Weak Bisimulation. In A. Adalat, S. Jourdan
and G. McCusker, editors, Advances in Theory and Formal Methods
of Computing , Imperial College Press, 1996.
I. Ulidowski, A Complete Proof System for an ISOS Process
Language. In the Proceedings of Applied Mathematics
Workshop, Ryukoku University, Otsu, Japan, 1994.
I. Ulidowski, Congruences for tau-respecting
formats of rules. In G. Burn, S. Gay and M.D. Ryan, editors,
Theory and Formal Methods 1993, Springer-Verlag,
1993.
I. Ulidowski, Equivalences on
Observable Processes. In Proceedings of the 7th Annual IEEE
Symposium on Logic in Computer Science LICS'92, Santa Cruz,
California, 1992. IEEE Computer Society Press.
[bibtex]
I. Ulidowski, Copy+refusal Testing. 7th British Colloquium for
Theoretical Computer Science BCTCS 7, University of
Liverpool, 1991.