dblp.uni-trier.dewww.uni-trier.de

Bengt Jonsson Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
92EEValé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
2008
91EEBengt Jonsson, Simon Perathoner, Lothar Thiele, Wang Yi: Cyclic dependencies in modular performance analysis. EMSOFT 2008: 179-188
90EETherese Berg, Bengt Jonsson, Harald Raffelt: Regular Inference for State Machines Using Domains with Equality Tests. FASE 2008: 317-331
89EEMayank Saksena, Oskar Wibling, Bengt Jonsson: Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. TACAS 2008: 18-32
2007
88EEBengt Jonsson, Mayank Saksena: Systematic Acceleration in Regular Model Checking. CAV 2007: 131-144
2006
87EEOlga Grinchtein, Bengt Jonsson, Paul Pettersson: Inference of Event-Recording Automata Using Timed Decision Trees. CONCUR 2006: 435-449
86EEParosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena: Proving Liveness by Backwards Reachability. CONCUR 2006: 95-109
85EETherese Berg, Bengt Jonsson, Harald Raffelt: Regular Inference for State Machines with Parameters. FASE 2006: 107-121
2005
84 Manfred Broy, Bengt Jonsson, Joost-Pieter Katoen, Martin Leucker, Alexander Pretschner: 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] Springer 2005
83EETherese Berg, Olga Grinchtein, Bengt Jonsson, Martin Leucker, Harald Raffelt, Bernhard Steffen: On the Correspondence Between Conformance Testing and Regular Inference. FASE 2005: 175-189
82EETherese Berg, Bengt Jonsson, Martin Leucker, Mayank Saksena: Insights to Angluin's Learning. Electr. Notes Theor. Comput. Sci. 118: 3-18 (2005)
81EEOlga Grinchtein, Bengt Jonsson, Martin Leucker: Inference of Timed Transition Systems. Electr. Notes Theor. Comput. Sci. 138(3): 87-99 (2005)
80EEParosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson: Simulating perfect channels with probabilistic lossy channels. Inf. Comput. 197(1-2): 22-40 (2005)
2004
79EEParosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena: Regular Model Checking for LTL(MSO). CAV 2004: 348-360
78EEParosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena: A Survey of Regular Model Checking. CONCUR 2004: 35-48
77EEJohan Blom, Anders Hessel, Bengt Jonsson, Paul Pettersson: Specifying and Generating Test Cases Using Observer Automata. FATES 2004: 125-139
76EEOlga Grinchtein, Bengt Jonsson, Martin Leucker: Learning of Event-Recording Automata. FORMATS/FTRTFT 2004: 379-396
75EEBengt Jonsson: Finite State Machines. Model-Based Testing of Reactive Systems 2004: 611-614
74EEParosh 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)
2003
73EEParosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso: Algorithmic Improvements in Regular Model Checking. CAV 2003: 236-248
72EEJohan Blom, Bengt Jonsson: Automated test generation for industrial Erlang applications. Erlang Workshop 2003: 8-14
71EEBengt Jonsson, Konstantinos F. Sagonas: Preface by the section editors. STTT 4(4): 401-404 (2003)
70EEJohn Håkansson, Bengt Jonsson, Ola Lundqvist: Generating online test oracles from temporal logic specifications. STTT 4(4): 456-471 (2003)
69 Parosh Aziz Abdulla, Bengt Jonsson: Model checking of systems with many identical timed processes. Theor. Comput. Sci. 290(1): 241-264 (2003)
2002
68EEParosh Aziz Abdulla, Bengt Jonsson, Pritha Mahata, Julien d'Orso: Regular Tree Model Checking. CAV 2002: 555-568
67EEParosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso: Regular Model Checking Made Simple and Efficient. CONCUR 2002: 116-130
66EEJakob Engblom, Bengt Jonsson: Processor Pipelines and Their Properties for Static WCET Analysis. EMSOFT 2002: 334-348
65EEWerner Damm, Bengt Jonsson: Eliminating Queues from RT UML Model Representations. FTRTFT 2002: 375-394
64EEBengt Jonsson, Wang Yi: Testing preorders for probabilistic processes can be characterized by simulations. Theor. Comput. Sci. 282(1): 33-51 (2002)
2001
63EEParosh Aziz Abdulla, Bengt Jonsson: Channel Representations in Protocol Verification. CONCUR 2001: 1-15
62EEBengt Jonsson, Gerardo Padilla: An Execution Semantics for MSC-2000. SDL Forum 2001: 365-378
61 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)
60EEParosh Aziz Abdulla, Bengt Jonsson: Ensuring completeness of symbolic verification methods for infinite-state systems. Theor. Comput. Sci. 256(1-2): 145-167 (2001)
2000
59 Parosh Aziz Abdulla, Bengt Jonsson: Invited Tutorial: Verification of Infinite-State and Parameterized Systems. CAV 2000: 4
58 Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson, Tayssir Touili: Regular Model Checking. CAV 2000: 403-418
57EEParosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson: Reasoning about Probabilistic Lossy Channel Systems. CONCUR 2000: 320-333
56 Bengt Jonsson, Tiziana Margaria, Gustaf Naeser, Jan Nyström, Bernhard Steffen: Incremental Requirement Specification for Evolving Systems. FIW 2000: 145-162
55 Elena Fersman, Bengt Jonsson: Abstraction of Communication Channels in Promela: A Case Study. SPIN 2000: 187-204
54EEBengt Jonsson, Marcus Nilsson: Transitive Closures of Regular Relations for Verifying Infinite-State Systems. TACAS 2000: 220-234
53 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)
1999
52EEBengt Jonsson, Wang Yi: Fully Abstract Characterization of Probabilistic May Testing. ARTS 1999: 1-18
51EEParosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson: Handling Global Conditions in Parameterized System Verification. CAV 1999: 134-145
50EEParosh Aziz Abdulla, Bengt Jonsson: On the Existence of Network Invariants for Verifying Parameterized Systems. Correct System Design 1999: 180-197
49EEBengt Jonsson, Amir Pnueli, Camilla Rump: Proving Refinement Using Transduction. Distributed Computing 12(2-3): 129-149 (1999)
1998
48EEParosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson: On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels. CAV 1998: 305-318
47EEParosh Aziz Abdulla, Bengt Jonsson, Mats Kindahl, Doron Peled: A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract). CAV 1998: 379-390
46EEJohan Bengtsson, Bengt Jonsson, Johan Lilius, Wang Yi: Partial Order Reductions for Timed Systems. CONCUR 1998: 485-500
45EEParosh Aziz Abdulla, Bengt Jonsson: Verifying Networks of Timed Processes (Extended Abstract). TACAS 1998: 298-312
44 Sven-Olof Nyström, Bengt Jonsson: A Fully Abstract Semantics for Concurrent Constraint Programming. Inf. Comput. 146(2): 138-180 (1998)
1996
43 Bengt Jonsson, Joachim Parrow: Formal Techniques in Real-Time and Fault-Tolerant Systems, 4th International Symposium, FTRTFT'96, Uppsala, Sweden, September 9-13, 1996, Proceedings Springer 1996
42 Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, Yih-Kuen Tsay: General Decidability Theorems for Infinite-State Systems. LICS 1996: 313-321
41 Parosh Aziz Abdulla, Bengt Jonsson: Verifying Programs with Unreliable Channels. Inf. Comput. 127(2): 91-101 (1996)
40 Parosh Aziz Abdulla, Bengt Jonsson: Undecidable Verification Problems for Programs with Unreliable Channels. Inf. Comput. 130(1): 71-90 (1996)
39EEBengt Jonsson, Yih-Kuen Tsay: Assumption/Guarantee Specifications in Linear-Time Temporal Logic. Theor. Comput. Sci. 167(1&2): 47-72 (1996)
1995
38EEBengt Jonsson, Lars Kempe: Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms. CAV 1995: 42-53
37 Bengt Jonsson, Wang Yi: Compositional Testing Preorders for Probabilistic Processes LICS 1995: 431-441
36EEBengt Jonsson, Yih-Kuen Tsay: Assumption/Guarantee Specifications in Linear-Time Temporal Logic (Extended Abstract). TAPSOFT 1995: 262-276
35 Bengt Jonsson, Joachim Parrow: Guest Editors Foreword. Nord. J. Comput. 2(2): 87 (1995)
1994
34 Bengt Jonsson, Joachim Parrow: CONCUR '94, Concurrency Theory, 5th International Conference, Uppsala, Sweden, August 22-25, 1994, Proceedings Springer 1994
33 Johan Blom, Bengt Jonsson, Lars Kempe: Using temporal logic for modular specification of telephone services. FIW 1994: 197-216
32EEWang Yi, Bengt Jonsson: Decidability of Timed Language-Inclusion for Networks of Real-Time Communicating Sequential Processes. FSTTCS 1994: 243-255
31 Bengt Jonsson, Chris Ho-Stuart, Wang Yi: Testing and Refinement for Nondeterministic and Probabilistic Processes. FTRTFT 1994: 418-430
30 Johan Blom, Bengt Jonsson: Constraint Oriented Temporal Logic Specification. Formal Systems Specification 1994: 161-182
29EEParosh Aziz Abdulla, Bengt Jonsson: Undecidable Verification Problems for Programs with Unreliable Channels. ICALP 1994: 316-327
28 Bengt Jonsson, Sven Eriksson: A Low Voltage Wave SI Filter Implementation using Improved Delay Elements. ISCAS 1994: 305-308
27EEBengt Jonsson: Compositional Specification and Verification of Distributed Systems. ACM Trans. Program. Lang. Syst. 16(2): 259-303 (1994)
26 Bengt Jonsson: A Fully Abstract Trace Model for Dataflow and Asynchronous Networks. Distributed Computing 7(4): 197-212 (1994)
25 Hans Hansson, Bengt Jonsson: A Logic for Reasoning about Time and Reliability. Formal Asp. Comput. 6(5): 512-535 (1994)
1993
24 Ricardo Civalero, Bengt Jonsson, Joakim Nilsson: Validating Simulations Between Large Nondeterministic Specifications. FORTE 1993: 3-17
23 Sven-Olof Nyström, Bengt Jonsson: Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations. ILPS 1993: 335-352
22 Parosh Aziz Abdulla, Bengt Jonsson: Verifying Programs with Unreliable Channels LICS 1993: 160-170
21 Bengt Jonsson, Joachim Parrow: Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs Inf. Comput. 107(2): 272-302 (1993)
1991
20 Bengt Jonsson, Joachim Parrow, Björn Pehrson: 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
19EEBengt Jonsson: Simulations Between Specifications of Distributed Systems. CONCUR 1991: 346-360
18 Patrik Ernberg, Lars-Åke Fredlund, Bengt Jonsson: Specification and Validation of a Simple Overtaking Protokol using LOTOS. FORTE 1991: 377-392
17 Bengt Jonsson, Kim Guldstrand Larsen: Specification and Refinement of Probabilistic Processes LICS 1991: 266-277
16 Bengt Jonsson, Joost N. Kok: Towards a Complete Hierarchy of Compositional Dataflow Models. TACS 1991: 204-225
15EEBengt Jonsson, Kim Guldstrand Larsen: On the Complexity of Equation Solving in Process Algebra. TAPSOFT, Vol.1 1991: 381-396
14EEEd Brinksma, Bengt Jonsson, Fredrik Orava: Refining Interfaces of Communicating Systems. TAPSOFT, Vol.2 1991: 297-312
1990
13EELars-Åke Fredlund, Bengt Jonsson, Joachim Parrow: An Implementation of a Translational Semantics for an Imperative Language. CONCUR 1990: 246-262
12 Hans Hansson, Bengt Jonsson: A Calculus for Communicating Systems with Time and Probabitilies. IEEE Real-Time Systems Symposium 1990: 278-287
11EEBengt Jonsson: A Hierarchy of Compositional Models of I/O-Automata (Extended Abstract). MFCS 1990: 347-354
1989
10EEBengt 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
9 Hans Hansson, Bengt Jonsson, Fredrik Orava, Björn Pehrson: Specification for Verification. FORTE 1989: 227-244
8 Hans Hansson, Bengt Jonsson: A Framework for Reasoning about Time and Reliability. IEEE Real-Time Systems Symposium 1989: 102-111
7EEBengt Jonsson, Joost N. Kok: Comparing Two Fully Abstract Dataflow Models. PARLE (2) 1989: 217-234
6 Bengt Jonsson: A Fully Abstract Trace Model for Dataflow Networks. POPL 1989: 155-165
5EEBengt Jonsson: On Decomposing and Refining Specifications of Distributed Systems. REX Workshop 1989: 361-385
4EEBengt Jonsson, Joachim Parrow: Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. STACS 1989: 421-433
1987
3 Bengt Jonsson: Modular Verification of Asynchronous Networks. PODC 1987: 152-166
1986
2 Bengt Jonsson, Zohar Manna, Richard J. Waldinger: Towards Deductive Synthesis of Dataflow Networks LICS 1986: 26-37
1985
1 Bengt Jonsson: A Model and Proof System for Asynchronous Networks. PODC 1985: 49-58

