Publications by Bengt Jonsson

My publication list in the DBLP publication server

2012

Inferring Canonical Register Automata

VMCAI 2012

2011

Learning of Automata Models Extended with Data
Bengt Jonsson
in Marco Bernardo, Valérie Issarny (Eds.): Formal Methods for Eternal Networked Software Systems - 11th International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2011. Bertinoro, Italy, June 13-18, 2011. Lecture Notes in Computer Science 6659 pp. 327-349, Springer 2011
A Succinct Canonical Register Automaton Model
Sofia Cassel, Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen.
in ATVA 2011 to appear.
Regular model checking for MSO + LTL.
P.A. Abdulla, B. Jonsson, Marcus Nilsson, Julien d'Orso, and M. Saksena.
Journal of Software Tools for Technology Transfer, to appear.

2010

Learning of event-recording automata
Olga Grinchtein, Bengt Jonsson, Martin Leucker:
Theor. Comput. Sci. 411(47): 4029-4054 (2010)
Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction
Fides Aarts, Bengt Jonsson, Johan Uijen
in Alexandre Petrenko, Adenilso da Silva Simão, José Carlos Maldonado (Eds.): Testing Software and Systems - 22nd IFIP WG 6.1 International Conference, ICTSS 2010, Natal, Brazil, November 8-10, 2010. Proceedings. Lecture Notes in Computer Science 6435, pp. 188-204, Springer 2010
Inferring Compact Models of Communication Protocol Entities
Therese Bohlin, Bengt Jonsson, Siavash Soleimanifard
in Tiziana Margaria, Bernhard Steffen (Eds.): Leveraging Applications of Formal Methods, Verification, and Validation - 4th International Symposium on Leveraging Applications, ISoLA 2010, Heraklion, Crete, Greece, October 18-21, 2010, Proceedings, Part I. Lecture Notes in Computer Science 6415, pp 658-672, Springer 2010
On Handling Data in Automata Learning - Considerations from the CONNECT Perspective
Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen, Sofia Cassel.
in Tiziana Margaria, Bernhard Steffen (Eds.): Leveraging Applications of Formal Methods, Verification, and Validation - 4th International Symposium on Leveraging Applications, ISoLA 2010, Heraklion, Crete, Greece, October 18-21, 2010, Proceedings, Part II. Lecture Notes in Computer Science 6416, pp 221-235, Springer 2010

2008

Regular Inference for State Machines Using Domains with Equality Tests.
Therese Berg, Bengt Jonsson, Harald Raffelt
In Proc. FASE '08, 11th Int. Conf. on Fundamental Approaches to Software Engineering, volume 3961 of Lecture Notes in Computer Science, pages 317-331, 2008.
Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols.
Mayank Saksena, Oskar Wibling, and Bengt Jonsson.
In Proc. TACAS 2008, 14th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 4963 of Lecture Notes in Computer Science, Springer-Verlag, pp 18-32, 2008.
Cyclic dependencies in modular performance analysis.
Bengt Jonsson, Simon Perathoner, Lothar Thiele, and Wang Yi.
In L. de Alfaro and J. Palsberg, editors, Embedded Software, 8th Int. Conf., pages 179-188. ACM Press, 2008.
State-space exploration for concurrent algorithms under weak memory orderings
Bengt Jonsson
SIGARCH Computer Architecture News 36(5): 65-71 (2008)

2007

Systematic Acceleration in Regular Model Checking.
B. Jonsson, and M. Saksena.
In Proc. 19th Int. Conf. on Computer Aided Verification, volume 4590 of Lecture Notes in Computer Science, pages 131-144, 2007.

2006

Inference of Event-Recording Automata Using Timed Decision Trees.
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
In Proc. CONCUR 2006, 15th Int. Conf. on Concurrency Theory, volume 4137 of Lecture Notes in Computer Science, pages 435-449, 2006
Proving Liveness by Backwards Reachability.
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena
In Proc. CONCUR 2006, 15th Int. Conf. on Concurrency Theory, volume 4137 of Lecture Notes in Computer Science, pages 95-109, 2006
Regular Inference for State Machines with Parameters.
Therese Berg, Bengt Jonsson, Harald Raffelt
In Proc. FASE '06, 9th Int. Conf. on Fundamental Approaches to Software Engineering, volume 3922 of Lecture Notes in Computer Science, pages 107-121, 2006.

