default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBengt Jonsson 0001
Person information
- affiliation: Uppsala University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c115]Hooman Asadian
, Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas:
Monitor-based Testing of Network Protocol Implementations Using Symbolic Execution. ARES 2024: 17:1-17:12- [c114]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Sarbojit Das, Bengt Jonsson, Konstantinos Sagonas:
Parsimonious Optimal Dynamic Partial Order Reduction. CAV (2) 2024: 19-43 - [c113]Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist:
SMBugFinder: An Automated Framework for Testing Protocol Implementations for State Machine Bugs. ISSTA 2024: 1866-1870 - [c112]Simon Dierl, Paul Fiterau-Brostean, Falk Howar, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist:
Scalable Tree-based Register Automata Learning. TACAS (2) 2024: 87-108 - [i9]Simon Dierl, Paul Fiterau-Brostean, Falk Howar, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist:
Scalable Tree-based Register Automata Learning. CoRR abs/2401.14324 (2024) - [i8]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Sarbojit Das, Bengt Jonsson, Konstantinos Sagonas:
Parsimonious Optimal Dynamic Partial Order Reduction. CoRR abs/2405.11128 (2024) - 2023
- [c111]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Frederik Meyer Bønneland, Sarbojit Das, Bengt Jonsson, Magnus Lång, Konstantinos Sagonas:
Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs. ATVA 2023: 176-198 - [c110]Bengt Jonsson, Marta Kwiatkowska, Igor Walukiewicz:
CONCUR Test-Of-Time Award 2023 (Invited Paper). CONCUR 2023: 1:1-1:2 - [c109]Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist:
Automata-Based Automated Detection of State Machine Bugs in Protocol Implementations. NDSS 2023 - [c108]Sandip Ghosal, Bengt Jonsson, Philipp Rümmer:
An Active Learning Approach to Synthesizing Program Contracts. SEFM 2023: 126-144 - [i7]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Frederik Meyer Bønneland, Sarbojit Das, Bengt Jonsson, Magnus Lång, Konstantinos Sagonas:
Tailoring Stateless Model Checking for Event-Driven Multi-Threaded Programs. CoRR abs/2307.15930 (2023) - 2022
- [c107]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Bengt Jonsson, K. Narayan Kumar, Prakash Saivasan:
Consistency and Persistency in Program Verification: Challenges and Opportunities. Principles of Systems Design 2022: 494-510 - [c106]Bengt Jonsson, Magnus Lång, Konstantinos Sagonas:
Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens. FMCAD 2022: 284-293 - [c105]Hooman Asadian, Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas:
Applying Symbolic Execution to Test Implementations of a Network Protocol Against its Specification. ICST 2022: 70-81 - [c104]Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist:
DTLS-Fuzzer: A DTLS Protocol State Fuzzer. ICST 2022: 456-458 - [i6]Bengt Jonsson, Magnus Lång, Konstantinos Sagonas:
Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens. CoRR abs/2208.09259 (2022) - 2021
- [j38]Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine:
Correction to: An integrated specification and verification technique for highly concurrent data structures. Int. J. Softw. Tools Technol. Transf. 23(5): 825 (2021) - [j37]Kjell Winblad, Konstantinos Sagonas, Bengt Jonsson:
Lock-free Contention Adapting Search Trees. ACM Trans. Parallel Comput. 8(2): 10:1-10:38 (2021) - 2020
- [c103]Paul Fiterau-Brostean, Bengt Jonsson, Robert Merget, Joeri de Ruiter, Konstantinos Sagonas, Juraj Somorovsky:
Analysis of DTLS Implementations Using Protocol State Fuzzing. USENIX Security Symposium 2020: 2523-2540
2010 – 2019
- 2019
- [j36]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Magnus Lång, Tuan Phong Ngo, Konstantinos Sagonas:
Optimal stateless model checking for reads-from equivalence under sequential consistency. Proc. ACM Program. Lang. 3(OOPSLA): 150:1-150:29 (2019) - [j35]Jonatan Lindén, Pavol Bauer, Stefan Engblom, Bengt Jonsson:
Exposing Inter-process Information for Efficient PDES of Spatial Stochastic Systems on Multicores. ACM Trans. Model. Comput. Simul. 29(2): 11:1-11:25 (2019) - [c102]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Tuan Phong Ngo:
Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial). NETYS 2019: 3-18 - [p2]Falk Howar, Bengt Jonsson, Frits W. Vaandrager:
Combining Black-Box and White-Box Techniques for Learning Register Automata. Computing and Software Science 2019: 563-588 - [d1]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Magnus Lång, Tuan Phong Ngo, Konstantinos Sagonas:
Optimal Stateless Model Checking for Reads-From Equivalence under Sequential Consistency. Zenodo, 2019
- 2018
- [j34]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Tuan Phong Ngo:
Optimal stateless model checking under the release-acquire semantics. Proc. ACM Program. Lang. 2(OOPSLA): 135:1-135:29 (2018) - [c101]Sofia Cassel, Falk Howar, Bengt Jonsson, Bernhard Steffen:
Extending Automata Learning to Extended Finite State Machines. Machine Learning for Dynamic Software Analysis 2018: 149-177 - [c100]Parosh Aziz Abdulla, Bengt Jonsson, Cong Quy Trinh:
Fragment Abstraction for Concurrent Shape Analysis. ESOP 2018: 442-471 - [c99]Jonatan Lindén, Pavol Bauer, Stefan Engblom, Bengt Jonsson:
Fine-Grained Local Dynamic Load Balancing in PDES. SIGSIM-PADS 2018: 201-212 - [c98]Kjell Winblad, Konstantinos Sagonas, Bengt Jonsson:
Lock-free Contention Adapting Search Trees. SPAA 2018: 121-132 - [c97]Stavros Aronis, Bengt Jonsson, Magnus Lång, Konstantinos Sagonas:
Optimal Dynamic Partial Order Reduction with Observers. TACAS (2) 2018: 229-248 - [i5]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Tuan Phong Ngo:
Optimal Stateless Model Checking under the Release-Acquire Semantics. CoRR abs/1808.00843 (2018) - 2017
- [j33]Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas:
Stateless model checking for TSO and PSO. Acta Informatica 54(8): 789-818 (2017) - [j32]Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas:
Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction. J. ACM 64(4): 25:1-25:49 (2017) - [j31]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. Int. J. Softw. Tools Technol. Transf. 19(5): 549-563 (2017) - [c96]Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas:
Comparing Source Sets and Persistent Sets for Partial Order Reduction. Models, Algorithms, Logics and Tools 2017: 516-536 - [c95]Jonatan Lindén, Pavol Bauer, Stefan Engblom, Bengt Jonsson:
Exposing Inter-Process Information for Efficient Parallel Discrete Event Simulation of Spatial Stochastic Systems. SIGSIM-PADS 2017: 53-64 - 2016
- [j30]Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar:
Verification of heap manipulating programs with ordered data by extended forest automata. Acta Informatica 53(4): 357-385 (2016) - [j29]Sofia Cassel, Falk Howar, Bengt Jonsson, Bernhard Steffen:
Active learning for extended finite state machines. Formal Aspects Comput. 28(2): 233-263 (2016) - [c94]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson:
Stateless Model Checking for POWER. CAV (2) 2016: 134-156 - [c93]Johan Blom, Bengt Jonsson, Sven-Olof Nyström:
Industrial Evaluation of Test Suite Generation Strategies for Model-Based Testing. ICST Workshops 2016: 209-218 - [c92]Parosh Aziz Abdulla, Bengt Jonsson, Cong Quy Trinh:
Automated Verification of Linearization Policies. SAS 2016: 61-83 - [i4]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson:
Stateless Model Checking for POWER. CoRR abs/1605.02185 (2016) - 2015
- [j28]Fides Aarts, Bengt Jonsson, Johan Uijen, Frits W. Vaandrager:
Generating models of infinite-state communication protocols using regular inference with abstraction. Formal Methods Syst. Des. 46(1): 1-41 (2015) - [j27]Sofia Cassel, Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen:
A succinct canonical register automaton model. J. Log. Algebraic Methods Program. 84(1): 54-66 (2015) - [c91]Lukás Holík, Malte Isberner, Bengt Jonsson:
Mediator Synthesis in a Component Algebra with Data. Correct System Design 2015: 238-259 - [c90]Xiaoyue Pan, Bengt Jonsson:
A modeling framework for reuse distance-based estimation of cache performance. ISPASS 2015: 62-71 - [c89]Pavol Bauer, Jonatan Lindén, Stefan Engblom, Bengt Jonsson:
Efficient Inter-Process Synchronization for Parallel Discrete Event Simulation on Multicores. SIGSIM-PADS 2015: 183-194 - [c88]Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas:
Stateless Model Checking for TSO and PSO. TACAS 2015: 353-367 - [i3]Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas:
Stateless Model Checking for TSO and PSO. CoRR abs/1501.02069 (2015) - 2014
- [j26]Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska:
Compositional assume-guarantee reasoning for input/output component theories. Sci. Comput. Program. 91: 115-137 (2014) - [j25]Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska:
An algebraic theory of interface automata. Theor. Comput. Sci. 549: 146-174 (2014) - [j24]Philip Axer, Rolf Ernst, Heiko Falk, Alain Girault, Daniel Grund, Nan Guan, Bengt Jonsson, Peter Marwedel, Jan Reineke, Christine Rochange, Maurice Sebastian, Reinhard von Hanxleden, Reinhard Wilhelm, Wang Yi:
Building timing predictable embedded systems. ACM Trans. Embed. Comput. Syst. 13(4): 82:1-82:37 (2014) - [c87]Xiaoyue Pan, Bengt Jonsson:
Modeling cache coherence misses on multicores. ISPASS 2014: 96-105 - [c86]Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas:
Optimal dynamic partial order reduction. POPL 2014: 373-384 - [c85]Sofia Cassel, Falk Howar, Bengt Jonsson, Bernhard Steffen:
Learning Extended Finite State Machines. SEFM 2014: 250-264 - [c84]Farshid Hassani Bijarbooneh, Animesh Pathak, Justin Pearson, Valérie Issarny, Bengt Jonsson:
A Constraint Programming Approach for Managing End-to-end Requirements in Sensor Network Macroprogramming. SENSORNETS 2014: 28-40 - 2013
- [c83]Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar:
Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. ATVA 2013: 224-239 - [c82]Jonatan Lindén, Bengt Jonsson:
A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention. OPODIS 2013: 206-220 - [c81]Amel Bennaceur, Chris Chilton, Malte Isberner, Bengt Jonsson:
Automated Mediator Synthesis: Combining Behavioural and Ontological Reasoning. SEFM 2013: 274-288 - [c80]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 - 2012
- [j23]Bengt Jonsson:
Using refinement calculus techniques to prove linearizability. Formal Aspects Comput. 24(4-6): 537-554 (2012) - [j22]Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena:
Regular model checking for LTL(MSO). Int. J. Softw. Tools Technol. Transf. 14(2): 223-241 (2012) - [c79]Sofia Cassel, Bengt Jonsson, Falk Howar, Bernhard Steffen:
A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations. ATVA 2012: 57-71 - [c78]Taolue Chen, Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska:
A Compositional Specification Theory for Component Behaviours. ESOP 2012: 148-168 - [c77]Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska:
Assume-Guarantee Reasoning for Safe Component Behaviours. FACS 2012: 92-109 - [c76]Falk Howar, Malte Isberner, Bernhard Steffen, Oliver Bauer, Bengt Jonsson:
Inferring Semantic Interfaces of Data Structures. ISoLA (1) 2012: 554-571 - [c75]Maik Merten, Falk Howar, Bernhard Steffen, Sofia Cassel, Bengt Jonsson:
Demonstrating Learning of Register Automata. TACAS 2012: 466-471 - [c74]Falk Howar, Bernhard Steffen, Bengt Jonsson, Sofia Cassel:
Inferring Canonical Register Automata. VMCAI 2012: 251-266 - 2011
- [c73]Sofia Cassel, Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen:
A Succinct Canonical Register Automaton Model. ATVA 2011: 366-380 - [c72]Bengt Jonsson:
Learning of Automata Models Extended with Data. SFM 2011: 327-349 - 2010
- [j21]Olga Grinchtein, Bengt Jonsson, Martin Leucker:
Learning of event-recording automata. Theor. Comput. Sci. 411(47): 4029-4054 (2010) - [c71]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 - [c70]Therese Bohlin, Bengt Jonsson, Siavash Soleimanifard:
Inferring Compact Models of Communication Protocol Entities. ISoLA (1) 2010: 658-672 - [c69]Fides Aarts, Bengt Jonsson, Johan Uijen:
Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction. ICTSS 2010: 188-204 - [e5]Bengt Jonsson, Jörg Kreiker, Marta Z. Kwiatkowska:
Quantitative and Qualitative Analysis of Network Protocols, 31.01. - 05.02.2010. Dagstuhl Seminar Proceedings 10051, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i2]Bengt Jonsson, Jörg Kreiker, Marta Z. Kwiatkowska:
10051 Abstracts Collection - Quantitative and Qualitative Analysis of Network Protocols. Quantitative and Qualitative Analysis of Network Protocols 2010 - [i1]Bengt Jonsson, Jörg Kreiker, Marta Z. Kwiatkowska:
10051 Executive Summary - Quantitative and Qualitative Analysis of Network Protocols. Quantitative and Qualitative Analysis of Network Protocols 2010
2000 – 2009
- 2009
- [c68]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 - 2008
- [j20]Bengt Jonsson:
State-space exploration for concurrent algorithms under weak memory orderings: (preliminary version). SIGARCH Comput. Archit. News 36(5): 65-71 (2008) - [c67]Bengt Jonsson, Simon Perathoner, Lothar Thiele, Wang Yi:
Cyclic dependencies in modular performance analysis. EMSOFT 2008: 179-188 - [c66]Therese Berg, Bengt Jonsson, Harald Raffelt:
Regular Inference for State Machines Using Domains with Equality Tests. FASE 2008: 317-331 - [c65]Mayank Saksena, Oskar Wibling, Bengt Jonsson:
Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. TACAS 2008: 18-32 - 2007
- [c64]Bengt Jonsson, Mayank Saksena:
Systematic Acceleration in Regular Model Checking. CAV 2007: 131-144 - 2006
- [c63]Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena:
Proving Liveness by Backwards Reachability. CONCUR 2006: 95-109 - [c62]Olga Grinchtein, Bengt Jonsson, Paul Pettersson:
Inference of Event-Recording Automata Using Timed Decision Trees. CONCUR 2006: 435-449 - [c61]Therese Berg, Bengt Jonsson, Harald Raffelt:
Regular Inference for State Machines with Parameters. FASE 2006: 107-121 - 2005
- [j19]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) - [c60]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 - [e4]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]. Lecture Notes in Computer Science 3472, Springer 2005, ISBN 3-540-26278-4 [contents] - 2004
- [j18]Parosh Aziz Abdulla, Aurore Collomb-Annichini, Ahmed Bouajjani, Bengt Jonsson:
Using Forward Reachability Analysis for Verification of Lossy Channel Systems. Formal Methods Syst. Des. 25(1): 39-65 (2004) - [c59]Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena:
Regular Model Checking for LTL(MSO). CAV 2004: 348-360 - [c58]Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena:
A Survey of Regular Model Checking. CONCUR 2004: 35-48 - [c57]Bengt Jonsson:
Finite State Machines. Model-Based Testing of Reactive Systems 2004: 611-614 - [c56]Johan Blom, Anders Hessel, Bengt Jonsson, Paul Pettersson:
Specifying and Generating Test Cases Using Observer Automata. FATES 2004: 125-139 - [c55]Olga Grinchtein, Bengt Jonsson, Martin Leucker:
Learning of Event-Recording Automata. FORMATS/FTRTFT 2004: 379-396 - [c54]Olga Grinchtein, Bengt Jonsson, Martin Leucker:
Inference of Timed Transition Systems. INFINITY 2004: 87-99 - 2003
- [j17]Bengt Jonsson, Konstantinos Sagonas:
Preface by the section editors. Int. J. Softw. Tools Technol. Transf. 4(4): 401-404 (2003) - [j16]John Håkansson, Bengt Jonsson, Ola Lundqvist:
Generating online test oracles from temporal logic specifications. Int. J. Softw. Tools Technol. Transf. 4(4): 456-471 (2003) - [j15]Parosh Aziz Abdulla, Bengt Jonsson:
Model checking of systems with many identical timed processes. Theor. Comput. Sci. 290(1): 241-264 (2003) - [c53]Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso:
Algorithmic Improvements in Regular Model Checking. CAV 2003: 236-248 - [c52]Johan Blom, Bengt Jonsson:
Automated test generation for industrial Erlang applications. Erlang Workshop 2003: 8-14 - [c51]Therese Berg, Bengt Jonsson, Martin Leucker, Mayank Saksena:
Insights to Angluin's Learning. SVV@ICLP 2003: 3-18 - 2002
- [j14]Bengt Jonsson, Wang Yi:
Testing preorders for probabilistic processes can be characterized by simulations. Theor. Comput. Sci. 282(1): 33-51 (2002) - [c50]Parosh Aziz Abdulla, Bengt Jonsson, Pritha Mahata, Julien d'Orso:
Regular Tree Model Checking. CAV 2002: 555-568 - [c49]Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso:
Regular Model Checking Made Simple and Efficient. CONCUR 2002: 116-130 - [c48]Jakob Engblom, Bengt Jonsson:
Processor Pipelines and Their Properties for Static WCET Analysis. EMSOFT 2002: 334-348 - [c47]Werner Damm, Bengt Jonsson:
Eliminating Queues from RT UML Model Representations. FTRTFT 2002: 375-394 - 2001
- [j13]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) - [j12]Parosh Aziz Abdulla, Bengt Jonsson:
Ensuring completeness of symbolic verification methods for infinite-state systems. Theor. Comput. Sci. 256(1-2): 145-167 (2001) - [c46]Parosh Aziz Abdulla, Bengt Jonsson:
Channel Representations in Protocol Verification. CONCUR 2001: 1-15 - [c45]Bengt Jonsson, Gerardo Padilla:
An Execution Semantics for MSC-2000. SDL Forum 2001: 365-378 - [p1]Bengt Jonsson, Wang Yi, Kim G. Larsen:
Probabilistic Extensions of Process Algebras. Handbook of Process Algebra 2001: 685-710 - 2000
- [j11]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) - [c44]Parosh Aziz Abdulla, Bengt Jonsson:
Invited Tutorial: Verification of Infinite-State and Parameterized Systems. CAV 2000: 4 - [c43]Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson, Tayssir Touili:
Regular Model Checking. CAV 2000: 403-418 - [c42]Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson:
Reasoning about Probabilistic Lossy Channel Systems. CONCUR 2000: 320-333 - [c41]Bengt Jonsson, Tiziana Margaria, Gustaf Naeser, Jan Nyström, Bernhard Steffen:
Incremental Requirement Specification for Evolving Systems. FIW 2000: 145-162 - [c40]Elena Fersman, Bengt Jonsson:
Abstraction of Communication Channels in Promela: A Case Study. SPIN 2000: 187-204 - [c39]Bengt Jonsson, Marcus Nilsson:
Transitive Closures of Regular Relations for Verifying Infinite-State Systems. TACAS 2000: 220-234
1990 – 1999
- 1999
- [j10]Bengt Jonsson, Amir Pnueli, Camilla Rump:
Proving Refinement Using Transduction. Distributed Comput. 12(2-3): 129-149 (1999) - [c38]Bengt Jonsson, Wang Yi:
Fully Abstrac