The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Bengt Jonsson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  85. Cyclic dependencies in modular performance analysis. [Citation Graph (, )][DBLP]


  86. Regular Inference for State Machines Using Domains with Equality Tests. [Citation Graph (, )][DBLP]


  87. CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems. [Citation Graph (, )][DBLP]


  88. Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.455secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002