2005

Model-Based Testing of Reactive Systems, Advanced Lectures
Manfred Broy, Bengt Jonsson, Joost-Pieter Katoen, Martin Leucker, Alexander Pretschner
volume 3472 of Lecture Notes in Computer Science. Springer 2005
Simulating perfect channels with probabilistic lossy channels.
Parosh Aziz Abdulla, Christel Baier, Purushothaman Iyer, and Bengt Jonsson.
Information and Computation, 197(1-2):22--40, 2005.
On the correspondence between conformance testing and regular
T. Berg, O. Grinchtein, B. Jonsson M. Leucker, M. Leucker, and B. Steffen.
In Proc. FASE '05, 8th Int. Conf. on Fundamental Approaches to Software Engineering, volume 3442 of Lecture Notes in Computer Science, pages 175--189. Springer Verlag, 2005.
Inference of Timed Transition Systems.
Olga Grinchtein, Bengt Jonsson, Martin Leucker
Electr. Notes Theor. Comput. Sci. 138(3): 87-99 (2005)
Insights to Angluin's learning.
T. Berg, B. Jonsson, M. Leucker, and M. Saksena.
In Proceedings of the International Workshop on Software Verification and Validation (SVV 2003), volume 118 of Electronic Notes in Theoretical Computer Science, pages 3--18, December 2005.

2004

Using forward reachability analysis for verification of lossy channel
Parosh Aziz Abdulla, Aurore Annichini, and Ahmed Bouajjani.
Formal Methods in System Design, 25(1):39--65, 2004.
A survey of regular model checking.
P.A. Abdulla, B. Jonsson, Marcus Nilsson, and M. Saksena.
In Proc. CONCUR 2004, 15th Int. Conf. on Concurrency Theory, volume 3170 of Lecture Notes in Computer Science, pages 348--360, 2004.
Regular model checking for MSO + LTL.
P.A. Abdulla, B. Jonsson, Marcus Nilsson, Julien d'Orso, and M. Saksena.
In Proc. 16th Int. Conf. on Computer Aided Verification, pages 348--360, 2004.
Learning of event-recording automata.
O. Grinchtein, B. Jonsson, and M. Leucker.
In FORMATS/FTRTFT, volume 3253 of Lecture Notes in Computer Science, pages 379--396. Springer Verlag, 2004.
Specifying and generating test cases using observer automata.
J. Blom, A. Hessel, B. Jonsson, and P. Pettersson.
In Proc. FATES, 4th. International Workshop on Formal Approaches to Testing of Software, volume 3395 of Lecture Notes in Computer Science, pages 125--139. Springer Verlag, 2004.

2003

Generating on-line test oracles from temporal logic specifications.
J. Håkansson, B. Jonsson, and O. Lundqvist.
Journal of Software Tools for Technology Transfer,
4(4):456--471, 2003.
Model checking of systems with many identical timed processes.
Parosh Aziz Abdulla and Bengt Jonsson.
Theoretical Computer Science, 290(1):241--264, 2003.
Automated test generation for industrial Erlang applications.
J. Blom and B. Jonsson.
In Proc. 2003 ACM SIGPLAN workshop on Erlang, pages 8--14, Uppsala, Sweden, Aug. 2003.
Algorithmic improvements in regular model checking.
Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Julien d'Orso.
In Proc. 15th Int. Conf. on Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 236--248, 2003.

2002

Regular tree model checking.
Parosh Aziz Abdulla, Bengt Jonsson, Pritha Mahata, and Julien d'Orso.
In Proc. 14th Int. Conf. on Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, 2002.
Testing preorders for probabilistic processes can be characterized by
B. Jonsson and W. Yi.
Theoretical Computer Science, 282(1):33--51, 2002.
Regular model checking made simple and efficient.
Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Julien d'Orso.
\newblock In Proc. CONCUR 2002, 13th Int. Conf. on Concurrency, volume 2421 of Lecture Notes in Computer Science, pages 116--130, 2002.
Processor pipelines and their properties for static WCET analysis.
J. Engblom and B. Jonsson.
In A. Sangiovanni-Vincentelli and J. Sifakis, editors, Embedded Software, 2th Int. Conf., volume 2491 of Lecture Notes in Computer Science, pages 334--348. Springer Verlag, 2002.
Eliminating queues from RT UML model representations.
Werner Damm and Bengt Jonsson.
Lecture Notes in Computer Science, 2469:375--394, 2002.