Coauthor Index

1Parosh Aziz Abdulla [22] [29] [40] [41] [42] [45] [47] [48] [50] [51] [53] [57] [59] [60] [63] [67] [68] [69] [73] [74] [78] [79] [80] [86]
2Christel Baier [57] [80]
3Johan Bengtsson [46]
4Therese Berg [82] [83] [85] [90]
5Antonia Bertolino [92]
6Gordon S. Blair [92]
7Johan Blom [30] [33] [72] [77]
8Ahmed Bouajjani [48] [51] [58] [74]
9Ed Brinksma [14]
10Manfred Broy [84]
11Radu Calinescu [92]
12Karlis Cerans [42] [53]
13Ricardo Civalero [24]
14Aurore Collomb-Annichini [74]
15Werner Damm [65]
16Jakob Engblom [66]
17Sven Eriksson [28]
18Patrik Ernberg [18]
19Elena Fersman [55]
20Lars-Åke Fredlund (Lars-åke Fredlund) [13] [18]
21Paul Grace [92]
22Olga Grinchtein [76] [81] [83] [87]
23John Håkansson [70]
24Hans Hansson [8] [9] [12] [25]
25Anders Hessel [77]
26Chris Ho-Stuart [31]
27Paola Inverardi [92]
28Valérie Issarny [92]
29S. Purushothaman Iyer (S. Purushothaman) [57] [80]
30Joost-Pieter Katoen [84]
31Lars Kempe [33] [38]
32Ahmed Hussain Khan [10]
33Mats Kindahl [47]
34Joost N. Kok [7] [16]
35Marta Z. Kwiatkowska [92]
36Kim Guldstrand Larsen [15] [17]
37Martin Leucker [76] [81] [82] [83] [84]
38Johan Lilius [46]
39Ola Lundqvist [70]
40Pritha Mahata [68]
41Zohar Manna [2]
42Tiziana Margaria (Tiziana Margaria-Steffen) [56] [61]
43Gustaf Naeser [56] [61]
44Joakim Nilsson [24]
45Marcus Nilsson [51] [54] [58] [67] [73] [78] [79]
46Jan Nyström [56] [61]
47Sven-Olof Nyström [23] [44]
48Fredrik Orava [9] [14]
49Gerardo Padilla [62]
50Joachim Parrow [4] [10] [13] [20] [21] [34] [35] [43]
51Björn Pehrson [9] [20]
52Doron Peled [47]
53Simon Perathoner [91]
54Paul Pettersson [77] [87]
55Amir Pnueli [49]
56Alexander Pretschner [84]
57Harald Raffelt [83] [85] [90]
58Ahmed Rezine [86]
59Camilla Rump [49]
60Antonino Sabetta [92]
61Konstantinos F. Sagonas [71]
62Mayank Saksena [78] [79] [82] [86] [88] [89]
63Bernhard Steffen [56] [61] [83] [92]
64Lothar Thiele [91]
65Massimo Tivoli [92]
66Tayssir Touili [58]
67Yih-Kuen Tsay [36] [39] [42] [53]
68Richard J. Waldinger [2]
69Oskar Wibling [89]
70Wang Yi [31] [32] [37] [46] [52] [64] [91]
71Julien d'Orso [67] [68] [73] [79]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)