Bengt Jonsson

Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine: An Integrated Specification and Verification Technique for Highly Concurrent Data Structures. TACAS 2013: 324-338

Bengt Jonsson: Using refinement calculus techniques to prove linearizability. Formal Asp. Comput. 24(4-6): 537-554 (2012)

Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena: Regular model checking for LTL(MSO). STTT 14(2): 223-241 (2012)

Sofia Cassel, Bengt Jonsson, Falk Howar, Bernhard Steffen: A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations. ATVA 2012: 57-71

Taolue Chen, Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska: A Compositional Specification Theory for Component Behaviours. ESOP 2012: 148-168

Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska: Assume-Guarantee Reasoning for Safe Component Behaviours. FACS 2012: 92-109

Falk Howar, Malte Isberner, Bernhard Steffen, Oliver Bauer, Bengt Jonsson: Inferring Semantic Interfaces of Data Structures. ISoLA (1) 2012: 554-571

Maik Merten, Falk Howar, Bernhard Steffen, Sofia Cassel, Bengt Jonsson: Demonstrating Learning of Register Automata. TACAS 2012: 466-471

Falk Howar, Bernhard Steffen, Bengt Jonsson, Sofia Cassel: Inferring Canonical Register Automata. VMCAI 2012: 251-266

Sofia Cassel, Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen: A Succinct Canonical Register Automaton Model. ATVA 2011: 366-380

Bengt Jonsson: Learning of Automata Models Extended with Data. SFM 2011: 327-349

Olga Grinchtein, Bengt Jonsson, Martin Leucker: Learning of event-recording automata. Theor. Comput. Sci. 411(47): 4029-4054 (2010)

Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen, Sofia Cassel: On Handling Data in Automata Learning - Considerations from the CONNECT Perspective. ISoLA (2) 2010: 221-235

Therese Bohlin, Bengt Jonsson, Siavash Soleimanifard: Inferring Compact Models of Communication Protocol Entities. ISoLA (1) 2010: 658-672

Fides Aarts, Bengt Jonsson, Johan Uijen: Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction. ICTSS 2010: 188-204

Valérie Issarny, Bernhard Steffen, Bengt Jonsson, Gordon S. Blair, Paul Grace, Marta Z. Kwiatkowska, Radu Calinescu, Paola Inverardi, Massimo Tivoli, Antonia Bertolino, Antonino Sabetta: CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems. ICECCS 2009: 154-161

Bengt Jonsson: State-space exploration for concurrent algorithms under weak memory orderings: (preliminary version). SIGARCH Computer Architecture News 36(5): 65-71 (2008)

Bengt Jonsson, Simon Perathoner, Lothar Thiele, Wang Yi: Cyclic dependencies in modular performance analysis. EMSOFT 2008: 179-188

Therese Berg, Bengt Jonsson, Harald Raffelt: Regular Inference for State Machines Using Domains with Equality Tests. FASE 2008: 317-331

Mayank Saksena, Oskar Wibling, Bengt Jonsson: Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. TACAS 2008: 18-32

Bengt Jonsson, Mayank Saksena: Systematic Acceleration in Regular Model Checking. CAV 2007: 131-144

Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena: Proving Liveness by Backwards Reachability. CONCUR 2006: 95-109

Olga Grinchtein, Bengt Jonsson, Paul Pettersson: Inference of Event-Recording Automata Using Timed Decision Trees. CONCUR 2006: 435-449

Therese Berg, Bengt Jonsson, Harald Raffelt: Regular Inference for State Machines with Parameters. FASE 2006: 107-121

Therese Berg, Bengt Jonsson, Martin Leucker, Mayank Saksena: Insights to Angluin's Learning. Electr. Notes Theor. Comput. Sci. 118: 3-18 (2005)

Olga Grinchtein, Bengt Jonsson, Martin Leucker: Inference of Timed Transition Systems. Electr. Notes Theor. Comput. Sci. 138(3): 87-99 (2005)

Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson: Simulating perfect channels with probabilistic lossy channels. Inf. Comput. 197(1-2): 22-40 (2005)