2001

Channel representations in protocol verification.
Parosh Aziz Abdulla and Bengt Jonsson.
In Proc. CONCUR 2001, 12th Int. Conf. on Concurrency, volume 2154 of Lecture Notes in Computer Science, pages 1--15, 2001.
An execution semantics for MSC-2000.
B. Jonsson and G. Padilla.
In R. Reed and J. Reed, editors, Proc. 10th SDL Forum: SDL 2001: Meeting UML, volume 2078 of Lecture Notes in Computer Science, pages 365--378, Copenhagen, Denmark, June 2001. Springer Verlag.
Extracting the process structure of erlang applications.
J. Nyström} and B. Jonsson.
In Proc. Erlang Workshop, Firenze, Italy, Sept. 2001.
Incremental requirement specification for evolving systems.
B. Jonsson, T. Margaria, G. Naeser, J. Nyström, and B. Steffen.
Nordic Journal of Computing, 8(1):65--87, 2001.
Ensuring completeness of symbolic verification methods for infinite-state systems.
Parosh Aziz Abdulla and Bengt Jonsson.
Theoretical Computer Science, 256:145--167, 2001.

2000

Algorithmic analysis of programs with well quasi-ordered domains.
Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, and Tsay Yih-Kuen.
Information and Computation, 160:109--127, 2000.
Regular model checking.
A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili.
In Emerson and Sistla, editors, Proc. 12th Int. Conf. on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 403--418. Springer Verlag, 2000.
Using Forward Reachability Analysis for Verification of Lossy Channel Systems.
Parosh Aziz Abdulla, A. Annichini, Ahmed Bouajjani, Bengt Jonsson.
submitted for journal publication.
Model checking of systems with many identical timed processes.
P. Abdulla, and B. Jonsson.
submitted for journal publication.
Abstraction of communication channels in Promela: A case study.
E. Fersman and B. Jonsson.
In K. Havelund, J. Penix, and W. Visser, editors, SPIN Model Checking and Software Verification: Proc. 7th Int. SPIN Workshop, volume 1885 of Lecture Notes in Computer Science, pages 187-204, Stanford, CA, 2000. Springer Verlag.
Reasoning about probabilistic lossy channel systems.
P. Abdulla, C. Baier, Purushothaman Iyer, B. Jonsson.
In C. Palamidessi, editor, Proc. CONCUR 2000: 11th Int. Conf. on Concurrency Theory, volume 1877 of Lecture Notes in Computer Science, 2000.
Regular model checking.
A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili.
In Emerson and Sistla, editors, Proc. 12th Int. Conf. on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 403-418, 2000.
Incremental requirement specification for evolving systems.
B. Jonsson, T. Margaria, G. Naeser, J. Nyström, and B. Steffen.
In M. Calder and E. Magill, editors, Feature Interactions in Telecommunications and Software Systems VI, pages 145-162. IOS Press, 2000.
Transitive closures of regular relations for verifying infinite-state systems.
Bengt Jonsson and Marcus Nilsson.
In S. Graf and M. Schwartzbach, editors Proc. TACAS '00, 6th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1785 of Lecture Notes in Computer Science,, 2000, Springer Verlag.

1999

