Bengt Jonsson - RankMe

175 papers A* 22A 14B 31C 4Misc 2Journal 48Unranked 48

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Awaiting for Godot: stateless model checking that avoids executions where nothing happens. Formal Methods Syst. Des. Bengt Jonsson, Magnus Lång, Konstantinos Sagonas
2025	J	`jnl`	Efficient Linearizability Monitoring. CoRR Parosh Aziz Abdulla, Samuel Grahn, Bengt Jonsson, Shankaranarayanan Krishna, Om Swostik Mishra
2025	J	`jnl`	Efficient Linearizability Monitoring. Proc. ACM Program. Lang. Parosh Aziz Abdulla, Samuel Grahn, Bengt Jonsson, Shankaranarayanan Krishna, Om Swostik Mishra
2025	—	`conf`	Timing is All You Need. The Combined Power of Research, Education, and Dissemination Susanne Graf, Bengt Jonsson, Behnam Khodabandeloo, Chengzi Huang, Nikolaus Huber, Philipp Rümmer, Wang Yi
2025	—	`conf`	Trading Space for Simplicity in Stateless Model Checking. Real Time and Such Parosh Aziz Abdulla, Mohamed Faouzi Atig, Sarbojit Das, Bengt Jonsson, Konstantinos Sagonas
2024	B	`conf`	Monitor-based Testing of Network Protocol Implementations Using Symbolic Execution. ARES Hooman Asadian, Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas
2024	—	`conf`	Parsimonious Optimal Dynamic Partial Order Reduction. CAV (2) Parosh Aziz Abdulla, Mohamed Faouzi Atig, Sarbojit Das, Bengt Jonsson, Konstantinos Sagonas
2024	J	`jnl`	Parsimonious Optimal Dynamic Partial Order Reduction. CoRR Parosh Aziz Abdulla, Mohamed Faouzi Atig, Sarbojit Das, Bengt Jonsson, Konstantinos Sagonas
2024	A	`conf`	SMBugFinder: An Automated Framework for Testing Protocol Implementations for State Machine Bugs. ISSTA Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist
2024	—	`conf`	Scalable Tree-based Register Automata Learning. TACAS (2) Simon Dierl, Paul Fiterau-Brostean, Falk Howar, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist
2024	J	`jnl`	Scalable Tree-based Register Automata Learning. CoRR Simon Dierl, Paul Fiterau-Brostean, Falk Howar, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist
2024	—	`conf`	Testing IoT Protocol Requirements Using Fuzzing and Symbolic Execution: Application to CoAP. CSCN Hooman Asadian, Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas
2023	B	`conf`	An Active Learning Approach to Synthesizing Program Contracts. SEFM Sandip Ghosal, Bengt Jonsson, Philipp Rümmer
2023	A*	`conf`	Automata-Based Automated Detection of State Machine Bugs in Protocol Implementations. NDSS Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist
2023	B	`conf`	CONCUR Test-Of-Time Award 2023 (Invited Paper). CONCUR Bengt Jonsson, Marta Kwiatkowska, Igor Walukiewicz
2023	J	`jnl`	Tailoring Stateless Model Checking for Event-Driven Multi-Threaded Programs. CoRR Parosh Aziz Abdulla, Mohamed Faouzi Atig, Frederik Meyer Bønneland, Sarbojit Das, Bengt Jonsson, Magnus Lång, Konstantinos Sagonas
2023	B	`conf`	Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs. ATVA Parosh Aziz Abdulla, Mohamed Faouzi Atig, Frederik Meyer Bønneland, Sarbojit Das, Bengt Jonsson, Magnus Lång, Konstantinos Sagonas
2022	A	`conf`	Applying Symbolic Execution to Test Implementations of a Network Protocol Against its Specification. ICST Hooman Asadian, Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas
2022	B	`conf`	Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens. FMCAD Bengt Jonsson, Magnus Lång, Konstantinos Sagonas
2022	J	`jnl`	Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens. CoRR Bengt Jonsson, Magnus Lång, Konstantinos Sagonas
2022	—	`conf`	Consistency and Persistency in Program Verification: Challenges and Opportunities. Principles of Systems Design Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Bengt Jonsson, K. Narayan Kumar, Prakash Saivasan
2022	A	`conf`	DTLS-Fuzzer: A DTLS Protocol State Fuzzer. ICST Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist
2021	J	`jnl`	Correction to: An integrated specification and verification technique for highly concurrent data structures. Int. J. Softw. Tools Technol. Transf. Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine
2021	J	`jnl`	Lock-free Contention Adapting Search Trees. ACM Trans. Parallel Comput. Kjell Winblad, Konstantinos Sagonas, Bengt Jonsson
2020	A*	`conf`	Analysis of DTLS Implementations Using Protocol State Fuzzing. USENIX Security Symposium Paul Fiterau-Brostean, Bengt Jonsson, Robert Merget, Joeri de Ruiter, Konstantinos Sagonas, Juraj Somorovsky
2019	—	`ch.`	Combining Black-Box and White-Box Techniques for Learning Register Automata. Computing and Software Science Falk Howar, Bengt Jonsson, Frits W. Vaandrager
2019	—	`conf`	Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial). NETYS Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Tuan Phong Ngo
2019	J	`jnl`	Exposing Inter-process Information for Efficient PDES of Spatial Stochastic Systems on Multicores. ACM Trans. Model. Comput. Simul. Jonatan Lindén, Pavol Bauer, Stefan Engblom, Bengt Jonsson
2019	J	`jnl`	Optimal stateless model checking for reads-from equivalence under sequential consistency. Proc. ACM Program. Lang. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Magnus Lång, Tuan Phong Ngo, Konstantinos Sagonas
2018	—	`conf`	Extending Automata Learning to Extended Finite State Machines. Machine Learning for Dynamic Software Analysis Sofia Cassel, Falk Howar, Bengt Jonsson, Bernhard Steffen
2018	—	`conf`	Fine-Grained Local Dynamic Load Balancing in PDES. SIGSIM-PADS Jonatan Lindén, Pavol Bauer, Stefan Engblom, Bengt Jonsson
2018	A	`conf`	Fragment Abstraction for Concurrent Shape Analysis. ESOP Parosh Aziz Abdulla, Bengt Jonsson, Cong Quy Trinh
2018	B	`conf`	Lock-free Contention Adapting Search Trees. SPAA Kjell Winblad, Konstantinos Sagonas, Bengt Jonsson
2018	—	`conf`	Optimal Dynamic Partial Order Reduction with Observers. TACAS (2) Stavros Aronis, Bengt Jonsson, Magnus Lång, Konstantinos Sagonas
2018	J	`jnl`	Optimal Stateless Model Checking under the Release-Acquire Semantics. CoRR Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Tuan Phong Ngo
2018	J	`jnl`	Optimal stateless model checking under the release-acquire semantics. Proc. ACM Program. Lang. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Tuan Phong Ngo
2017	J	`jnl`	An integrated specification and verification technique for highly concurrent data structures. Int. J. Softw. Tools Technol. Transf. Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine
2017	—	`conf`	Comparing Source Sets and Persistent Sets for Partial Order Reduction. Models, Algorithms, Logics and Tools Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas
2017	—	`conf`	Exposing Inter-Process Information for Efficient Parallel Discrete Event Simulation of Spatial Stochastic Systems. SIGSIM-PADS Jonatan Lindén, Pavol Bauer, Stefan Engblom, Bengt Jonsson
2017	J	`jnl`	Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction. J. ACM Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas
2017	J	`jnl`	Stateless model checking for TSO and PSO. Acta Informatica Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas
2016	J	`jnl`	Active learning for extended finite state machines. Formal Aspects Comput. Sofia Cassel, Falk Howar, Bengt Jonsson, Bernhard Steffen
2016	B	`conf`	Automated Verification of Linearization Policies. SAS Parosh Aziz Abdulla, Bengt Jonsson, Cong Quy Trinh
2016	—	`conf`	Industrial Evaluation of Test Suite Generation Strategies for Model-Based Testing. ICST Workshops Johan Blom, Bengt Jonsson, Sven-Olof Nyström
2016	—	`conf`	Stateless Model Checking for POWER. CAV (2) Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson
2016	J	`jnl`	Stateless Model Checking for POWER. CoRR Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson
2016	J	`jnl`	Verification of heap manipulating programs with ordered data by extended forest automata. Acta Informatica Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar
2015	B	`conf`	A modeling framework for reuse distance-based estimation of cache performance. ISPASS Xiaoyue Pan, Bengt Jonsson
2015	J	`jnl`	A succinct canonical register automaton model. J. Log. Algebraic Methods Program. Sofia Cassel, Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen
2015	—	`conf`	Efficient Inter-Process Synchronization for Parallel Discrete Event Simulation on Multicores. SIGSIM-PADS Pavol Bauer, Jonatan Lindén, Stefan Engblom, Bengt Jonsson
2015	J	`jnl`	Generating models of infinite-state communication protocols using regular inference with abstraction. Formal Methods Syst. Des. Fides Aarts, Bengt Jonsson, Johan Uijen, Frits W. Vaandrager
2015	—	`conf`	Mediator Synthesis in a Component Algebra with Data. Correct System Design Lukás Holík, Malte Isberner, Bengt Jonsson
2015	A	`conf`	Stateless Model Checking for TSO and PSO. TACAS Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas
2015	J	`jnl`	Stateless Model Checking for TSO and PSO. CoRR Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas
2014	—	`conf`	A Constraint Programming Approach for Managing End-to-end Requirements in Sensor Network Macroprogramming. SENSORNETS Farshid Hassani Bijarbooneh, Animesh Pathak, Justin Pearson, Valérie Issarny, Bengt Jonsson
2014	J	`jnl`	An algebraic theory of interface automata. Theor. Comput. Sci. Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska
2014	J	`jnl`	Building timing predictable embedded systems. ACM Trans. Embed. Comput. Syst. 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
2014	J	`jnl`	Compositional assume-guarantee reasoning for input/output component theories. Sci. Comput. Program. Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska
2014	B	`conf`	Learning Extended Finite State Machines. SEFM Sofia Cassel, Falk Howar, Bengt Jonsson, Bernhard Steffen
2014	B	`conf`	Modeling cache coherence misses on multicores. ISPASS Xiaoyue Pan, Bengt Jonsson
2014	A*	`conf`	Optimal dynamic partial order reduction. POPL Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas
2013	B	`conf`	A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention. OPODIS Jonatan Lindén, Bengt Jonsson
2013	A	`conf`	An Integrated Specification and Verification Technique for Highly Concurrent Data Structures. TACAS Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine
2013	B	`conf`	Automated Mediator Synthesis: Combining Behavioural and Ontological Reasoning. SEFM Amel Bennaceur, Chris Chilton, Malte Isberner, Bengt Jonsson
2013	B	`conf`	Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. ATVA Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar
2012	A	`conf`	A Compositional Specification Theory for Component Behaviours. ESOP Taolue Chen, Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska
2012	B	`conf`	A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations. ATVA Sofia Cassel, Bengt Jonsson, Falk Howar, Bernhard Steffen
2012	—	`conf`	Assume-Guarantee Reasoning for Safe Component Behaviours. FACS Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska
2012	A	`conf`	Demonstrating Learning of Register Automata. TACAS Maik Merten, Falk Howar, Bernhard Steffen, Sofia Cassel, Bengt Jonsson
2012	B	`conf`	Inferring Canonical Register Automata. VMCAI Falk Howar, Bernhard Steffen, Bengt Jonsson, Sofia Cassel
2012	—	`conf`	Inferring Semantic Interfaces of Data Structures. ISoLA (1) Falk Howar, Malte Isberner, Bernhard Steffen, Oliver Bauer, Bengt Jonsson
2012	J	`jnl`	Regular model checking for LTL(MSO). Int. J. Softw. Tools Technol. Transf. Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena
2012	J	`jnl`	Using refinement calculus techniques to prove linearizability. Formal Aspects Comput. Bengt Jonsson
2011	B	`conf`	A Succinct Canonical Register Automaton Model. ATVA Sofia Cassel, Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen
2011	—	`conf`	Learning of Automata Models Extended with Data. SFM Bengt Jonsson
2010	—	`conf`	10051 Abstracts Collection - Quantitative and Qualitative Analysis of Network Protocols. Quantitative and Qualitative Analysis of Network Protocols Bengt Jonsson, Jörg Kreiker, Marta Z. Kwiatkowska
2010	—	`conf`	10051 Executive Summary - Quantitative and Qualitative Analysis of Network Protocols. Quantitative and Qualitative Analysis of Network Protocols Bengt Jonsson, Jörg Kreiker, Marta Z. Kwiatkowska
2010	C	`conf`	Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction. ICTSS Fides Aarts, Bengt Jonsson, Johan Uijen
2010	—	`conf`	Inferring Compact Models of Communication Protocol Entities. ISoLA (1) Therese Bohlin, Bengt Jonsson, Siavash Soleimanifard
2010	J	`jnl`	Learning of event-recording automata. Theor. Comput. Sci. Olga Grinchtein, Bengt Jonsson, Martin Leucker
2010	—	`conf`	On Handling Data in Automata Learning - Considerations from the CONNECT Perspective. ISoLA (2) Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen, Sofia Cassel
2010	—	`ed.`	Quantitative and Qualitative Analysis of Network Protocols, 31.01. - 05.02.2010 Quantitative and Qualitative Analysis of Network Protocols Bengt Jonsson, Jörg Kreiker, Marta Z. Kwiatkowska
2009	B	`conf`	CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems. ICECCS 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
2008	Misc	`conf`	Cyclic dependencies in modular performance analysis. EMSOFT Bengt Jonsson, Simon Perathoner, Lothar Thiele, Wang Yi
2008	A	`conf`	Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. TACAS Mayank Saksena, Oskar Wibling, Bengt Jonsson
2008	B	`conf`	Regular Inference for State Machines Using Domains with Equality Tests. FASE Therese Berg, Bengt Jonsson, Harald Raffelt
2008	J	`jnl`	State-space exploration for concurrent algorithms under weak memory orderings: (preliminary version). SIGARCH Comput. Archit. News Bengt Jonsson
2007	A*	`conf`	Systematic Acceleration in Regular Model Checking. CAV Bengt Jonsson, Mayank Saksena
2006	B	`conf`	Inference of Event-Recording Automata Using Timed Decision Trees. CONCUR Olga Grinchtein, Bengt Jonsson, Paul Pettersson
2006	B	`conf`	Proving Liveness by Backwards Reachability. CONCUR Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena
2006	B	`conf`	Regular Inference for State Machines with Parameters. FASE Therese Berg, Bengt Jonsson, Harald Raffelt
2005	—	`ed.`	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] Model-Based Testing of Reactive Systems Manfred Broy, Bengt Jonsson, Joost-Pieter Katoen, Martin Leucker, Alexander Pretschner
2005	B	`conf`	On the Correspondence Between Conformance Testing and Regular Inference. FASE Therese Berg, Olga Grinchtein, Bengt Jonsson, Martin Leucker, Harald Raffelt, Bernhard Steffen
2005	J	`jnl`	Simulating perfect channels with probabilistic lossy channels. Inf. Comput. Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson
2004	B	`conf`	A Survey of Regular Model Checking. CONCUR Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena
2004	—	`conf`	Finite State Machines. Model-Based Testing of Reactive Systems Bengt Jonsson
2004	—	`conf`	Inference of Timed Transition Systems. INFINITY Olga Grinchtein, Bengt Jonsson, Martin Leucker
2004	—	`conf`	Learning of Event-Recording Automata. FORMATS/FTRTFT Olga Grinchtein, Bengt Jonsson, Martin Leucker
2004	A*	`conf`	Regular Model Checking for LTL(MSO). CAV Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena
2004	—	`conf`	Specifying and Generating Test Cases Using Observer Automata. FATES Johan Blom, Anders Hessel, Bengt Jonsson, Paul Pettersson
2004	J	`jnl`	Using Forward Reachability Analysis for Verification of Lossy Channel Systems. Formal Methods Syst. Des. Parosh Aziz Abdulla, Aurore Collomb-Annichini, Ahmed Bouajjani, Bengt Jonsson
2003	A*	`conf`	Algorithmic Improvements in Regular Model Checking. CAV Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso
2003	—	`conf`	Automated test generation for industrial Erlang applications. Erlang Workshop Johan Blom, Bengt Jonsson
2003	J	`jnl`	Generating online test oracles from temporal logic specifications. Int. J. Softw. Tools Technol. Transf. John Håkansson, Bengt Jonsson, Ola Lundqvist
2003	—	`conf`	Insights to Angluin's Learning. SVV@ICLP Therese Berg, Bengt Jonsson, Martin Leucker, Mayank Saksena
2003	J	`jnl`	Model checking of systems with many identical timed processes. Theor. Comput. Sci. Parosh Aziz Abdulla, Bengt Jonsson
2003	J	`jnl`	Preface by the section editors. Int. J. Softw. Tools Technol. Transf. Bengt Jonsson, Konstantinos Sagonas
2002	—	`conf`	Eliminating Queues from RT UML Model Representations. FTRTFT Werner Damm, Bengt Jonsson
2002	Misc	`conf`	Processor Pipelines and Their Properties for Static WCET Analysis. EMSOFT Jakob Engblom, Bengt Jonsson
2002	B	`conf`	Regular Model Checking Made Simple and Efficient. CONCUR Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso
2002	A*	`conf`	Regular Tree Model Checking. CAV Parosh Aziz Abdulla, Bengt Jonsson, Pritha Mahata, Julien d'Orso
2002	J	`jnl`	Testing preorders for probabilistic processes can be characterized by simulations. Theor. Comput. Sci. Bengt Jonsson, Wang Yi
2001	—	`conf`	An Execution Semantics for MSC-2000. SDL Forum Bengt Jonsson, Gerardo Padilla
2001	B	`conf`	Channel Representations in Protocol Verification. CONCUR Parosh Aziz Abdulla, Bengt Jonsson
2001	J	`jnl`	Ensuring completeness of symbolic verification methods for infinite-state systems. Theor. Comput. Sci. Parosh Aziz Abdulla, Bengt Jonsson
2001	J	`jnl`	Incremental Requirement Specification for Evolving Systems. Nord. J. Comput. Bengt Jonsson, Tiziana Margaria, Gustaf Naeser, Jan Nyström, Bernhard Steffen
2001	—	`ch.`	Probabilistic Extensions of Process Algebras. Handbook of Process Algebra Bengt Jonsson, Wang Yi, Kim G. Larsen
2000	—	`conf`	Abstraction of Communication Channels in Promela: A Case Study. SPIN Elena Fersman, Bengt Jonsson
2000	J	`jnl`	Algorithmic Analysis of Programs with Well Quasi-ordered Domains. Inf. Comput. Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, Yih-Kuen Tsay
2000	—	`conf`	Incremental Requirement Specification for Evolving Systems. FIW Bengt Jonsson, Tiziana Margaria, Gustaf Naeser, Jan Nyström, Bernhard Steffen
2000	A*	`conf`	Invited Tutorial: Verification of Infinite-State and Parameterized Systems. CAV Parosh Aziz Abdulla, Bengt Jonsson
2000	B	`conf`	Reasoning about Probabilistic Lossy Channel Systems. CONCUR Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson
2000	A*	`conf`	Regular Model Checking. CAV Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson, Tayssir Touili
2000	A	`conf`	Transitive Closures of Regular Relations for Verifying Infinite-State Systems. TACAS Bengt Jonsson, Marcus Nilsson
1999	—	`conf`	Fully Abstract Characterization of Probabilistic May Testing. ARTS Bengt Jonsson, Wang Yi
1999	A*	`conf`	Handling Global Conditions in Parameterized System Verification. CAV Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson
1999	—	`conf`	On the Existence of Network Invariants for Verifying Parameterized Systems. Correct System Design Parosh Aziz Abdulla, Bengt Jonsson
1999	J	`jnl`	Proving Refinement Using Transduction. Distributed Comput. Bengt Jonsson, Amir Pnueli, Camilla Rump
1998	J	`jnl`	A Fully Abstract Semantics for Concurrent Constraint Programming. Inf. Comput. Sven-Olof Nyström, Bengt Jonsson
1998	A*	`conf`	A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract). CAV Parosh Aziz Abdulla, Bengt Jonsson, Mats Kindahl, Doron A. Peled
1998	A*	`conf`	On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels. CAV Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson
1998	B	`conf`	Partial Order Reductions for Timed Systems. CONCUR Johan Bengtsson, Bengt Jonsson, Johan Lilius, Wang Yi
1998	A	`conf`	Verifying Networks of Timed Processes (Extended Abstract). TACAS Parosh Aziz Abdulla, Bengt Jonsson
1996	J	`jnl`	Assumption/Guarantee Specifications in Linear-Time Temporal Logic. Theor. Comput. Sci. Bengt Jonsson, Yih-Kuen Tsay
1996	—	`ed.`	Formal Techniques in Real-Time and Fault-Tolerant Systems, 4th International Symposium, FTRTFT'96, Uppsala, Sweden, September 9-13, 1996, Proceedings FTRTFT Bengt Jonsson, Joachim Parrow
1996	A*	`conf`	General Decidability Theorems for Infinite-State Systems. LICS Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, Yih-Kuen Tsay
1996	J	`jnl`	Undecidable Verification Problems for Programs with Unreliable Channels. Inf. Comput. Parosh Aziz Abdulla, Bengt Jonsson
1996	J	`jnl`	Verifying Programs with Unreliable Channels. Inf. Comput. Parosh Aziz Abdulla, Bengt Jonsson
1995	—	`conf`	Assumption/Guarantee Specifications in Linear-Time Temporal Logic (Extended Abstract). TAPSOFT Bengt Jonsson, Yih-Kuen Tsay
1995	A*	`conf`	Compositional Testing Preorders for Probabilistic Processes LICS Bengt Jonsson, Wang Yi
1995	J	`jnl`	Guest Editors Foreword. Nord. J. Comput. Bengt Jonsson, Joachim Parrow
1995	A*	`conf`	Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms. CAV Bengt Jonsson, Lars Kempe
1994	J	`jnl`	A Fully Abstract Trace Model for Dataflow and Asynchronous Networks. Distributed Comput. Bengt Jonsson
1994	J	`jnl`	A Logic for Reasoning about Time and Reliability. Formal Aspects Comput. Hans Hansson, Bengt Jonsson
1994	B	`ed.`	CONCUR '94, Concurrency Theory, 5th International Conference, Uppsala, Sweden, August 22-25, 1994, Proceedings CONCUR Bengt Jonsson, Joachim Parrow
1994	J	`jnl`	Compositional Specification and Verification of Distributed Systems. ACM Trans. Program. Lang. Syst. Bengt Jonsson
1994	—	`conf`	Constraint Oriented Temporal Logic Specification. Formal Systems Specification Johan Blom, Bengt Jonsson
1994	—	`conf`	Decidability of Timed Language-Inclusion for Networks of Real-Time Communicating Sequential Processes. FSTTCS Wang Yi, Bengt Jonsson
1994	—	`conf`	Testing and Refinement for Nondeterministic and Probabilistic Processes. FTRTFT Bengt Jonsson, Chris Ho-Stuart, Wang Yi
1994	A*	`conf`	Undecidable Verification Problems for Programs with Unreliable Channels. ICALP Parosh Aziz Abdulla, Bengt Jonsson
1994	—	`conf`	Using temporal logic for modular specification of telephone services. FIW Johan Blom, Bengt Jonsson, Lars Kempe
1993	J	`jnl`	Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs Inf. Comput. Bengt Jonsson, Joachim Parrow
1993	—	`conf`	Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations. ILPS Sven-Olof Nyström, Bengt Jonsson
1993	C	`conf`	Validating Simulations Between Large Nondeterministic Specifications. FORTE Ricardo Civalero, Bengt Jonsson, Joakim Nilsson
1993	A*	`conf`	Verifying Programs with Unreliable Channels LICS Parosh Aziz Abdulla, Bengt Jonsson
1991	—	`conf`	On the Complexity of Equation Solving in Process Algebra. TAPSOFT, Vol.1 Bengt Jonsson, Kim Guldstrand Larsen
1991	—	`ed.`	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 PSTV Bengt Jonsson, Joachim Parrow, Björn Pehrson
1991	—	`conf`	Refining Interfaces of Communicating Systems. TAPSOFT, Vol.2 Ed Brinksma, Bengt Jonsson, Fredrik Orava
1991	B	`conf`	Simulations Between Specifications of Distributed Systems. CONCUR Bengt Jonsson
1991	A*	`conf`	Specification and Refinement of Probabilistic Processes LICS Bengt Jonsson, Kim Guldstrand Larsen
1991	C	`conf`	Specification and Validation of a Simple Overtaking Protokol using LOTOS. FORTE Patrik Ernberg, Lars-Åke Fredlund, Bengt Jonsson
1991	—	`conf`	Towards a Complete Hierarchy of Compositional Dataflow Models. TACS Bengt Jonsson, Joost N. Kok
1990	A	`conf`	A Calculus for Communicating Systems with Time and Probabitilies. RTSS Hans Hansson, Bengt Jonsson
1990	B	`conf`	A Hierarchy of Compositional Models of I/O-Automata (Extended Abstract). MFCS Bengt Jonsson
1990	B	`conf`	An Implementation of a Translational Semantics for an Imperative Language. CONCUR Lars-Åke Fredlund, Bengt Jonsson, Joachim Parrow
1989	A	`conf`	A Framework for Reasoning about Time and Reliability. RTSS Hans Hansson, Bengt Jonsson
1989	A*	`conf`	A Fully Abstract Trace Model for Dataflow Networks. POPL Bengt Jonsson
1989	—	`conf`	Comparing Two Fully Abstract Dataflow Models. PARLE (2) Bengt Jonsson, Joost N. Kok
1989	A	`conf`	Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. STACS Bengt Jonsson, Joachim Parrow
1989	—	`conf`	Implementing a Model Checking Algorithm by Adapting Existing Automated Tools. Automatic Verification Methods for Finite State Systems Bengt Jonsson, Ahmed Hussain Khan, Joachim Parrow
1989	—	`conf`	On Decomposing and Refining Specifications of Distributed Systems. REX Workshop Bengt Jonsson
1989	C	`conf`	Specification for Verification. FORTE Hans Hansson, Bengt Jonsson, Fredrik Orava, Björn Pehrson
1987	A*	`conf`	Modular Verification of Asynchronous Networks. PODC Bengt Jonsson
1986	A*	`conf`	Towards Deductive Synthesis of Dataflow Networks LICS Bengt Jonsson, Zohar Manna, Richard J. Waldinger
1985	A*	`conf`	A Model and Proof System for Asynchronous Networks. PODC Bengt Jonsson