Therese Berg, Olga Grinchtein, Bengt Jonsson, Martin Leucker, Harald Raffelt, Bernhard Steffen: On the Correspondence Between Conformance Testing and Regular Inference. FASE 2005: 175-189

Manfred Broy, Bengt Jonsson, Joost-Pieter Katoen, Martin Leucker, Alexander Pretschner (Eds.): Model-Based Testing of Reactive Systems, Advanced Lectures [The volume is the outcome of a research seminar that was held in Schloss Dagstuhl in January 2004]. Lecture Notes in Computer Science 3472, Springer 2005, isbn 3-540-26278-4

Parosh Aziz Abdulla, Aurore Collomb-Annichini, Ahmed Bouajjani, Bengt Jonsson: Using Forward Reachability Analysis for Verification of Lossy Channel Systems. Formal Methods in System Design 25(1): 39-65 (2004)

Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena: Regular Model Checking for LTL(MSO). CAV 2004: 348-360

Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena: A Survey of Regular Model Checking. CONCUR 2004: 35-48

Bengt Jonsson: Finite State Machines. Model-Based Testing of Reactive Systems 2004: 611-614

Johan Blom, Anders Hessel, Bengt Jonsson, Paul Pettersson: Specifying and Generating Test Cases Using Observer Automata. FATES 2004: 125-139

Olga Grinchtein, Bengt Jonsson, Martin Leucker: Learning of Event-Recording Automata. FORMATS/FTRTFT 2004: 379-396

Bengt Jonsson, Konstantinos F. Sagonas: Preface by the section editors. STTT 4(4): 401-404 (2003)

John Håkansson, Bengt Jonsson, Ola Lundqvist: Generating online test oracles from temporal logic specifications. STTT 4(4): 456-471 (2003)

Parosh Aziz Abdulla, Bengt Jonsson: Model checking of systems with many identical timed processes. Theor. Comput. Sci. 290(1): 241-264 (2003)

Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso: Algorithmic Improvements in Regular Model Checking. CAV 2003: 236-248

Johan Blom, Bengt Jonsson: Automated test generation for industrial Erlang applications. Erlang Workshop 2003: 8-14

Bengt Jonsson, Wang Yi: Testing preorders for probabilistic processes can be characterized by simulations. Theor. Comput. Sci. 282(1): 33-51 (2002)

Parosh Aziz Abdulla, Bengt Jonsson, Pritha Mahata, Julien d'Orso: Regular Tree Model Checking. CAV 2002: 555-568

Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso: Regular Model Checking Made Simple and Efficient. CONCUR 2002: 116-130

Jakob Engblom, Bengt Jonsson: Processor Pipelines and Their Properties for Static WCET Analysis. EMSOFT 2002: 334-348

Werner Damm, Bengt Jonsson: Eliminating Queues from RT UML Model Representations. FTRTFT 2002: 375-394

Bengt Jonsson, Tiziana Margaria, Gustaf Naeser, Jan Nyström, Bernhard Steffen: Incremental Requirement Specification for Evolving Systems. Nord. J. Comput. 8(1): 65-87 (2001)

Parosh Aziz Abdulla, Bengt Jonsson: Ensuring completeness of symbolic verification methods for infinite-state systems. Theor. Comput. Sci. 256(1-2): 145-167 (2001)

Parosh Aziz Abdulla, Bengt Jonsson: Channel Representations in Protocol Verification. CONCUR 2001: 1-15

Bengt Jonsson, Gerardo Padilla: An Execution Semantics for MSC-2000. SDL Forum 2001: 365-378

Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, Yih-Kuen Tsay: Algorithmic Analysis of Programs with Well Quasi-ordered Domains. Inf. Comput. 160(1-2): 109-127 (2000)

Parosh Aziz Abdulla, Bengt Jonsson: Invited Tutorial: Verification of Infinite-State and Parameterized Systems. CAV 2000: 4

Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson, Tayssir Touili: Regular Model Checking. CAV 2000: 403-418

Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson: Reasoning about Probabilistic Lossy Channel Systems. CONCUR 2000: 320-333

Bengt Jonsson, Tiziana Margaria, Gustaf Naeser, Jan Nyström, Bernhard Steffen: Incremental Requirement Specification for Evolving Systems. FIW 2000: 145-162