Proving refinement using transduction.
B. Jonsson, A. Pnueli, and C. Rump.
Distributed Computing, 12(2-3):129-149, 1999.
On modelling feature interactions in telecommunications.
B. Jonsson, T. Margaria, G. Naeser, J. Nyström, and B. Steffen.
In 11th Nordic Workshop on Programming Theory, Uppsala, Sweden., Oct. 1999.
On the existence of network invariants for verifying parameterized systems.
P. Abdulla, B. Jonsson.
In Olderog and Steffen eds. Correct System Design - Recent Insights and Advances, volume 1710 of Lecture Notes in Computer Science, pages 180-197, 1999.
Building tools for creation and analysis of telephone services.
G. Naeser, J. Nyström, and B. Jonsson.
In Proceedings of RVK '99, RadioVetenskap och Kommunikation'99, Karlskrona, Sweden, June 1999.
A case study in automated detection of service interactions.
G. Naeser, J. Nyström, and B. Jonsson.
In Proceedings of RVK '99, RadioVetenskap och Kommunikation'99, Karlskrona, Sweden, June 1999.
Handling global conditions in parameterized system verification.
P. Abdulla, A. Bouajjani, B. Jonsson, and M. Nilsson.
In Halbwachs and Peled, editors, Proc. 11th Int. Conf. on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 134-145, 1999.
Fully abstract characterization of probabilistic may testing.
B. Jonsson and W. Yi.
In Katoen, editor, ARTS'99, Formal Methods for Real-Time and Probabilistic Systems, 5th Int. AMAST Workshop, volume 1601 of Lecture Notes in Computer Science, pages 1-18. Springer Verlag, 1999.

1998

A fully abstract semantics for concurrent constraint programming.
S.-O. Nyström and B. Jonsson.
Information and Computation, 146:138-180, Nov. 1998.
Partial Order Reductions for Timed Systems.
J. Bengtsson, B. Jonsson, J. Lilius, W. Yi.
In Proc. CONCUR'98: 9th Int. Conf. on Concurrency Theory, volume 1466 of Lecture Notes in Computer Science, pages 485-500, 1998.
On-the-fly analysis of systems with unbounded, lossy FIFO channels.
Parosh Aziz Abdulla, Ahmed Bouajjani, and Bengt Jonsson.
In Proc. 10th Int. Conf. on Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 305-318, 1998.
A general approach to partial order reductions in symbolic verification.
Parosh Aziz Abdulla, Bengt Jonsson, Mats Kindahl, and Doron Peled.
In Proc. 10th Int. Conf. on Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 379-390, 1998.
Verifying networks of timed processes.
Parosh Aziz Abdulla and Bengt Jonsson.
In Bernhard Steffen, editor, Proc. TACAS '98, 4th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1384 of Lecture Notes in Computer Science, pages 298-312, 1998.

1997

Modelling and automated verification of authentication protocols.
Parosh Aziz Abdulla, Bengt Jonsson, and Aletta Nylen.
In Proceedings of Dimacs workshop on design and formal verification of security protocols, 1997.

1996

Assumption/guarantee specifications in linear-time temporal logic.
Bengt Jonsson and Yih-Kuen Tsay.
Theoretical Computer Science, 167(1-2):47-72, 30 October 1996
Undecidable verification problems for programs with unreliable channels.
Parosh Aziz Abdulla and Bengt Jonsson.
Information and Computation, 130(1):71-90, October 10, 1996.
abstract
Verifying programs with unreliable channels.
Parosh Aziz Abdulla and Bengt Jonsson.
Information and Computation, 127(2):91-101, June 15, 1996.
abstract
Creation of dependent features.
J. Blom, R. Bol, B. Jonsson, and J. Nyström.
In Proceedings of RVK '96, RadioVetenskap och Kommunikation'96, Luleå, Sweden, June 1996.
Constraint oriented temporal logic specification.
J. Blom and B. Jonsson.
In M. Broy, S. Merz, and K. Spies, editors, Formal Systems Specification, The RPC-Memory Specification Case Study, volume 1169 of Lecture Notes in Computer Science, pages 161-182. Springer Verlag, 1996.
General decidability theorems for infinite-state systems.
Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, and Tsay Yih-Kuen.
In Proc. 11th IEEE Int. Symp. on Logic in Computer Science, pages 313-321, 1996. abstract
A formalization of service independent building blocks.
J. Nyström and B. Jonsson.
In T. Margaria, editor, Proc. International Workshop on Advanced Intelligen Networks, pages 1-14, Passau, Germany, March 1996.

1995

Verifying safety properties of a class of infinite-state distributed algorithms.
Bengt Jonsson and Lars Kempe.
In Proc. 7th Int. Conf. on Computer Aided Verification, volume 939 of Lecture Notes in Computer Science, pages 42-53. Springer Verlag, 1995.
abstract | full version: postscript
Compositional testing preorders for probabilistic processes.
B. Jonsson and W. Yi.
In Proc. 10th IEEE Int. Symp. on Logic in Computer Science, pages 431-441, 1995.
Assumption/guarantee specifications in linear-time temporal logic.
Bengt Jonsson and Yih-Kuen Tsay.
In Mosses, Nielsen, and Schwartzbach, editors, TAPSOFT '95: Theory and Practice of Software Development, volume 915 of Lecture Notes in Computer Science, pages 262-276. Springer Verlag, 1995.

1994

Compositional specification and verification of distributed systems.
B. Jonsson.
ACM Trans. on Programming Languages and Systems, 16(2):259-303, 1994.
A logic for reasoning about time and reliability.
Hans Hansson and Bengt Jonsson.
Formal Aspects of Computing 6(5):512-535, 1994.
A fully abstract trace model for dataflow and asynchronous networks.
B. Jonsson.
Distributed Computing, 7:197-212, 1994.
Decidability of timed language-inclusion for networks of real-time communicating sequential processes.
Wang Yi and B. Jonsson.
In Proc. 14th Conf. on Foundations of Software Technology and Theoretical Computer Science, volume 880 of Lecture Notes in G Computer Science. Springer Verlag, 1994.
Undecidable verification problems for programs with unreliable channels.
Parosh Aziz Abdulla and Bengt Jonsson.
In Abiteboul and Shamir, editors, Proc. ICALP '94, volume 820 of Lecture Notes in Computer Science, pages 316-327. Springer Verlag, 1994.
Testing and refinement for nondeterministic and probabilistic processes.
B. Jonsson, C. Ho-Stuart, and W. Yi.
In Langmaack, de Roever, and Vytopil, editors, Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 863 of Lecture Notes in Computer Science, pages 418-430. Springer Verlag, 1994.
Using temporal logic for modular specification of telephone services.
J. Blom, B. Jonsson, and L. Kempe.
In L.G. Bouma and H. Velthuijsen, editors, Feature Interactions in Telecommunications Systems. IOS Press, Amsterdam, Netherlands, May 1994.
Proving refinement using transduction.
B. Jonsson, A. Pnueli, and C. Rump.
Technical Report DoCS 94/54, Dept. of Computer Systems, Uppsala University, Sweden, 1994. A simultaneous technical report of Lyngby, Uppsala, and Weizmann.
full version: postscript

1993

Deciding bisimulation equivalences for a class of Non-Finite-State programs.
Bengt Jonsson and Joachim Parrow.
Information and Computation, 107(2):272-302, December 1993.
Validating simulations between large nondeterministic specifications.
R. Civalero, B. Jonsson, and J. Nilsson.
In Proc. FORTE '93. North-Holland, 1993.
Indeterminate concurrent constraint programming: A fixpoint semantics for non-terminating computations.
S.-O. Nyström and B. Jonsson.
In International Logic Programming Symposium, Vancouver, British Columbia, Canada, Oct. 1993.
Verifying programs with unreliable channels.
Parosh Aziz Abdulla and Bengt Jonsson.
In Proc. 8th IEEE Int. Symp. on Logic in Computer Science, pages 160-170, 1993.

1991