Elena Fersman, Bengt Jonsson: Abstraction of Communication Channels in Promela: A Case Study. SPIN 2000: 187-204

Bengt Jonsson, Marcus Nilsson: Transitive Closures of Regular Relations for Verifying Infinite-State Systems. TACAS 2000: 220-234

Bengt Jonsson, Amir Pnueli, Camilla Rump: Proving Refinement Using Transduction. Distributed Computing 12(2-3): 129-149 (1999)

Bengt Jonsson, Wang Yi: Fully Abstract Characterization of Probabilistic May Testing. ARTS 1999: 1-18

Parosh Aziz Abdulla, Bengt Jonsson: On the Existence of Network Invariants for Verifying Parameterized Systems. Correct System Design 1999: 180-197

Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson: Handling Global Conditions in Parameterized System Verification. CAV 1999: 134-145

Sven-Olof Nyström, Bengt Jonsson: A Fully Abstract Semantics for Concurrent Constraint Programming. Inf. Comput. 146(2): 138-180 (1998)

Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson: On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels. CAV 1998: 305-318

Parosh Aziz Abdulla, Bengt Jonsson, Mats Kindahl, Doron Peled: A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract). CAV 1998: 379-390

Johan Bengtsson, Bengt Jonsson, Johan Lilius, Wang Yi: Partial Order Reductions for Timed Systems. CONCUR 1998: 485-500

Parosh Aziz Abdulla, Bengt Jonsson: Verifying Networks of Timed Processes (Extended Abstract). TACAS 1998: 298-312

Parosh Aziz Abdulla, Bengt Jonsson: Verifying Programs with Unreliable Channels. Inf. Comput. 127(2): 91-101 (1996)

Parosh Aziz Abdulla, Bengt Jonsson: Undecidable Verification Problems for Programs with Unreliable Channels. Inf. Comput. 130(1): 71-90 (1996)

Bengt Jonsson, Yih-Kuen Tsay: Assumption/Guarantee Specifications in Linear-Time Temporal Logic. Theor. Comput. Sci. 167(1&2): 47-72 (1996)

Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, Yih-Kuen Tsay: General Decidability Theorems for Infinite-State Systems. LICS 1996: 313-321

Bengt Jonsson, Joachim Parrow (Eds.): Formal Techniques in Real-Time and Fault-Tolerant Systems, 4th International Symposium, FTRTFT'96, Uppsala, Sweden, September 9-13, 1996, Proceedings. Lecture Notes in Computer Science 1135, Springer 1996, isbn 3-540-61648-9

Bengt Jonsson, Joachim Parrow: Guest Editors Foreword. Nord. J. Comput. 2(2): 87 (1995)

Bengt Jonsson, Lars Kempe: Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms. CAV 1995: 42-53

Bengt Jonsson, Wang Yi: Compositional Testing Preorders for Probabilistic Processes. LICS 1995: 431-441

Bengt Jonsson, Yih-Kuen Tsay: Assumption/Guarantee Specifications in Linear-Time Temporal Logic (Extended Abstract). TAPSOFT 1995: 262-276

Bengt Jonsson: A Fully Abstract Trace Model for Dataflow and Asynchronous Networks. Distributed Computing 7(4): 197-212 (1994)

Hans Hansson, Bengt Jonsson: A Logic for Reasoning about Time and Reliability. Formal Asp. Comput. 6(5): 512-535 (1994)

Bengt Jonsson: Compositional Specification and Verification of Distributed Systems. ACM Trans. Program. Lang. Syst. 16(2): 259-303 (1994)

Johan Blom, Bengt Jonsson: Constraint Oriented Temporal Logic Specification. Formal Systems Specification 1994: 161-182

Johan Blom, Bengt Jonsson, Lars Kempe: Using temporal logic for modular specification of telephone services. FIW 1994: 197-216

Wang Yi, Bengt Jonsson: Decidability of Timed Language-Inclusion for Networks of Real-Time Communicating Sequential Processes. FSTTCS 1994: 243-255