Specification and validation of a simple overtaking protocol using LOTOS.
P. Ernberg, L.-å. Fredlund, and B. Jonsson.
In G. Rose, editor, Proc. FORTE '91, Sydney, Australia, Nov. 1991. North-Holland.
Towards a complete hierarchy of compositional dataflow models.
B. Jonsson and J. Kok.
In Proc. Int. Conf. on Theoretical Aspects of Computer Software, Lecture Notes in Computer Science, Sendai, Japan, Sept. 1991. Springer Verlag.
Simulations between specifications of distributed systems.
B. Jonsson.
In Proc. CONCUR '91, Theories of Concurrency: Unification and Extension, number 527 in Lecture Notes in Computer Science, Amsterdam, Holland, 1991. Springer Verlag.
Implementation of a translational semantics for an imperative language.
L.-å. Fredlund, B. Jonsson, and J. Parrow.
In Baeten, editor, Proc. CONCUR, Amsterdam, volume 458 of Lecture Notes in Computer Science. Springer Verlag, 1990.
Specification and refinement of probabilistic processes.
B. Jonsson and K. Larsen.
In Proc. 6th IEEE Int. Symp. on Logic in Computer Science, Amsterdam, Holland, July 1991.
On the complexity of equation solving in process algebra.
B. Jonsson and K. Larsen.
In Abramsky and Maibaum, editors, Proc. Coll. on Trees and Algebra in Programming, volume 493 of Lecture Notes in Computer Science, pages 381-396. Springer Verlag, 1991. Extended Version as SICS Research Report 91:05.
Refining interfaces of communicating systems. E. Brinksma, B. Jonsson, and F. Orava.
In Abramsky and Maibaum, editors, Proc. Coll. on Combining Paradigms for Software Development, volume 494 of Lecture Notes in Computer Science, pages 297-312. Springer Verlag, 1991.

1990

A calculus for communicating systems with time and probabilities.
H. Hansson and B. Jonsson.
In Proc. 11th IEEE Real -Time Systems Symposium, Orlando, Florida, 1990.
On decomposing and refining specifications of distributed systems.
B. Jonsson.
In de Bakker, de Roever, and Rozenberg, editors, Stepwise Refinement of Distributed Systems. Models, Formalisms, Correctness, volume 430 of Lecture Notes in Computer Science, pages 361-385. Springer Verlag, 1990.
A hierarchy of compositional models of I/O-automata.
B. Jonsson.
In Rovan, editor, Proc. Mathematical Foundations of Computer Science, volume 452 of Lecture Notes in Computer Science, pages 347-354. Springer Verlag, 1990. Extended Version as SICS Research Report 91:04.
Implementing a model checking algorithm by combining existing automated tools.
B. Jonsson, A. Khan, and J. Parrow.
In Sifakis, editor, Proc. Workshop on Computer Aided Verification, volume 407 of Lecture Notes in Computer Science. Springer Verlag, 1990.
Formal design of communication protocols.
H. Hansson, B. Jonsson, F. Orava, and B. Pehrson.
In Proc. 13th Int. Switching Symposium, Stockholm, Sweden, May 1990.

1989

A framework for reasoning about time and reliability.
H. Hansson and B. Jonsson.
In Proc. 10th IEEE Real -Time Systems Symposium, S:a Monica, Ca., 1989.
Specification for verification.
H. Hansson, B. Jonsson, F. Orava, and B. Pehrson.
In Vuong, editor, Proc. FORTE, IFIP TC/WG 6.1 2nd Int. Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols, pages 227 - 244, Vancouver, Canada, 1989.
Comparing two fully abstract dataflow models.
B. Jonsson and J. Kok.
In Proc. PARLE '89, volume 365 of Lecture Notes in Computer Science, pages 217-234. Springer Verlag, 1989.
Deciding bisimulation equivalences for a class of Non-Finite-State programs.
Bengt Jonsson and Joachim Parrow.
In Monien and Cori, editors, Proc. 6th Symposium on Theoretical Aspects of Computer Science, volume 349 of Lecture Notes in Computer Science, pages 421-433. Springer Verlag, 1989.
A fully abstract trace model for dataflow networks.
B. Jonsson.
In Proc. 16th ACM Symp. on Principles of Programming Languages, pages 155-165, 1989.

1987

Modular verification of asynchronous networks.
B. Jonsson.
In Proc. 6th ACM Symp. on Principles of Distributed Computing, Vancouver, Canada, pages 152-166, Vancouver, Canada, 1987.
Compositional Verification of Distributed Systems.
B. Jonsson.
PhD thesis, Dept. of Computer Systems, Uppsala University, Sweden, Uppsala, Sweden, 1987. Available as report DoCS 87/09.

1986

Towards deductive synthesis of dataflow networks.
B. Jonsson, Z. Manna, and R. Waldinger.
In Proceedings of Symposium on Logic in Computer Science, pages 26-37, 1986.

1985

A model and proof system for asynchronous networks.
B. Jonsson.
In Proc. 4th ACM Symp. on Principles of Distributed Computing, pages 49-58, Minaki, Canada, 1985.