Bengt Jonsson, Chris Ho-Stuart, Wang Yi: Testing and Refinement for Nondeterministic and Probabilistic Processes. FTRTFT 1994: 418-430

Parosh Aziz Abdulla, Bengt Jonsson: Undecidable Verification Problems for Programs with Unreliable Channels. ICALP 1994: 316-327

Bengt Jonsson, Sven Eriksson: A Low Voltage Wave SI Filter Implementation using Improved Delay Elements. ISCAS 1994: 305-308

Bengt Jonsson, Joachim Parrow (Eds.): CONCUR '94, Concurrency Theory, 5th International Conference, Uppsala, Sweden, August 22-25, 1994, Proceedings. Lecture Notes in Computer Science 836, Springer 1994, isbn 3-540-58329-7

Bengt Jonsson, Joachim Parrow: Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. Inf. Comput. 107(2): 272-302 (1993)

Ricardo Civalero, Bengt Jonsson, Joakim Nilsson: Validating Simulations Between Large Nondeterministic Specifications. FORTE 1993: 3-17

Parosh Aziz Abdulla, Bengt Jonsson: Verifying Programs with Unreliable Channels. LICS 1993: 160-170

Sven-Olof Nyström, Bengt Jonsson: Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations. ILPS 1993: 335-352

Bengt Jonsson: Simulations Between Specifications of Distributed Systems. CONCUR 1991: 346-360

Patrik Ernberg, Lars-Åke Fredlund, Bengt Jonsson: Specification and Validation of a Simple Overtaking Protokol using LOTOS. FORTE 1991: 377-392

Bengt Jonsson, Kim Guldstrand Larsen: Specification and Refinement of Probabilistic Processes. LICS 1991: 266-277

Bengt Jonsson, Joost N. Kok: Towards a Complete Hierarchy of Compositional Dataflow Models. TACS 1991: 204-225

Ed Brinksma, Bengt Jonsson, Fredrik Orava: Refining Interfaces of Communicating Systems. TAPSOFT, Vol.2 1991: 297-312

Bengt Jonsson, Kim Guldstrand Larsen: On the Complexity of Equation Solving in Process Algebra. TAPSOFT, Vol.1 1991: 381-396

Bengt Jonsson, Joachim Parrow, Björn Pehrson (Eds.): Protocol Specification, Testing and Verification XI, Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification, Stockholm, Sweden, 18-20 June 1991. North-Holland 1991, isbn 0-444-89210-9

Lars-Åke Fredlund, Bengt Jonsson, Joachim Parrow: An Implementation of a Translational Semantics for an Imperative Language. CONCUR 1990: 246-262

Bengt Jonsson: A Hierarchy of Compositional Models of I/O-Automata (Extended Abstract). MFCS 1990: 347-354

Hans Hansson, Bengt Jonsson: A Calculus for Communicating Systems with Time and Probabitilies. RTSS 1990: 278-287

Bengt Jonsson, Ahmed Hussain Khan, Joachim Parrow: Implementing a Model Checking Algorithm by Adapting Existing Automated Tools. Automatic Verification Methods for Finite State Systems 1989: 179-188

Hans Hansson, Bengt Jonsson, Fredrik Orava, Björn Pehrson: Specification for Verification. FORTE 1989: 227-244

Bengt Jonsson, Joost N. Kok: Comparing Two Fully Abstract Dataflow Models. PARLE (2) 1989: 217-234

Bengt Jonsson: A Fully Abstract Trace Model for Dataflow Networks. POPL 1989: 155-165

Bengt Jonsson: On Decomposing and Refining Specifications of Distributed Systems. REX Workshop 1989: 361-385

Hans Hansson, Bengt Jonsson: A Framework for Reasoning about Time and Reliability. RTSS 1989: 102-111

Bengt Jonsson, Joachim Parrow: Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. STACS 1989: 421-433

Bengt Jonsson: Modular Verification of Asynchronous Networks. PODC 1987: 152-166

Bengt Jonsson, Zohar Manna, Richard J. Waldinger: Towards Deductive Synthesis of Dataflow Networks. LICS 1986: 26-37

Bengt Jonsson: A Model and Proof System for Asynchronous Networks. PODC 1985: 49-58